./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/twisted-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/twisted-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1a7013a4cfa859e3e95189f90d363983a25fcd0e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:54:05,273 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:54:05,275 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:54:05,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:54:05,287 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:54:05,288 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:54:05,289 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:54:05,291 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:54:05,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:54:05,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:54:05,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:54:05,295 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:54:05,296 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:54:05,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:54:05,298 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:54:05,299 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:54:05,300 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:54:05,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:54:05,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:54:05,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:54:05,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:54:05,309 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:54:05,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:54:05,315 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:54:05,316 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:54:05,317 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:54:05,321 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:54:05,322 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:54:05,326 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:54:05,327 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:54:05,327 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:54:05,328 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:54:05,328 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:54:05,328 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:54:05,333 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:54:05,333 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:54:05,337 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:54:05,367 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:54:05,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:54:05,372 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:54:05,372 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:54:05,373 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:54:05,373 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:54:05,373 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:54:05,373 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:54:05,373 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:54:05,373 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:54:05,374 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:54:05,374 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:54:05,374 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:54:05,374 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:54:05,374 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:54:05,376 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:54:05,376 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:54:05,376 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:54:05,376 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:54:05,378 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:54:05,378 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:54:05,378 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:54:05,378 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:54:05,378 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:54:05,379 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:54:05,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:54:05,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:54:05,379 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:54:05,381 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:54:05,381 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a7013a4cfa859e3e95189f90d363983a25fcd0e [2019-01-01 21:54:05,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:54:05,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:54:05,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:54:05,462 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:54:05,463 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:54:05,464 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/twisted-alloca_true-termination.c.i [2019-01-01 21:54:05,522 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049a85825/67bf1372edbc44e2b461e001e533d3df/FLAG919c92664 [2019-01-01 21:54:06,008 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:54:06,009 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/twisted-alloca_true-termination.c.i [2019-01-01 21:54:06,028 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049a85825/67bf1372edbc44e2b461e001e533d3df/FLAG919c92664 [2019-01-01 21:54:06,311 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049a85825/67bf1372edbc44e2b461e001e533d3df [2019-01-01 21:54:06,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:54:06,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:54:06,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:54:06,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:54:06,327 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:54:06,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:54:06" (1/1) ... [2019-01-01 21:54:06,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b7ece5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:06, skipping insertion in model container [2019-01-01 21:54:06,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:54:06" (1/1) ... [2019-01-01 21:54:06,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:54:06,405 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:54:06,733 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:54:06,751 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:54:06,901 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:54:06,967 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:54:06,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:06 WrapperNode [2019-01-01 21:54:06,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:54:06,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:54:06,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:54:06,969 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:54:06,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:06" (1/1) ... [2019-01-01 21:54:06,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:06" (1/1) ... [2019-01-01 21:54:07,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:54:07,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:54:07,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:54:07,020 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:54:07,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:06" (1/1) ... [2019-01-01 21:54:07,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:06" (1/1) ... [2019-01-01 21:54:07,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:06" (1/1) ... [2019-01-01 21:54:07,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:06" (1/1) ... [2019-01-01 21:54:07,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:06" (1/1) ... [2019-01-01 21:54:07,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:06" (1/1) ... [2019-01-01 21:54:07,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:06" (1/1) ... [2019-01-01 21:54:07,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:54:07,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:54:07,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:54:07,051 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:54:07,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:54:07,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:54:07,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:54:07,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:54:07,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:54:07,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:54:07,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:54:07,548 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:54:07,549 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:54:07,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:07 BoogieIcfgContainer [2019-01-01 21:54:07,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:54:07,550 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:54:07,550 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:54:07,556 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:54:07,557 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:07,557 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:54:06" (1/3) ... [2019-01-01 21:54:07,558 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e2f4e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:54:07, skipping insertion in model container [2019-01-01 21:54:07,558 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:07,558 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:06" (2/3) ... [2019-01-01 21:54:07,559 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e2f4e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:54:07, skipping insertion in model container [2019-01-01 21:54:07,559 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:07,559 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:07" (3/3) ... [2019-01-01 21:54:07,561 INFO L375 chiAutomizerObserver]: Analyzing ICFG twisted-alloca_true-termination.c.i [2019-01-01 21:54:07,626 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:54:07,627 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:54:07,627 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:54:07,627 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:54:07,627 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:54:07,628 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:54:07,628 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:54:07,628 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:54:07,628 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:54:07,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 21:54:07,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:54:07,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:07,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:07,670 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:54:07,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:54:07,670 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:54:07,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 21:54:07,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:54:07,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:07,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:07,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:54:07,673 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:54:07,681 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 3#L569true [2019-01-01 21:54:07,682 INFO L796 eck$LassoCheckResult]: Loop: 3#L569true assume !true; 8#L564true goto; 4#L567true call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 11#L564-1true assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 6#L566true assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 3#L569true [2019-01-01 21:54:07,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:07,689 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:54:07,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:07,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:07,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:07,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:07,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:07,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:07,913 INFO L82 PathProgramCache]: Analyzing trace with hash 46885240, now seen corresponding path program 1 times [2019-01-01 21:54:07,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:07,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:07,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:07,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:07,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:07,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:54:07,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 21:54:07,949 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:54:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:54:07,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:54:07,965 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-01-01 21:54:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:54:07,972 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-01-01 21:54:07,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:54:07,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-01-01 21:54:07,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:54:07,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2019-01-01 21:54:07,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:54:07,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:54:07,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-01 21:54:07,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:54:07,983 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:54:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-01 21:54:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-01 21:54:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:54:08,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 21:54:08,014 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:54:08,014 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:54:08,014 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:54:08,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-01 21:54:08,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:54:08,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:08,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:08,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:54:08,016 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:54:08,016 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 39#L569 [2019-01-01 21:54:08,017 INFO L796 eck$LassoCheckResult]: Loop: 39#L569 goto; 42#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 46#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; 40#L564 goto; 41#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 44#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 45#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 39#L569 [2019-01-01 21:54:08,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:08,017 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-01 21:54:08,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:08,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:08,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:08,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:08,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:08,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:08,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1311753714, now seen corresponding path program 1 times [2019-01-01 21:54:08,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:08,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:08,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:54:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:08,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:08,158 INFO L82 PathProgramCache]: Analyzing trace with hash 234543116, now seen corresponding path program 1 times [2019-01-01 21:54:08,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:08,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:08,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:08,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:08,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:08,541 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-01 21:54:09,154 WARN L181 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-01-01 21:54:10,370 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2019-01-01 21:54:10,680 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-01 21:54:10,693 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:54:10,694 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:54:10,694 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:54:10,694 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:54:10,695 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:54:10,695 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:54:10,695 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:54:10,695 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:54:10,695 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:54:10,696 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:54:10,696 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:54:10,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:10,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:11,812 WARN L181 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2019-01-01 21:54:12,017 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-01-01 21:54:12,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:12,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:12,313 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-01 21:54:12,887 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 21:54:14,166 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 21:54:14,351 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 21:54:14,377 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:54:14,383 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:54:14,385 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 [2019-01-01 21:54:14,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:14,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:14,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:14,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,394 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 [2019-01-01 21:54:14,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:14,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:14,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:14,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,404 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 [2019-01-01 21:54:14,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:14,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:14,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:14,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,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 [2019-01-01 21:54:14,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:14,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:14,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,431 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 [2019-01-01 21:54:14,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:14,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:14,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,444 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 [2019-01-01 21:54:14,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:14,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:14,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,464 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 [2019-01-01 21:54:14,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:14,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:14,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:14,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,470 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 [2019-01-01 21:54:14,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:14,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:14,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,483 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 [2019-01-01 21:54:14,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:14,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:14,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:14,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,486 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 [2019-01-01 21:54:14,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:14,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:14,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:14,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,492 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 [2019-01-01 21:54:14,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:14,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:14,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:14,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,497 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 [2019-01-01 21:54:14,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:14,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:14,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:14,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,502 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 [2019-01-01 21:54:14,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:14,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:14,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:14,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,506 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 [2019-01-01 21:54:14,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:14,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:14,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,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 [2019-01-01 21:54:14,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:14,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:14,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:14,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,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 [2019-01-01 21:54:14,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:14,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:14,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:14,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,524 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 [2019-01-01 21:54:14,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:14,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:14,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:14,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,529 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 [2019-01-01 21:54:14,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:14,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:14,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,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 [2019-01-01 21:54:14,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:14,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:14,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,553 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 [2019-01-01 21:54:14,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:14,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:14,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,558 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 [2019-01-01 21:54:14,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:14,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:14,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,563 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 [2019-01-01 21:54:14,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:14,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:14,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,611 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 [2019-01-01 21:54:14,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:14,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:14,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:14,621 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 [2019-01-01 21:54:14,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:14,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:14,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:14,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:14,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:14,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:14,637 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:54:14,647 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:54:14,648 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:54:14,650 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:54:14,652 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:54:14,653 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:54:14,653 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1 + 1 Supporting invariants [] [2019-01-01 21:54:15,053 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-01-01 21:54:15,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:54:15,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:15,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:15,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:15,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:15,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 21:54:15,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:15,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2019-01-01 21:54:15,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:15,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:15,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:15,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2019-01-01 21:54:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:15,281 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:54:15,282 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-01-01 21:54:15,340 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 20 states and 27 transitions. Complement of second has 6 states. [2019-01-01 21:54:15,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:54:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:54:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-01 21:54:15,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 7 letters. [2019-01-01 21:54:15,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:15,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 7 letters. [2019-01-01 21:54:15,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:15,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 14 letters. [2019-01-01 21:54:15,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:15,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2019-01-01 21:54:15,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:15,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 21 transitions. [2019-01-01 21:54:15,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:54:15,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:54:15,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-01-01 21:54:15,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:54:15,351 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-01 21:54:15,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-01-01 21:54:15,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-01 21:54:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:54:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-01-01 21:54:15,353 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-01 21:54:15,354 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-01 21:54:15,354 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:54:15,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-01-01 21:54:15,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:15,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:15,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:15,355 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:54:15,355 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:54:15,356 INFO L794 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 267#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 268#L569 goto; 272#L560 [2019-01-01 21:54:15,356 INFO L796 eck$LassoCheckResult]: Loop: 272#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 278#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 279#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 272#L560 [2019-01-01 21:54:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:15,356 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2019-01-01 21:54:15,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:15,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:15,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:15,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:15,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:15,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:15,389 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-01-01 21:54:15,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:15,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:15,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:15,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:15,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:15,416 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2019-01-01 21:54:15,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:15,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:15,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:15,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:15,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:15,783 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 21:54:15,974 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-01-01 21:54:16,520 WARN L181 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2019-01-01 21:54:16,811 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-01-01 21:54:16,814 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:54:16,814 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:54:16,814 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:54:16,815 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:54:16,815 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:54:16,815 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:54:16,815 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:54:16,815 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:54:16,815 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:54:16,815 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:54:16,815 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:54:16,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:16,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:16,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:16,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:16,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:18,417 WARN L181 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2019-01-01 21:54:19,613 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-01-01 21:54:19,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:19,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:19,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:19,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:19,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:19,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:19,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:19,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:19,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:19,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:19,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:19,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:19,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:20,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:20,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:20,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:20,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:21,848 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 21:54:22,106 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:54:22,106 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:54:22,106 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 [2019-01-01 21:54:22,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:22,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:22,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:22,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,113 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 [2019-01-01 21:54:22,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:22,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:22,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:22,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,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 [2019-01-01 21:54:22,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:22,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:22,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:22,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,123 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 [2019-01-01 21:54:22,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:22,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:22,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,131 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 [2019-01-01 21:54:22,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:22,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:22,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,140 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 [2019-01-01 21:54:22,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:22,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:22,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,148 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 [2019-01-01 21:54:22,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,149 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2019-01-01 21:54:22,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,161 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-01-01 21:54:22,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:22,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,225 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 [2019-01-01 21:54:22,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:22,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:22,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,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 [2019-01-01 21:54:22,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:22,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:22,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,244 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 [2019-01-01 21:54:22,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:22,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:22,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,253 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 [2019-01-01 21:54:22,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:22,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:22,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,264 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 [2019-01-01 21:54:22,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:22,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:22,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,271 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 [2019-01-01 21:54:22,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:22,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:22,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,283 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 [2019-01-01 21:54:22,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:22,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:22,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,304 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 [2019-01-01 21:54:22,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:22,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:22,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:22,312 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 [2019-01-01 21:54:22,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:22,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:22,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:22,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:22,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:22,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:22,337 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:54:22,358 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:54:22,359 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:54:22,360 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:54:22,362 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:54:22,363 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:54:22,364 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2 Supporting invariants [] [2019-01-01 21:54:22,922 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2019-01-01 21:54:22,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:54:22,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:54:22,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:22,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:22,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:23,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:23,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2019-01-01 21:54:23,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:23,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2019-01-01 21:54:23,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:23,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:23,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:23,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:23,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2019-01-01 21:54:23,343 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:23,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:23,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:23,388 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2019-01-01 21:54:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:23,421 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:54:23,421 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-01 21:54:23,458 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 34 states and 43 transitions. Complement of second has 7 states. [2019-01-01 21:54:23,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:54:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:54:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:54:23,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 21:54:23,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:23,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:54:23,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:23,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 21:54:23,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:23,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2019-01-01 21:54:23,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:23,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2019-01-01 21:54:23,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:54:23,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:54:23,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2019-01-01 21:54:23,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:54:23,468 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-01-01 21:54:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2019-01-01 21:54:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-01 21:54:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 21:54:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-01-01 21:54:23,472 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-01-01 21:54:23,472 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-01-01 21:54:23,472 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:54:23,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-01-01 21:54:23,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:23,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:23,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:23,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:54:23,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:54:23,476 INFO L794 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 505#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 506#L569 goto; 507#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 515#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; 503#L564 goto; 504#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 510#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 511#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 516#L569 goto; 517#L560 [2019-01-01 21:54:23,476 INFO L796 eck$LassoCheckResult]: Loop: 517#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 513#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 514#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 517#L560 [2019-01-01 21:54:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:23,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1319097990, now seen corresponding path program 2 times [2019-01-01 21:54:23,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:23,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:23,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:23,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2019-01-01 21:54:23,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:23,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:23,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:23,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:54:23,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:23,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:23,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1702545424, now seen corresponding path program 1 times [2019-01-01 21:54:23,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:23,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:23,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:54:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:23,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:54:23,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:54:23,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:23,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:23,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 14 treesize of output 17 [2019-01-01 21:54:23,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 19 [2019-01-01 21:54:23,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:23,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:23,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:23,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2019-01-01 21:54:23,892 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:23,910 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:23,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:23,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 68 [2019-01-01 21:54:23,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:54:23,984 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:24,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 58 [2019-01-01 21:54:24,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2019-01-01 21:54:24,071 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:24,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 49 [2019-01-01 21:54:24,247 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:24,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 68 [2019-01-01 21:54:24,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 48 [2019-01-01 21:54:24,599 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:25,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2019-01-01 21:54:25,666 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:27,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2019-01-01 21:54:27,018 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:27,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 44 treesize of output 73 [2019-01-01 21:54:27,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 66 [2019-01-01 21:54:27,814 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:28,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2019-01-01 21:54:28,032 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:28,099 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:54:28,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 72 [2019-01-01 21:54:28,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2019-01-01 21:54:28,791 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:28,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2019-01-01 21:54:28,905 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:29,053 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:29,415 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:54:29,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 74 [2019-01-01 21:54:29,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2019-01-01 21:54:29,464 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:29,545 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:29,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 56 [2019-01-01 21:54:29,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2019-01-01 21:54:29,861 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:29,935 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:30,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 71 [2019-01-01 21:54:30,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2019-01-01 21:54:30,382 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:30,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 43 [2019-01-01 21:54:30,501 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:30,542 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:30,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-01-01 21:54:30,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2019-01-01 21:54:30,874 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:30,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2019-01-01 21:54:30,986 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:31,024 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:31,186 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-01-01 21:54:31,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 65 [2019-01-01 21:54:31,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 47 [2019-01-01 21:54:31,520 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:32,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2019-01-01 21:54:32,620 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:33,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 47 [2019-01-01 21:54:33,737 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 3 xjuncts. [2019-01-01 21:54:34,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2019-01-01 21:54:34,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:54:34,947 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:34,960 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:35,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 21:54:35,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:54:35,034 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:35,048 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:35,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 52 [2019-01-01 21:54:35,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2019-01-01 21:54:35,968 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:36,027 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:54:36,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2019-01-01 21:54:36,031 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:36,079 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:36,113 INFO L478 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 50 [2019-01-01 21:54:36,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 47 [2019-01-01 21:54:36,211 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 3 xjuncts. [2019-01-01 21:54:36,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2019-01-01 21:54:36,316 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:36,370 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:54:37,024 INFO L478 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 55 [2019-01-01 21:54:37,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2019-01-01 21:54:37,030 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:37,060 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:37,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-01-01 21:54:37,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2019-01-01 21:54:37,482 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:37,511 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:38,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 67 [2019-01-01 21:54:38,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2019-01-01 21:54:38,142 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:38,235 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:38,855 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, 9 dim-2 vars, End of recursive call: and 9 xjuncts. [2019-01-01 21:54:39,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 48 [2019-01-01 21:54:39,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-01 21:54:39,101 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:39,180 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:54:39,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2019-01-01 21:54:39,184 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:39,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 52 [2019-01-01 21:54:39,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2019-01-01 21:54:39,337 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:39,428 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:39,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-01 21:54:39,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:54:39,486 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:39,498 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:39,558 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:39,667 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 7 xjuncts. [2019-01-01 21:54:39,760 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2019-01-01 21:54:39,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:54:39,874 INFO L202 ElimStorePlain]: Needed 56 recursive calls to eliminate 8 variables, input treesize:147, output treesize:88 [2019-01-01 21:54:40,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:40,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:40,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:40,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 87 [2019-01-01 21:54:40,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:40,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 61 [2019-01-01 21:54:40,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:40,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:40,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-01 21:54:40,176 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:40,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:40,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 21:54:40,305 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:58 [2019-01-01 21:54:40,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:40,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:40,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2019-01-01 21:54:40,439 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2019-01-01 21:54:40,441 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 21:54:40,462 INFO L478 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 11 treesize of output 7 [2019-01-01 21:54:40,463 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:40,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:40,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:40,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:40,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:40,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:40,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 52 [2019-01-01 21:54:40,549 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2019-01-01 21:54:40,552 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 21:54:40,598 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2019-01-01 21:54:40,599 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:40,632 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:40,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:40,688 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:70, output treesize:15 [2019-01-01 21:54:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:40,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:54:40,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-01-01 21:54:40,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 21:54:40,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-01-01 21:54:40,867 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 13 states. [2019-01-01 21:54:41,098 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-01-01 21:54:41,322 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-01-01 21:54:41,958 WARN L181 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-01-01 21:54:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:54:42,026 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-01-01 21:54:42,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 21:54:42,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2019-01-01 21:54:42,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:42,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 20 states and 24 transitions. [2019-01-01 21:54:42,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:54:42,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:54:42,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2019-01-01 21:54:42,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:54:42,034 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-01-01 21:54:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2019-01-01 21:54:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-01-01 21:54:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:54:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-01-01 21:54:42,038 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 21:54:42,038 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 21:54:42,038 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:54:42,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-01-01 21:54:42,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:42,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:42,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:42,043 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:54:42,043 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:54:42,043 INFO L794 eck$LassoCheckResult]: Stem: 646#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 640#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 641#L569 goto; 644#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 651#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 652#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 642#L564 goto; 643#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 647#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 648#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 653#L569 goto; 654#L560 [2019-01-01 21:54:42,043 INFO L796 eck$LassoCheckResult]: Loop: 654#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 649#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 650#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 654#L560 [2019-01-01 21:54:42,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:42,044 INFO L82 PathProgramCache]: Analyzing trace with hash -635175977, now seen corresponding path program 1 times [2019-01-01 21:54:42,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:42,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:42,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:42,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:42,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:42,547 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-01-01 21:54:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:42,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:54:42,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 21:54:42,571 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:54:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2019-01-01 21:54:42,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:42,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:42,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:42,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:42,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:42,879 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 21:54:42,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:54:42,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:54:42,976 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-01-01 21:54:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:54:43,043 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-01-01 21:54:43,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:54:43,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2019-01-01 21:54:43,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:43,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 23 transitions. [2019-01-01 21:54:43,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:54:43,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:54:43,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-01-01 21:54:43,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:54:43,049 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-01 21:54:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-01-01 21:54:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-01-01 21:54:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:54:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-01-01 21:54:43,054 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-01 21:54:43,054 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-01 21:54:43,054 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:54:43,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-01-01 21:54:43,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:43,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:43,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:43,057 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:54:43,057 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:54:43,057 INFO L794 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 692#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 693#L569 goto; 694#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 702#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 703#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 696#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 706#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 707#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 690#L564 goto; 691#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 697#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 698#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 704#L569 goto; 705#L560 [2019-01-01 21:54:43,057 INFO L796 eck$LassoCheckResult]: Loop: 705#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 700#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 701#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 705#L560 [2019-01-01 21:54:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:43,058 INFO L82 PathProgramCache]: Analyzing trace with hash 184869755, now seen corresponding path program 1 times [2019-01-01 21:54:43,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:43,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:43,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:43,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:54:43,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:43,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:43,110 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2019-01-01 21:54:43,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:43,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:43,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:43,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:43,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:43,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1306804847, now seen corresponding path program 2 times [2019-01-01 21:54:43,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:43,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:43,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:43,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:54:43,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:43,522 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 21:54:44,407 WARN L181 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-01-01 21:54:46,734 WARN L181 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 198 DAG size of output: 154 [2019-01-01 21:54:47,298 WARN L181 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-01 21:54:47,303 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:54:47,304 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:54:47,304 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:54:47,304 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:54:47,304 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:54:47,304 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:54:47,305 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:54:47,305 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:54:47,305 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration6_Lasso [2019-01-01 21:54:47,305 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:54:47,305 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:54:47,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:47,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:47,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,070 WARN L181 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2019-01-01 21:54:48,232 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-01-01 21:54:48,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:48,808 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-01 21:54:50,176 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 21:54:50,410 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:54:50,411 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:54:50,411 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 [2019-01-01 21:54:50,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:50,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:50,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:50,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:50,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:50,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:50,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:50,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:50,420 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 [2019-01-01 21:54:50,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:50,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:50,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:50,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:50,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:50,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:50,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:50,434 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 [2019-01-01 21:54:50,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:50,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:50,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:50,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:50,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:50,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:50,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:50,444 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 [2019-01-01 21:54:50,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:50,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:50,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:50,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:50,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:50,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:50,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:50,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 [2019-01-01 21:54:50,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:50,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:50,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:50,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:50,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:50,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:50,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:50,467 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 [2019-01-01 21:54:50,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:50,471 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2019-01-01 21:54:50,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:50,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:50,480 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-01-01 21:54:50,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:50,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:50,522 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 [2019-01-01 21:54:50,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:50,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:50,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:50,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:50,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:50,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:50,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:50,532 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 [2019-01-01 21:54:50,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:50,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:50,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:50,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:50,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:50,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:50,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:50,540 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 [2019-01-01 21:54:50,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:50,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:50,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:50,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:50,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:50,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:50,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:50,554 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 [2019-01-01 21:54:50,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:50,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:50,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:50,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:50,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:50,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:50,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:50,567 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 [2019-01-01 21:54:50,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:50,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:50,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:50,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:50,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:50,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:50,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:50,575 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 [2019-01-01 21:54:50,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:50,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:50,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:50,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:50,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:50,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:50,594 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:54:50,602 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:54:50,603 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:54:50,604 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:54:50,604 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:54:50,606 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:54:50,606 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3 Supporting invariants [] [2019-01-01 21:54:51,128 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-01-01 21:54:51,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:54:51,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:54:51,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:51,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:51,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:51,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:51,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2019-01-01 21:54:51,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:51,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2019-01-01 21:54:51,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:51,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:51,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:51,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:51,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2019-01-01 21:54:51,282 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:51,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:51,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:51,324 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2019-01-01 21:54:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:51,351 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:54:51,351 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 21:54:51,394 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2019-01-01 21:54:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:54:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:54:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-01 21:54:51,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 21:54:51,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:51,399 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:54:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:51,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:51,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:51,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:51,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2019-01-01 21:54:51,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:51,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2019-01-01 21:54:51,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:51,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:51,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:51,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:54:51,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2019-01-01 21:54:51,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:51,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:51,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:51,633 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2019-01-01 21:54:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:51,666 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:54:51,666 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 21:54:51,725 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 51 states and 59 transitions. Complement of second has 9 states. [2019-01-01 21:54:51,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:54:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:54:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-01-01 21:54:51,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 21:54:51,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:51,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-01 21:54:51,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:51,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-01 21:54:51,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:51,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2019-01-01 21:54:51,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:51,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 37 states and 43 transitions. [2019-01-01 21:54:51,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:54:51,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:54:51,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2019-01-01 21:54:51,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:54:51,732 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-01-01 21:54:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2019-01-01 21:54:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-01-01 21:54:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 21:54:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-01-01 21:54:51,735 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-01-01 21:54:51,736 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-01-01 21:54:51,736 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:54:51,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2019-01-01 21:54:51,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:51,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:51,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:51,738 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:54:51,738 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:54:51,738 INFO L794 eck$LassoCheckResult]: Stem: 1096#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1091#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 1092#L569 goto; 1093#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1123#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1106#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1107#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1101#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1102#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 1089#L564 goto; 1090#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1097#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1098#L566 assume 0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2);havoc f_#t~mem14; 1110#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1112#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1109#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 1108#L569 goto; 1104#L560 [2019-01-01 21:54:51,738 INFO L796 eck$LassoCheckResult]: Loop: 1104#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1099#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1100#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1104#L560 [2019-01-01 21:54:51,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:51,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1305515858, now seen corresponding path program 1 times [2019-01-01 21:54:51,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:51,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:51,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:51,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:54:51,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 21:54:51,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:54:51,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:54:51,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:51,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:51,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 68 [2019-01-01 21:54:51,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:54:51,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:52,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 58 [2019-01-01 21:54:52,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2019-01-01 21:54:52,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:52,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 49 [2019-01-01 21:54:52,126 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:52,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2019-01-01 21:54:52,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2019-01-01 21:54:52,270 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:52,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 55 [2019-01-01 21:54:52,364 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2019-01-01 21:54:52,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 46 [2019-01-01 21:54:52,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2019-01-01 21:54:52,536 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:52,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-01-01 21:54:52,583 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:52,608 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:52,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2019-01-01 21:54:52,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 45 [2019-01-01 21:54:52,675 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:52,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-01 21:54:52,777 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:52,806 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:52,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2019-01-01 21:54:52,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2019-01-01 21:54:52,842 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:52,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-01 21:54:52,900 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:52,935 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:52,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2019-01-01 21:54:52,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-01-01 21:54:52,970 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:53,110 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:53,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 62 [2019-01-01 21:54:53,439 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-01 21:54:53,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 45 [2019-01-01 21:54:53,461 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:53,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-01 21:54:53,559 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:53,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 80 [2019-01-01 21:54:53,647 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 8 xjuncts. [2019-01-01 21:54:53,814 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-01 21:54:54,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 61 [2019-01-01 21:54:54,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 45 [2019-01-01 21:54:54,123 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:54,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2019-01-01 21:54:54,227 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:54,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 55 [2019-01-01 21:54:54,327 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 8 xjuncts. [2019-01-01 21:54:54,421 INFO L267 ElimStorePlain]: Start of recursive call 25: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 21:54:54,585 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 7 xjuncts. [2019-01-01 21:54:54,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 48 [2019-01-01 21:54:54,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-01 21:54:54,620 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:54,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 39 [2019-01-01 21:54:54,694 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:54,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 60 [2019-01-01 21:54:54,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 53 [2019-01-01 21:54:54,861 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:55,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-01 21:54:55,037 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:55,091 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:54:55,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 32 treesize of output 59 [2019-01-01 21:54:55,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-01 21:54:55,239 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:55,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 39 [2019-01-01 21:54:55,326 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2019-01-01 21:54:55,424 INFO L267 ElimStorePlain]: Start of recursive call 35: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:54:55,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 43 [2019-01-01 21:54:55,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2019-01-01 21:54:55,564 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:55,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-01 21:54:55,625 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:55,649 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:55,695 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:54:56,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 65 [2019-01-01 21:54:56,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2019-01-01 21:54:56,053 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:57,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 55 [2019-01-01 21:54:57,108 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 4 xjuncts. [2019-01-01 21:54:58,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 55 [2019-01-01 21:54:58,546 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 8 xjuncts. [2019-01-01 21:55:00,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 64 [2019-01-01 21:55:00,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 55 [2019-01-01 21:55:00,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 50 [2019-01-01 21:55:00,506 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2019-01-01 21:55:00,622 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:55:00,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2019-01-01 21:55:00,627 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:00,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 62 [2019-01-01 21:55:00,808 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 8 xjuncts. [2019-01-01 21:55:00,953 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:55:00,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50 [2019-01-01 21:55:00,971 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 3 xjuncts. [2019-01-01 21:55:01,082 INFO L267 ElimStorePlain]: Start of recursive call 46: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-01 21:55:01,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-01 21:55:01,293 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:01,534 INFO L267 ElimStorePlain]: Start of recursive call 45: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-01 21:55:03,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 66 [2019-01-01 21:55:03,675 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 21:55:03,676 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:03,788 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:55:03,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2019-01-01 21:55:03,799 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:03,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-01 21:55:03,973 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:04,036 INFO L267 ElimStorePlain]: Start of recursive call 52: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:04,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 68 [2019-01-01 21:55:04,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2019-01-01 21:55:04,137 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:04,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-01-01 21:55:04,290 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:04,355 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:55:04,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50 [2019-01-01 21:55:04,372 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 3 xjuncts. [2019-01-01 21:55:04,494 INFO L267 ElimStorePlain]: Start of recursive call 56: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:55:04,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 70 [2019-01-01 21:55:04,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2019-01-01 21:55:04,557 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:04,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 62 [2019-01-01 21:55:04,820 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 8 xjuncts. [2019-01-01 21:55:04,988 INFO L267 ElimStorePlain]: Start of recursive call 60: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:05,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 68 [2019-01-01 21:55:05,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2019-01-01 21:55:05,052 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:05,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 46 [2019-01-01 21:55:05,250 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2019-01-01 21:55:05,381 INFO L267 ElimStorePlain]: Start of recursive call 63: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:06,979 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:55:07,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 46 treesize of output 80 [2019-01-01 21:55:07,032 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:55:07,748 WARN L181 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 91 [2019-01-01 21:55:07,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 45 [2019-01-01 21:55:07,797 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:55:07,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 75 [2019-01-01 21:55:07,832 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 4 xjuncts. [2019-01-01 21:55:07,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 80 [2019-01-01 21:55:07,999 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 8 xjuncts. [2019-01-01 21:55:08,121 INFO L267 ElimStorePlain]: Start of recursive call 67: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 21:55:08,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-01-01 21:55:08,341 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:08,789 INFO L267 ElimStorePlain]: Start of recursive call 66: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2019-01-01 21:55:10,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 46 [2019-01-01 21:55:10,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2019-01-01 21:55:10,052 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:10,102 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:10,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2019-01-01 21:55:10,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-01-01 21:55:10,134 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:10,209 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:10,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2019-01-01 21:55:10,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2019-01-01 21:55:10,251 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:10,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-01 21:55:10,315 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:10,343 INFO L267 ElimStorePlain]: Start of recursive call 75: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 39 treesize of output 77 [2019-01-01 21:55:11,131 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:55:11,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 69 [2019-01-01 21:55:11,179 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 4 xjuncts. [2019-01-01 21:55:11,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 80 [2019-01-01 21:55:11,748 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 8 xjuncts. [2019-01-01 21:55:12,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-01 21:55:12,900 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:13,332 INFO L267 ElimStorePlain]: Start of recursive call 78: 7 dim-1 vars, End of recursive call: and 10 xjuncts. [2019-01-01 21:55:14,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 76 [2019-01-01 21:55:14,136 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:55:15,488 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 163 DAG size of output: 121 [2019-01-01 21:55:15,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2019-01-01 21:55:15,492 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:15,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 55 [2019-01-01 21:55:15,658 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 4 xjuncts. [2019-01-01 21:55:16,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 36 [2019-01-01 21:55:16,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 19 treesize of output 38 [2019-01-01 21:55:16,260 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 8 xjuncts. [2019-01-01 21:55:16,325 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 21:55:16,814 INFO L267 ElimStorePlain]: Start of recursive call 82: 8 dim-1 vars, End of recursive call: and 9 xjuncts. [2019-01-01 21:55:18,651 INFO L267 ElimStorePlain]: Start of recursive call 41: 3 dim-1 vars, 9 dim-2 vars, End of recursive call: and 23 xjuncts. [2019-01-01 21:55:19,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 64 [2019-01-01 21:55:19,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-01-01 21:55:19,273 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:20,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2019-01-01 21:55:20,966 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 2 xjuncts. [2019-01-01 21:55:22,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2019-01-01 21:55:22,106 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 2 xjuncts. [2019-01-01 21:55:23,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 55 [2019-01-01 21:55:23,147 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 8 xjuncts. [2019-01-01 21:55:24,800 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:55:24,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 43 treesize of output 79 [2019-01-01 21:55:24,851 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:55:24,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2019-01-01 21:55:24,880 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:25,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 80 [2019-01-01 21:55:25,211 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 8 xjuncts. [2019-01-01 21:55:25,690 INFO L267 ElimStorePlain]: Start of recursive call 92: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2019-01-01 21:55:27,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 40 treesize of output 80 [2019-01-01 21:55:27,466 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:55:27,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2019-01-01 21:55:27,477 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:27,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 62 [2019-01-01 21:55:27,771 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 2 xjuncts. [2019-01-01 21:55:28,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47 [2019-01-01 21:55:28,025 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 2 xjuncts. [2019-01-01 21:55:28,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 80 [2019-01-01 21:55:28,307 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 8 xjuncts. [2019-01-01 21:55:28,525 INFO L267 ElimStorePlain]: Start of recursive call 95: 6 dim-1 vars, End of recursive call: and 8 xjuncts. [2019-01-01 21:55:29,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 76 [2019-01-01 21:55:29,938 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:55:29,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 80 [2019-01-01 21:55:29,998 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 8 xjuncts. [2019-01-01 21:55:30,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47 [2019-01-01 21:55:30,681 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 2 xjuncts. [2019-01-01 21:55:30,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 58 [2019-01-01 21:55:30,924 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 2 xjuncts. [2019-01-01 21:55:31,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2019-01-01 21:55:31,145 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,485 INFO L267 ElimStorePlain]: Start of recursive call 100: 6 dim-1 vars, End of recursive call: and 8 xjuncts. [2019-01-01 21:55:32,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 46 [2019-01-01 21:55:32,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2019-01-01 21:55:32,534 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:32,583 INFO L267 ElimStorePlain]: Start of recursive call 105: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:32,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2019-01-01 21:55:32,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2019-01-01 21:55:32,613 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:32,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-01 21:55:32,665 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:32,694 INFO L267 ElimStorePlain]: Start of recursive call 107: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:32,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2019-01-01 21:55:32,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-01-01 21:55:32,768 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:32,818 INFO L267 ElimStorePlain]: Start of recursive call 110: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:33,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 63 [2019-01-01 21:55:33,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2019-01-01 21:55:33,561 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:33,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 39 [2019-01-01 21:55:33,757 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 2 xjuncts. [2019-01-01 21:55:33,798 INFO L267 ElimStorePlain]: Start of recursive call 112: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:34,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 62 [2019-01-01 21:55:34,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2019-01-01 21:55:34,335 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:34,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 80 [2019-01-01 21:55:34,456 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 8 xjuncts. [2019-01-01 21:55:34,733 INFO L267 ElimStorePlain]: Start of recursive call 115: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-01 21:55:35,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 63 [2019-01-01 21:55:35,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2019-01-01 21:55:35,288 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:35,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 39 [2019-01-01 21:55:35,388 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 2 xjuncts. [2019-01-01 21:55:35,498 INFO L267 ElimStorePlain]: Start of recursive call 118: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:36,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 33 treesize of output 75 [2019-01-01 21:55:36,281 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:55:36,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-01-01 21:55:36,304 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:36,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-01 21:55:36,586 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:36,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2019-01-01 21:55:36,718 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 2 xjuncts. [2019-01-01 21:55:36,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2019-01-01 21:55:36,824 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 2 xjuncts. [2019-01-01 21:55:36,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 55 [2019-01-01 21:55:36,926 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 8 xjuncts. [2019-01-01 21:55:37,364 INFO L267 ElimStorePlain]: Start of recursive call 121: 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-01 21:55:37,637 INFO L267 ElimStorePlain]: Start of recursive call 87: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 13 xjuncts. [2019-01-01 21:55:37,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 11 xjuncts. [2019-01-01 21:55:38,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2019-01-01 21:55:38,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:38,224 INFO L202 ElimStorePlain]: Needed 126 recursive calls to eliminate 7 variables, input treesize:130, output treesize:43 [2019-01-01 21:55:38,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 61 [2019-01-01 21:55:38,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2019-01-01 21:55:38,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:38,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-01 21:55:38,342 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:38,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:38,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:38,375 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:43 [2019-01-01 21:55:38,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 73 [2019-01-01 21:55:38,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,468 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 55 [2019-01-01 21:55:38,471 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 21:55:38,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:38,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2019-01-01 21:55:38,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-01 21:55:38,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:38,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:38,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:38,602 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:57 [2019-01-01 21:55:38,793 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 21:55:38,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:38,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-01-01 21:55:38,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:38,858 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 57 [2019-01-01 21:55:38,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 21:55:38,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:38,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:38,898 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:105, output treesize:32 [2019-01-01 21:55:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:55:38,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:55:38,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-01-01 21:55:38,948 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:55:38,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:55:38,948 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 5 times [2019-01-01 21:55:38,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:55:38,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:55:38,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:55:38,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:55:38,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:55:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:55:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:55:39,187 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 21:55:39,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 21:55:39,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-01 21:55:39,264 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand 12 states. [2019-01-01 21:55:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:55:39,653 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-01-01 21:55:39,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:55:39,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 35 transitions. [2019-01-01 21:55:39,655 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:55:39,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2019-01-01 21:55:39,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:55:39,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:55:39,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:55:39,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:55:39,656 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:55:39,656 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:55:39,656 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:55:39,656 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:55:39,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:55:39,656 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:55:39,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:55:39,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:55:39 BoogieIcfgContainer [2019-01-01 21:55:39,664 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:55:39,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:55:39,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:55:39,664 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:55:39,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:07" (3/4) ... [2019-01-01 21:55:39,669 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:55:39,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:55:39,670 INFO L168 Benchmark]: Toolchain (without parser) took 93353.69 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 457.2 MB). Free memory was 951.4 MB in the beginning and 1.4 GB in the end (delta: -426.5 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:55:39,670 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:55:39,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:55:39,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:55:39,671 INFO L168 Benchmark]: Boogie Preprocessor took 30.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:55:39,672 INFO L168 Benchmark]: RCFGBuilder took 498.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:55:39,672 INFO L168 Benchmark]: BuchiAutomizer took 92113.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 319.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -285.5 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:55:39,673 INFO L168 Benchmark]: Witness Printer took 4.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:55:39,675 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 646.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 498.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 92113.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 319.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -285.5 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[k_ref][k_ref] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[k_ref][k_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 92.0s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 88.8s. Construction of modules took 0.5s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 6. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 72 SDtfs, 67 SDslu, 174 SDs, 0 SdLazy, 272 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital891 mio100 ax103 hnf100 lsp94 ukn42 mio100 lsp34 div100 bol100 ite100 ukn100 eq183 hnf88 smp93 dnf755 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 74ms VariablesStem: 9 VariablesLoop: 6 DisjunctsStem: 16 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 36 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! Received shutdown request...