YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:03:54,610 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:03:54,612 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:03:54,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:03:54,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:03:54,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:03:54,626 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:03:54,627 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:03:54,629 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:03:54,629 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:03:54,630 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:03:54,630 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:03:54,631 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:03:54,632 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:03:54,633 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:03:54,634 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:03:54,635 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:03:54,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:03:54,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:03:54,640 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:03:54,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:03:54,642 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:03:54,644 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:03:54,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:03:54,644 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:03:54,645 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:03:54,645 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:03:54,646 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:03:54,646 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:03:54,647 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:03:54,648 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:03:54,648 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:03:54,649 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:03:54,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:03:54,650 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:03:54,650 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:03:54,650 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:03:54,651 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:03:54,652 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:03:54,652 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 10:03:54,667 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:03:54,667 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:03:54,668 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:03:54,668 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:03:54,668 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:03:54,669 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:03:54,669 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:03:54,669 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:03:54,669 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:03:54,669 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:03:54,670 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:03:54,670 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:03:54,670 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:03:54,670 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:03:54,670 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:03:54,670 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:03:54,671 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:03:54,671 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:03:54,671 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:03:54,671 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:03:54,671 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:03:54,672 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:03:54,672 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:03:54,672 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:03:54,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:03:54,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:03:54,672 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:03:54,673 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:03:54,673 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:03:54,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:03:54,712 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:03:54,715 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:03:54,717 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:03:54,717 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:03:54,718 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:03:54,777 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/a42989ee32354ccfab5086497040bd93/FLAGfd8780b67 [2020-06-22 10:03:55,112 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:03:55,113 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:03:55,113 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:03:55,119 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/a42989ee32354ccfab5086497040bd93/FLAGfd8780b67 [2020-06-22 10:03:55,535 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/a42989ee32354ccfab5086497040bd93 [2020-06-22 10:03:55,547 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:03:55,548 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:03:55,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:03:55,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:03:55,553 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:03:55,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7794c56e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55, skipping insertion in model container [2020-06-22 10:03:55,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:03:55,583 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:03:55,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:03:55,757 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:03:55,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:03:55,853 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:03:55,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55 WrapperNode [2020-06-22 10:03:55,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:03:55,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:03:55,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:03:55,855 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:03:55,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:03:55,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:03:55,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:03:55,893 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:03:55,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:03:55,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:03:55,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:03:55,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:03:55,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:03:55,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:03:55,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:03:55,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:03:55,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:03:55,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:03:55,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:03:56,255 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:03:56,256 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 10:03:56,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:03:56 BoogieIcfgContainer [2020-06-22 10:03:56,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:03:56,258 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:03:56,258 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:03:56,260 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:03:56,261 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:03:56" (1/1) ... [2020-06-22 10:03:56,277 INFO L313 BlockEncoder]: Initial Icfg 46 locations, 47 edges [2020-06-22 10:03:56,279 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:03:56,280 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:03:56,280 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:03:56,281 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:03:56,282 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:03:56,283 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:03:56,283 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:03:56,308 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:03:56,348 INFO L200 BlockEncoder]: SBE split 23 edges [2020-06-22 10:03:56,353 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:03:56,355 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:03:56,386 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding [2020-06-22 10:03:56,389 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:03:56,390 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:03:56,391 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:03:56,394 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 10:03:56,394 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:03:56,395 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:03:56,395 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:03:56,395 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:03:56,396 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:03:56,396 INFO L313 BlockEncoder]: Encoded RCFG 35 locations, 64 edges [2020-06-22 10:03:56,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:03:56 BasicIcfg [2020-06-22 10:03:56,397 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:03:56,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:03:56,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:03:56,402 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:03:56,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:03:55" (1/4) ... [2020-06-22 10:03:56,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdfdda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:03:56, skipping insertion in model container [2020-06-22 10:03:56,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (2/4) ... [2020-06-22 10:03:56,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdfdda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:03:56, skipping insertion in model container [2020-06-22 10:03:56,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:03:56" (3/4) ... [2020-06-22 10:03:56,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdfdda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:03:56, skipping insertion in model container [2020-06-22 10:03:56,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:03:56" (4/4) ... [2020-06-22 10:03:56,406 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:03:56,416 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:03:56,424 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2020-06-22 10:03:56,441 INFO L257 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2020-06-22 10:03:56,469 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:03:56,470 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:03:56,470 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:03:56,471 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:03:56,471 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:03:56,471 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:03:56,471 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:03:56,471 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:03:56,471 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:03:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-06-22 10:03:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:03:56,492 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:56,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:03:56,493 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:03:56,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:56,499 INFO L82 PathProgramCache]: Analyzing trace with hash 125222, now seen corresponding path program 1 times [2020-06-22 10:03:56,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:56,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:56,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:56,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:56,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:56,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:56,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:56,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:56,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:56,701 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-06-22 10:03:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:56,892 INFO L93 Difference]: Finished difference Result 35 states and 64 transitions. [2020-06-22 10:03:56,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:56,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:03:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:56,907 INFO L225 Difference]: With dead ends: 35 [2020-06-22 10:03:56,908 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 10:03:56,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 10:03:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 10:03:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:03:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 56 transitions. [2020-06-22 10:03:56,950 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 56 transitions. Word has length 3 [2020-06-22 10:03:56,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:56,951 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 56 transitions. [2020-06-22 10:03:56,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 56 transitions. [2020-06-22 10:03:56,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:03:56,952 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:56,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:03:56,952 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:03:56,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:56,953 INFO L82 PathProgramCache]: Analyzing trace with hash 125224, now seen corresponding path program 1 times [2020-06-22 10:03:56,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:56,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:56,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:56,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:56,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:56,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:56,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:56,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:56,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:56,997 INFO L87 Difference]: Start difference. First operand 31 states and 56 transitions. Second operand 3 states. [2020-06-22 10:03:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:57,105 INFO L93 Difference]: Finished difference Result 31 states and 56 transitions. [2020-06-22 10:03:57,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:57,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:03:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:57,107 INFO L225 Difference]: With dead ends: 31 [2020-06-22 10:03:57,107 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 10:03:57,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 10:03:57,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 10:03:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:03:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 48 transitions. [2020-06-22 10:03:57,114 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 48 transitions. Word has length 3 [2020-06-22 10:03:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:57,115 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 48 transitions. [2020-06-22 10:03:57,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 48 transitions. [2020-06-22 10:03:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:03:57,115 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:57,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:03:57,116 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:03:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,116 INFO L82 PathProgramCache]: Analyzing trace with hash 3883390, now seen corresponding path program 1 times [2020-06-22 10:03:57,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:57,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:57,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:57,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:57,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:57,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,144 INFO L87 Difference]: Start difference. First operand 27 states and 48 transitions. Second operand 3 states. [2020-06-22 10:03:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:57,227 INFO L93 Difference]: Finished difference Result 30 states and 48 transitions. [2020-06-22 10:03:57,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:57,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:03:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:57,229 INFO L225 Difference]: With dead ends: 30 [2020-06-22 10:03:57,229 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 10:03:57,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 10:03:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 10:03:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:03:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. [2020-06-22 10:03:57,234 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 4 [2020-06-22 10:03:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:57,234 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 45 transitions. [2020-06-22 10:03:57,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 45 transitions. [2020-06-22 10:03:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:03:57,235 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:57,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:03:57,235 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:03:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash 3883387, now seen corresponding path program 1 times [2020-06-22 10:03:57,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:57,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:57,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:57,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:57,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:57,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,272 INFO L87 Difference]: Start difference. First operand 27 states and 45 transitions. Second operand 3 states. [2020-06-22 10:03:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:57,348 INFO L93 Difference]: Finished difference Result 27 states and 45 transitions. [2020-06-22 10:03:57,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:57,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:03:57,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:57,349 INFO L225 Difference]: With dead ends: 27 [2020-06-22 10:03:57,349 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 10:03:57,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 10:03:57,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 10:03:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:03:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-06-22 10:03:57,354 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 4 [2020-06-22 10:03:57,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:57,354 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-06-22 10:03:57,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-06-22 10:03:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:03:57,355 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:57,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:03:57,355 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:03:57,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,355 INFO L82 PathProgramCache]: Analyzing trace with hash 3883389, now seen corresponding path program 1 times [2020-06-22 10:03:57,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:57,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:57,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:57,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:57,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,394 INFO L87 Difference]: Start difference. First operand 24 states and 39 transitions. Second operand 3 states. [2020-06-22 10:03:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:57,477 INFO L93 Difference]: Finished difference Result 24 states and 39 transitions. [2020-06-22 10:03:57,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:57,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:03:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:57,479 INFO L225 Difference]: With dead ends: 24 [2020-06-22 10:03:57,479 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 10:03:57,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 10:03:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:03:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:03:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2020-06-22 10:03:57,484 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 4 [2020-06-22 10:03:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:57,484 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. [2020-06-22 10:03:57,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. [2020-06-22 10:03:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:03:57,485 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:57,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:03:57,485 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:03:57,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,485 INFO L82 PathProgramCache]: Analyzing trace with hash 120386413, now seen corresponding path program 1 times [2020-06-22 10:03:57,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:57,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:57,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:57,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:57,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:57,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,515 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 3 states. [2020-06-22 10:03:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:57,607 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. [2020-06-22 10:03:57,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:57,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:03:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:57,613 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:03:57,613 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 10:03:57,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 10:03:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 10:03:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:03:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2020-06-22 10:03:57,617 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 5 [2020-06-22 10:03:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:57,617 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 28 transitions. [2020-06-22 10:03:57,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 28 transitions. [2020-06-22 10:03:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:03:57,618 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:57,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:03:57,618 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:03:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,619 INFO L82 PathProgramCache]: Analyzing trace with hash 120386415, now seen corresponding path program 1 times [2020-06-22 10:03:57,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:57,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:57,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:57,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:57,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:57,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,648 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. Second operand 3 states. [2020-06-22 10:03:57,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:57,690 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-06-22 10:03:57,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:57,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:03:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:57,691 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:03:57,691 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 10:03:57,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 10:03:57,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 10:03:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:03:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-06-22 10:03:57,694 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 5 [2020-06-22 10:03:57,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:57,695 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-06-22 10:03:57,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:57,695 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2020-06-22 10:03:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:03:57,695 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:57,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:03:57,696 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:03:57,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,696 INFO L82 PathProgramCache]: Analyzing trace with hash 120386416, now seen corresponding path program 1 times [2020-06-22 10:03:57,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:57,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:57,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:57,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:57,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:57,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,731 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 3 states. [2020-06-22 10:03:57,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:57,779 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2020-06-22 10:03:57,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:57,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:03:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:57,780 INFO L225 Difference]: With dead ends: 17 [2020-06-22 10:03:57,780 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:03:57,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:03:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:03:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:03:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:03:57,781 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-06-22 10:03:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:57,781 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:03:57,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:03:57,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:03:57,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:03:57,827 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:03:57,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:03:57,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:03:57,828 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 10:03:57,828 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 10:03:57,829 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:03:57,829 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 17) the Hoare annotation is: (and (= ULTIMATE.start_main_~z~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~y~0.base) 1) (= (select |#length| ULTIMATE.start_main_~z~0.base) 4) (= (select |#length| ULTIMATE.start_main_~y~0.base) 4) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~z~0.base) 1) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= ULTIMATE.start_main_~y~0.offset 0)) [2020-06-22 10:03:57,829 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2020-06-22 10:03:57,829 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:03:57,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:03:57,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:03:57,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:03:57,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:03:57,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:03:57,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:03:57,830 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 10:03:57,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:03:57,830 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 10:03:57,830 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 10:03:57,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:03:57,831 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 10:03:57,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:03:57,831 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-06-22 10:03:57,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:03:57,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:03:57,831 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 10:03:57,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:03:57,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:03:57,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:03:57,832 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:03:57,832 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:03:57,832 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:03:57,832 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:03:57,832 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:03:57,832 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:03:57,832 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:03:57,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:57,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:57,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:57,849 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:57,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:57,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:03:57,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:03:57 BasicIcfg [2020-06-22 10:03:57,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:03:57,853 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:03:57,853 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:03:57,856 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:03:57,857 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:03:57,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:03:55" (1/5) ... [2020-06-22 10:03:57,858 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f15d03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:03:57, skipping insertion in model container [2020-06-22 10:03:57,858 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:03:57,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (2/5) ... [2020-06-22 10:03:57,858 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f15d03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:03:57, skipping insertion in model container [2020-06-22 10:03:57,858 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:03:57,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:03:56" (3/5) ... [2020-06-22 10:03:57,859 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f15d03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:03:57, skipping insertion in model container [2020-06-22 10:03:57,859 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:03:57,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:03:56" (4/5) ... [2020-06-22 10:03:57,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f15d03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:03:57, skipping insertion in model container [2020-06-22 10:03:57,860 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:03:57,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:03:57" (5/5) ... [2020-06-22 10:03:57,861 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:03:57,881 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:03:57,881 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:03:57,881 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:03:57,881 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:03:57,882 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:03:57,882 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:03:57,882 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:03:57,882 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:03:57,882 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:03:57,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-06-22 10:03:57,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 10:03:57,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:03:57,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:03:57,896 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:03:57,896 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:57,896 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:03:57,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-06-22 10:03:57,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 10:03:57,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:03:57,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:03:57,899 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:03:57,899 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:57,905 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue [95] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 11#L-1true [136] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6] 9#L9true [181] L9-->L10: Formula: (and (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~x~0.base_16)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_18|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 13#L10true [182] L10-->L11: Formula: (and (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~y~0.base_13)) (= (select |v_#valid_34| v_ULTIMATE.start_main_~y~0.base_13) 1) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 32#L11true [183] L11-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_29| v_ULTIMATE.start_main_~z~0.base_16)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~z~0.base_16)) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~z~0.base_16 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_22|)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_23|, #length=|v_#length_29|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_22|, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 29#L13-3true [2020-06-22 10:03:57,906 INFO L796 eck$LassoCheckResult]: Loop: 29#L13-3true [190] L13-3-->L14: Formula: (and (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~x~0.base_18)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_18)) (< 0 (select (select |v_#memory_int_30| v_ULTIMATE.start_main_~x~0.base_18) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {#valid=|v_#valid_45|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_30|, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_18} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_30|, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_18, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 20#L14true [82] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_13| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~x~0.base_10) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 17#L14-1true [78] L14-1-->L14-2: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 16#L14-2true [187] L14-2-->L15: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~x~0.base_17)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem7_6| |v_ULTIMATE.start_main_#t~mem8_6|))) |v_#memory_int_24|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, #memory_int] 21#L15true [86] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 36#L15-1true [188] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_11) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~y~0.base_14)) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~y~0.base_14 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~y~0.base_14) v_ULTIMATE.start_main_~y~0.offset_11 |v_ULTIMATE.start_main_#t~mem9_6|)) |v_#memory_int_26|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_11 4) (select |v_#length_31| v_ULTIMATE.start_main_~y~0.base_14))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_14, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_11, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_14, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_11, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 5#L16true [62] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_8 4) (select |v_#length_23| v_ULTIMATE.start_main_~z~0.base_10)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~z~0.base_10)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~z~0.base_10) v_ULTIMATE.start_main_~z~0.offset_8))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 3#L16-1true [189] L16-1-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~z~0.base_17)) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~z~0.base_17 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~z~0.base_17) v_ULTIMATE.start_main_~z~0.offset_13 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem10_6|) (- 1)))) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_main_~z~0.offset_13) (= (select |v_#valid_44| v_ULTIMATE.start_main_~z~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_17, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_13, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_29|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_17, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_13, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, #memory_int] 29#L13-3true [2020-06-22 10:03:57,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,907 INFO L82 PathProgramCache]: Analyzing trace with hash 120594988, now seen corresponding path program 1 times [2020-06-22 10:03:57,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:57,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,955 INFO L82 PathProgramCache]: Analyzing trace with hash 783402215, now seen corresponding path program 1 times [2020-06-22 10:03:57,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:57,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,980 INFO L82 PathProgramCache]: Analyzing trace with hash 69110802, now seen corresponding path program 1 times [2020-06-22 10:03:57,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:03:58,455 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2020-06-22 10:03:58,571 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-06-22 10:03:58,585 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:03:58,586 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:03:58,586 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:03:58,587 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:03:58,587 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:03:58,587 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:03:58,587 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:03:58,587 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:03:58,587 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:03:58,587 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:03:58,588 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:03:58,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:58,876 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2020-06-22 10:03:58,994 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2020-06-22 10:03:58,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:58,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:58,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:03:59,370 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:03:59,376 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:03:59,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:03:59,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:03:59,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:03:59,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:03:59,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:03:59,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:03:59,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:03:59,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:03:59,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:03:59,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:03:59,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:03:59,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:03:59,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:03:59,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:03:59,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:03:59,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:03:59,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:03:59,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:03:59,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:03:59,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:03:59,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:03:59,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:03:59,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:03:59,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:03:59,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:03:59,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:03:59,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:03:59,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:03:59,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:03:59,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:03:59,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:03:59,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:03:59,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:03:59,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:03:59,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:03:59,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:03:59,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,547 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 10:03:59,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,548 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,550 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:03:59,550 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:03:59,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,558 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,560 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:03:59,560 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:03:59,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,570 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,572 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:03:59,572 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:03:59,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,580 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,583 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:03:59,583 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:03:59,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,640 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,642 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:03:59,642 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:03:59,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,651 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,653 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:03:59,653 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:03:59,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,670 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,672 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:03:59,672 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:03:59,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,675 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,676 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:03:59,676 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:03:59,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,685 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,686 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:03:59,686 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:03:59,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,689 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,691 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:03:59,691 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:03:59,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,700 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,700 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:03:59,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,702 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,703 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:03:59,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,705 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,705 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:03:59,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,707 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,707 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:03:59,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,709 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,709 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:03:59,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,711 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,712 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:03:59,712 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:03:59,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,715 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,716 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:03:59,716 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:03:59,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,719 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,720 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:03:59,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,721 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,722 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:03:59,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,724 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,725 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:03:59,725 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:03:59,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,728 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,728 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:03:59,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:03:59,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,730 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:03:59,730 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:03:59,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:03:59,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,731 INFO L497 LassoAnalysis]: Using template '3-nested'. [2020-06-22 10:03:59,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,732 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:03:59,734 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:03:59,734 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:03:59,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,743 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:03:59,745 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:03:59,745 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:03:59,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,756 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:03:59,758 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:03:59,758 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:03:59,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,767 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:03:59,771 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:03:59,771 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:03:59,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,803 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:03:59,805 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:03:59,805 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:03:59,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:03:59,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:03:59,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:03:59,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:03:59,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:03:59,815 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:03:59,817 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:03:59,817 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:03:59,844 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:03:59,882 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-06-22 10:03:59,882 INFO L444 ModelExtractionUtils]: 19 out of 29 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:03:59,885 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:03:59,887 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-06-22 10:03:59,887 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:03:59,888 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 3-nested ranking function: f0 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 f1 = 3*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 f2 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2020-06-22 10:04:00,027 INFO L297 tatePredicateManager]: 20 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:04:00,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,043 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,043 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:04:00,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:00,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 10:04:00,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:00,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:04:00,222 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:04:00,223 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:00,236 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:00,236 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:00,236 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2020-06-22 10:04:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:00,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 18 conjunts are in the unsatisfiable core [2020-06-22 10:04:00,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:00,575 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2020-06-22 10:04:00,773 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 81 [2020-06-22 10:04:00,777 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:00,815 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2020-06-22 10:04:00,817 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:00,856 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 82 [2020-06-22 10:04:00,859 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:00,890 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2020-06-22 10:04:00,892 INFO L427 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:00,931 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2020-06-22 10:04:00,933 INFO L427 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:00,964 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 88 [2020-06-22 10:04:00,966 INFO L427 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:00,999 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 [2020-06-22 10:04:01,001 INFO L427 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:01,033 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 [2020-06-22 10:04:01,035 INFO L427 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:01,053 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2020-06-22 10:04:01,055 INFO L427 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:01,454 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 100 [2020-06-22 10:04:01,454 INFO L497 ElimStorePlain]: treesize reduction 293, result has 61.0 percent of original size [2020-06-22 10:04:01,463 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2020-06-22 10:04:01,463 INFO L217 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:972, output treesize:423 [2020-06-22 10:04:01,669 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 71 [2020-06-22 10:04:01,800 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 72 [2020-06-22 10:04:01,802 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:01,894 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:01,902 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 68 [2020-06-22 10:04:01,904 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:01,983 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:01,990 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 68 [2020-06-22 10:04:01,991 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:02,067 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:02,069 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2020-06-22 10:04:02,069 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:259, output treesize:207 [2020-06-22 10:04:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:06,848 WARN L188 SmtUtils]: Spent 801.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-06-22 10:04:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:38,384 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:04:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:38,397 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:04:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:38,414 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:04:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:38,427 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:04:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:38,441 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:04:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:38,454 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:04:38,454 INFO L98 LoopCannibalizer]: 37 predicates before loop cannibalization 37 predicates after loop cannibalization [2020-06-22 10:04:38,459 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 37 loop predicates [2020-06-22 10:04:38,460 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states. Second operand 10 states. [2020-06-22 10:04:45,254 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 40 [2020-06-22 10:04:47,813 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 42 [2020-06-22 10:04:48,217 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 42 [2020-06-22 10:04:50,632 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 42 [2020-06-22 10:04:54,193 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 44 [2020-06-22 10:04:54,624 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 44 [2020-06-22 10:04:58,584 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 113 DAG size of output: 49 [2020-06-22 10:04:59,325 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2020-06-22 10:05:06,487 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 115 DAG size of output: 51 [2020-06-22 10:05:12,190 WARN L188 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 115 DAG size of output: 51 [2020-06-22 10:05:12,702 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 68 [2020-06-22 10:05:16,535 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 53 [2020-06-22 10:05:48,896 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62 [2020-06-22 10:06:11,990 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 70 [2020-06-22 10:06:13,499 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2020-06-22 10:06:14,297 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2020-06-22 10:06:18,142 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2020-06-22 10:06:19,534 WARN L188 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 57 [2020-06-22 10:06:21,729 WARN L188 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 127 DAG size of output: 59 [2020-06-22 10:06:23,517 WARN L188 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 61 [2020-06-22 10:06:29,443 WARN L188 SmtUtils]: Spent 5.49 s on a formula simplification. DAG size of input: 125 DAG size of output: 90 [2020-06-22 10:06:35,457 WARN L188 SmtUtils]: Spent 5.24 s on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2020-06-22 10:06:36,369 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2020-06-22 10:06:36,931 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66 [2020-06-22 10:06:36,983 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states.. Second operand 10 states. Result 762 states and 1289 transitions. Complement of second has 235 states. [2020-06-22 10:06:36,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 70 states 9 stem states 57 non-accepting loop states 4 accepting loop states [2020-06-22 10:06:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:06:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 757 transitions. [2020-06-22 10:06:36,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 757 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 10:06:36,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:06:36,988 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-06-22 10:06:37,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:06:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:06:37,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 10:06:37,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:06:37,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:06:37,042 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:06:37,043 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:06:37,051 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:06:37,052 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:06:37,052 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2020-06-22 10:06:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:06:37,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 18 conjunts are in the unsatisfiable core [2020-06-22 10:06:37,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:06:37,344 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2020-06-22 10:06:37,515 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2020-06-22 10:06:37,516 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:37,538 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 [2020-06-22 10:06:37,540 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:37,562 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2020-06-22 10:06:37,564 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:37,587 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2020-06-22 10:06:37,588 INFO L427 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:37,616 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 [2020-06-22 10:06:37,618 INFO L427 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:37,641 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 82 [2020-06-22 10:06:37,642 INFO L427 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:37,663 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2020-06-22 10:06:37,665 INFO L427 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:37,687 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 88 [2020-06-22 10:06:37,689 INFO L427 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:37,704 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 81 [2020-06-22 10:06:37,706 INFO L427 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:38,057 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 100 [2020-06-22 10:06:38,057 INFO L497 ElimStorePlain]: treesize reduction 293, result has 61.0 percent of original size [2020-06-22 10:06:38,062 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2020-06-22 10:06:38,062 INFO L217 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:972, output treesize:423 [2020-06-22 10:06:38,238 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 71 [2020-06-22 10:06:38,361 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 68 [2020-06-22 10:06:38,364 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:38,458 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:06:38,465 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 68 [2020-06-22 10:06:38,466 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:38,547 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:06:38,553 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 72 [2020-06-22 10:06:38,555 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:38,627 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:06:38,629 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2020-06-22 10:06:38,629 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:259, output treesize:207 [2020-06-22 10:06:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:06:38,922 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2020-06-22 10:06:38,922 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states. Second operand 10 states. [2020-06-22 10:06:40,171 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states.. Second operand 10 states. Result 96 states and 178 transitions. Complement of second has 20 states. [2020-06-22 10:06:40,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 8 non-accepting loop states 2 accepting loop states [2020-06-22 10:06:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:06:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2020-06-22 10:06:40,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 161 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 10:06:40,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:06:40,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 161 transitions. Stem has 13 letters. Loop has 8 letters. [2020-06-22 10:06:40,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:06:40,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 161 transitions. Stem has 5 letters. Loop has 16 letters. [2020-06-22 10:06:40,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:06:40,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 178 transitions. [2020-06-22 10:06:40,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 10:06:40,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 15 states and 21 transitions. [2020-06-22 10:06:40,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 10:06:40,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-06-22 10:06:40,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2020-06-22 10:06:40,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:06:40,568 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-06-22 10:06:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2020-06-22 10:06:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-06-22 10:06:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:06:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-06-22 10:06:40,570 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-06-22 10:06:40,570 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-06-22 10:06:40,570 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:06:40,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2020-06-22 10:06:40,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 10:06:40,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:06:40,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:06:40,571 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:06:40,571 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:06:40,572 INFO L794 eck$LassoCheckResult]: Stem: 1564#ULTIMATE.startENTRY [95] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1561#L-1 [135] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6] 1559#L9 [181] L9-->L10: Formula: (and (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~x~0.base_16)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_18|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 1560#L10 [182] L10-->L11: Formula: (and (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~y~0.base_13)) (= (select |v_#valid_34| v_ULTIMATE.start_main_~y~0.base_13) 1) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 1563#L11 [183] L11-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_29| v_ULTIMATE.start_main_~z~0.base_16)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~z~0.base_16)) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~z~0.base_16 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_22|)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_23|, #length=|v_#length_29|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_22|, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 1557#L13-3 [2020-06-22 10:06:40,573 INFO L796 eck$LassoCheckResult]: Loop: 1557#L13-3 [190] L13-3-->L14: Formula: (and (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~x~0.base_18)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_18)) (< 0 (select (select |v_#memory_int_30| v_ULTIMATE.start_main_~x~0.base_18) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {#valid=|v_#valid_45|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_30|, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_18} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_30|, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_18, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1562#L14 [82] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_13| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~x~0.base_10) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1566#L14-1 [78] L14-1-->L14-2: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1565#L14-2 [187] L14-2-->L15: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~x~0.base_17)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem7_6| |v_ULTIMATE.start_main_#t~mem8_6|))) |v_#memory_int_24|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, #memory_int] 1554#L15 [86] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1555#L15-1 [188] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_11) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~y~0.base_14)) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~y~0.base_14 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~y~0.base_14) v_ULTIMATE.start_main_~y~0.offset_11 |v_ULTIMATE.start_main_#t~mem9_6|)) |v_#memory_int_26|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_11 4) (select |v_#length_31| v_ULTIMATE.start_main_~y~0.base_14))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_14, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_11, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_14, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_11, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 1558#L16 [62] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_8 4) (select |v_#length_23| v_ULTIMATE.start_main_~z~0.base_10)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~z~0.base_10)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~z~0.base_10) v_ULTIMATE.start_main_~z~0.offset_8))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1556#L16-1 [189] L16-1-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~z~0.base_17)) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~z~0.base_17 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~z~0.base_17) v_ULTIMATE.start_main_~z~0.offset_13 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem10_6|) (- 1)))) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_main_~z~0.offset_13) (= (select |v_#valid_44| v_ULTIMATE.start_main_~z~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_17, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_13, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_29|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_17, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_13, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, #memory_int] 1557#L13-3 [2020-06-22 10:06:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:06:40,573 INFO L82 PathProgramCache]: Analyzing trace with hash 120565197, now seen corresponding path program 1 times [2020-06-22 10:06:40,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:06:40,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:06:40,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:06:40,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:06:40,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:06:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:06:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:06:40,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:06:40,598 INFO L82 PathProgramCache]: Analyzing trace with hash 783402215, now seen corresponding path program 2 times [2020-06-22 10:06:40,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:06:40,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:06:40,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:06:40,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:06:40,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:06:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:06:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:06:40,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:06:40,613 INFO L82 PathProgramCache]: Analyzing trace with hash -59971917, now seen corresponding path program 1 times [2020-06-22 10:06:40,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:06:40,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:06:40,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:06:40,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:06:40,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:06:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:06:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:06:41,076 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2020-06-22 10:06:41,220 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-06-22 10:06:41,224 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:06:41,224 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:06:41,224 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:06:41,224 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:06:41,224 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:06:41,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:06:41,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:06:41,225 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:06:41,225 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 10:06:41,225 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:06:41,225 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:06:41,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:06:41,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:06:41,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:06:41,531 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-06-22 10:06:41,645 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2020-06-22 10:06:41,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:06:41,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:06:41,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:06:41,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:06:41,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:06:41,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:06:41,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:06:41,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:06:41,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:06:42,039 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:06:42,040 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:06:42,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:06:42,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:06:42,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:06:42,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:06:42,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:06:42,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:06:42,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:06:42,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:06:42,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:06:42,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:06:42,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:06:42,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:06:42,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:06:42,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:06:42,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:06:42,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:06:42,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:06:42,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:06:42,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:06:42,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:06:42,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:06:42,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:06:42,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:06:42,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:06:42,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:06:42,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:06:42,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:06:42,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:06:42,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,116 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 10:06:42,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,117 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,118 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:06:42,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,119 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,119 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:06:42,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,121 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,122 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:06:42,122 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:06:42,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,128 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,129 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:06:42,129 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:06:42,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,135 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,137 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:06:42,137 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:06:42,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,148 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,151 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:06:42,151 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:06:42,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,170 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,171 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:06:42,171 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:06:42,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,173 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,174 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:06:42,174 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:06:42,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,180 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,182 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:06:42,182 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:06:42,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,193 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,193 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:06:42,193 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:06:42,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,196 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,196 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:06:42,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,198 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,198 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:06:42,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,200 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,200 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:06:42,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,201 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,202 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:06:42,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,203 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,204 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:06:42,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,205 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,205 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:06:42,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,207 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,208 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 10:06:42,208 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 10:06:42,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,210 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:06:42,210 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:06:42,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,211 INFO L497 LassoAnalysis]: Using template '3-nested'. [2020-06-22 10:06:42,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,212 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:06:42,212 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:06:42,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:06:42,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,214 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:06:42,214 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 10:06:42,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:06:42,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,216 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:06:42,217 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:06:42,217 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:06:42,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,225 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:06:42,226 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:06:42,226 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:06:42,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,234 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:06:42,236 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:06:42,236 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:06:42,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,250 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:06:42,254 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:06:42,254 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:06:42,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,277 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:06:42,278 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:06:42,278 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:06:42,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,281 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:06:42,282 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:06:42,283 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:06:42,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:06:42,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:06:42,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:06:42,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:06:42,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:06:42,290 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 10:06:42,292 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 10:06:42,292 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 10:06:42,357 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:06:42,378 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-06-22 10:06:42,378 INFO L444 ModelExtractionUtils]: 19 out of 29 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:06:42,379 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:06:42,380 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-06-22 10:06:42,380 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:06:42,381 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 3-nested ranking function: f0 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 f1 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 3*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 f2 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2020-06-22 10:06:42,518 INFO L297 tatePredicateManager]: 20 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:06:42,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,530 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,530 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,530 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,530 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,530 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:06:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:06:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:06:42,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:06:42,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:06:42,608 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:06:42,609 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2020-06-22 10:06:42,609 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:06:42,617 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:06:42,617 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:06:42,617 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2020-06-22 10:06:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:06:42,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2020-06-22 10:06:42,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:06:42,891 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2020-06-22 10:06:43,062 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 [2020-06-22 10:06:43,063 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:43,085 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 88 [2020-06-22 10:06:43,087 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:43,112 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 82 [2020-06-22 10:06:43,113 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:43,141 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2020-06-22 10:06:43,142 INFO L427 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:43,166 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 81 [2020-06-22 10:06:43,167 INFO L427 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:43,191 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2020-06-22 10:06:43,193 INFO L427 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:43,215 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 [2020-06-22 10:06:43,217 INFO L427 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:43,239 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2020-06-22 10:06:43,240 INFO L427 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:43,256 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2020-06-22 10:06:43,257 INFO L427 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:43,616 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 100 [2020-06-22 10:06:43,616 INFO L497 ElimStorePlain]: treesize reduction 293, result has 61.0 percent of original size [2020-06-22 10:06:43,621 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2020-06-22 10:06:43,621 INFO L217 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:972, output treesize:423 [2020-06-22 10:06:43,809 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 71 [2020-06-22 10:06:43,954 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 75 [2020-06-22 10:06:43,956 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:43,974 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 71 [2020-06-22 10:06:43,975 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:43,985 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 71 [2020-06-22 10:06:43,987 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:06:44,069 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:06:44,071 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2020-06-22 10:06:44,071 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:268, output treesize:207 [2020-06-22 10:06:46,111 WARN L188 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 77 [2020-06-22 10:06:46,269 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-06-22 10:06:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:06:47,041 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-06-22 10:06:49,956 WARN L188 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-06-22 10:06:57,964 WARN L188 SmtUtils]: Spent 2.80 s on a formula simplification that was a NOOP. DAG size: 55 [2020-06-22 10:07:00,083 WARN L188 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 56 [2020-06-22 10:07:08,648 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-06-22 10:07:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:07:10,424 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:07:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:07:10,436 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:07:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:07:10,449 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:07:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:07:10,462 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:07:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:07:10,474 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:07:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:07:10,486 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:07:10,486 INFO L98 LoopCannibalizer]: 37 predicates before loop cannibalization 37 predicates after loop cannibalization [2020-06-22 10:07:10,486 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 37 loop predicates [2020-06-22 10:07:10,487 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 19 transitions. cyclomatic complexity: 7 Second operand 10 states. [2020-06-22 10:07:11,856 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 19 transitions. cyclomatic complexity: 7. Second operand 10 states. Result 21 states and 28 transitions. Complement of second has 17 states. [2020-06-22 10:07:11,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2020-06-22 10:07:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:07:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2020-06-22 10:07:11,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 10:07:11,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:07:11,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 13 letters. Loop has 8 letters. [2020-06-22 10:07:11,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:07:11,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 5 letters. Loop has 16 letters. [2020-06-22 10:07:11,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:07:11,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2020-06-22 10:07:11,864 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:07:11,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2020-06-22 10:07:11,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:07:11,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:07:11,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:07:11,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:07:11,865 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:07:11,865 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:07:11,865 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:07:11,865 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:07:11,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:07:11,866 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:07:11,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:07:11,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:07:11 BasicIcfg [2020-06-22 10:07:11,872 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:07:11,872 INFO L168 Benchmark]: Toolchain (without parser) took 196325.04 ms. Allocated memory was 649.6 MB in the beginning and 864.6 MB in the end (delta: 215.0 MB). Free memory was 563.6 MB in the beginning and 469.3 MB in the end (delta: 94.3 MB). Peak memory consumption was 309.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:07:11,873 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:07:11,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.57 ms. Allocated memory was 649.6 MB in the beginning and 698.4 MB in the end (delta: 48.8 MB). Free memory was 563.6 MB in the beginning and 662.2 MB in the end (delta: -98.6 MB). Peak memory consumption was 29.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:07:11,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.06 ms. Allocated memory is still 698.4 MB. Free memory was 662.2 MB in the beginning and 660.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:07:11,874 INFO L168 Benchmark]: Boogie Preprocessor took 22.65 ms. Allocated memory is still 698.4 MB. Free memory was 660.1 MB in the beginning and 659.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:07:11,874 INFO L168 Benchmark]: RCFGBuilder took 341.99 ms. Allocated memory is still 698.4 MB. Free memory was 659.0 MB in the beginning and 635.8 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:07:11,875 INFO L168 Benchmark]: BlockEncodingV2 took 139.48 ms. Allocated memory is still 698.4 MB. Free memory was 635.8 MB in the beginning and 625.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:07:11,876 INFO L168 Benchmark]: TraceAbstraction took 1454.41 ms. Allocated memory is still 698.4 MB. Free memory was 623.9 MB in the beginning and 471.8 MB in the end (delta: 152.2 MB). Peak memory consumption was 152.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:07:11,876 INFO L168 Benchmark]: BuchiAutomizer took 194018.73 ms. Allocated memory was 698.4 MB in the beginning and 864.6 MB in the end (delta: 166.2 MB). Free memory was 471.8 MB in the beginning and 469.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 168.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:07:11,879 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 46 locations, 47 edges - StatisticsResult: Encoded RCFG 35 locations, 64 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 304.57 ms. Allocated memory was 649.6 MB in the beginning and 698.4 MB in the end (delta: 48.8 MB). Free memory was 563.6 MB in the beginning and 662.2 MB in the end (delta: -98.6 MB). Peak memory consumption was 29.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.06 ms. Allocated memory is still 698.4 MB. Free memory was 662.2 MB in the beginning and 660.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.65 ms. Allocated memory is still 698.4 MB. Free memory was 660.1 MB in the beginning and 659.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 341.99 ms. Allocated memory is still 698.4 MB. Free memory was 659.0 MB in the beginning and 635.8 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 139.48 ms. Allocated memory is still 698.4 MB. Free memory was 635.8 MB in the beginning and 625.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1454.41 ms. Allocated memory is still 698.4 MB. Free memory was 623.9 MB in the beginning and 471.8 MB in the end (delta: 152.2 MB). Peak memory consumption was 152.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 194018.73 ms. Allocated memory was 698.4 MB in the beginning and 864.6 MB in the end (delta: 166.2 MB). Free memory was 471.8 MB in the beginning and 469.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 168.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2020-06-22 10:07:11,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:07:11,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:07:11,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:07:11,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:07:11,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:07:11,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((z == 0 && \valid[y] == 1) && unknown-#length-unknown[z] == 4) && unknown-#length-unknown[y] == 4) && \valid[x] == 1) && x == 0) && \valid[z] == 1) && 4 == unknown-#length-unknown[x]) && y == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 22 error locations. SAFE Result, 1.3s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 215 SDslu, 5 SDs, 0 SdLazy, 276 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has 3-nested ranking function (if 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + 2 * unknown-#memory_int-unknown[y][y] > 0 then 2 else (if 3 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[y][y] > 0 then 1 else 0)), (if 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + 2 * unknown-#memory_int-unknown[y][y] > 0 then 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + 2 * unknown-#memory_int-unknown[y][y] else (if 3 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[y][y] > 0 then 3 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[y][y] else unknown-#memory_int-unknown[x][x])) and consists of 12 locations. One nondeterministic module has 3-nested ranking function (if 2 * unknown-#memory_int-unknown[y][y] + 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] > 0 then 2 else (if unknown-#memory_int-unknown[y][y] + 3 * unknown-#memory_int-unknown[x][x] > 0 then 1 else 0)), (if 2 * unknown-#memory_int-unknown[y][y] + 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] > 0 then 2 * unknown-#memory_int-unknown[y][y] + 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] else (if unknown-#memory_int-unknown[y][y] + 3 * unknown-#memory_int-unknown[x][x] > 0 then unknown-#memory_int-unknown[y][y] + 3 * unknown-#memory_int-unknown[x][x] else unknown-#memory_int-unknown[x][x])) and consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 193.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 85.9s. Büchi inclusion checks took 103.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [1, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 18 SDtfs, 2001 SDslu, 111 SDs, 0 SdLazy, 4953 SolverSat, 166 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 85.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital452 mio100 ax100 hnf100 lsp98 ukn38 mio100 lsp41 div100 bol100 ite100 ukn100 eq188 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 4 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:03:52.312 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:07:12.139 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check