./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/bin-2019/uautomizer --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 0d5c046770a708e0857845f9429def45b08d1347 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 20:05:15,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 20:05:15,501 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 20:05:15,508 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 20:05:15,508 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 20:05:15,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 20:05:15,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 20:05:15,510 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 20:05:15,511 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 20:05:15,512 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 20:05:15,513 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 20:05:15,513 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 20:05:15,513 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 20:05:15,514 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 20:05:15,514 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 20:05:15,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 20:05:15,515 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 20:05:15,516 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 20:05:15,517 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 20:05:15,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 20:05:15,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 20:05:15,519 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 20:05:15,520 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 20:05:15,520 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 20:05:15,521 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 20:05:15,521 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 20:05:15,522 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 20:05:15,522 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 20:05:15,522 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 20:05:15,523 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 20:05:15,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 20:05:15,523 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 20:05:15,523 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 20:05:15,523 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 20:05:15,524 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 20:05:15,524 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 20:05:15,524 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 20:05:15,535 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 20:05:15,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 20:05:15,536 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 20:05:15,536 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 20:05:15,536 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 20:05:15,536 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 20:05:15,537 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 20:05:15,537 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 20:05:15,537 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 20:05:15,537 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 20:05:15,537 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 20:05:15,537 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 20:05:15,537 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 20:05:15,538 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 20:05:15,538 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 20:05:15,538 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 20:05:15,538 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 20:05:15,538 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 20:05:15,538 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 20:05:15,539 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 20:05:15,539 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 20:05:15,539 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 20:05:15,539 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 20:05:15,539 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 20:05:15,539 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 20:05:15,540 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 20:05:15,540 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 20:05:15,540 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 20:05:15,541 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 20:05:15,541 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/bin-2019/uautomizer 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 -> 0d5c046770a708e0857845f9429def45b08d1347 [2018-12-01 20:05:15,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 20:05:15,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 20:05:15,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 20:05:15,576 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 20:05:15,576 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 20:05:15,576 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-12-01 20:05:15,615 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/bin-2019/uautomizer/data/cc035b073/8af6d6ddef1f4011992ea00a430487b7/FLAGba0a9f79f [2018-12-01 20:05:16,046 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 20:05:16,047 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-12-01 20:05:16,053 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/bin-2019/uautomizer/data/cc035b073/8af6d6ddef1f4011992ea00a430487b7/FLAGba0a9f79f [2018-12-01 20:05:16,062 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/bin-2019/uautomizer/data/cc035b073/8af6d6ddef1f4011992ea00a430487b7 [2018-12-01 20:05:16,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 20:05:16,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 20:05:16,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 20:05:16,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 20:05:16,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 20:05:16,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:05:16" (1/1) ... [2018-12-01 20:05:16,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9d864a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:05:16, skipping insertion in model container [2018-12-01 20:05:16,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:05:16" (1/1) ... [2018-12-01 20:05:16,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 20:05:16,091 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 20:05:16,232 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 20:05:16,239 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 20:05:16,292 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 20:05:16,312 INFO L195 MainTranslator]: Completed translation [2018-12-01 20:05:16,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:05:16 WrapperNode [2018-12-01 20:05:16,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 20:05:16,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 20:05:16,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 20:05:16,313 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 20:05:16,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:05:16" (1/1) ... [2018-12-01 20:05:16,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:05:16" (1/1) ... [2018-12-01 20:05:16,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 20:05:16,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 20:05:16,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 20:05:16,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 20:05:16,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:05:16" (1/1) ... [2018-12-01 20:05:16,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:05:16" (1/1) ... [2018-12-01 20:05:16,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:05:16" (1/1) ... [2018-12-01 20:05:16,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:05:16" (1/1) ... [2018-12-01 20:05:16,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:05:16" (1/1) ... [2018-12-01 20:05:16,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:05:16" (1/1) ... [2018-12-01 20:05:16,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:05:16" (1/1) ... [2018-12-01 20:05:16,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 20:05:16,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 20:05:16,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 20:05:16,350 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 20:05:16,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:05:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49aa4a07-d1a9-4562-8c22-b406b11b4a40/bin-2019/uautomizer/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 [2018-12-01 20:05:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 20:05:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 20:05:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 20:05:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 20:05:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 20:05:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 20:05:16,492 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 20:05:16,493 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-01 20:05:16,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:05:16 BoogieIcfgContainer [2018-12-01 20:05:16,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 20:05:16,493 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 20:05:16,493 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 20:05:16,495 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 20:05:16,496 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 20:05:16,496 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 08:05:16" (1/3) ... [2018-12-01 20:05:16,497 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6274050a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 08:05:16, skipping insertion in model container [2018-12-01 20:05:16,497 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 20:05:16,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:05:16" (2/3) ... [2018-12-01 20:05:16,497 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6274050a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 08:05:16, skipping insertion in model container [2018-12-01 20:05:16,497 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 20:05:16,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:05:16" (3/3) ... [2018-12-01 20:05:16,499 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-12-01 20:05:16,528 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 20:05:16,529 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 20:05:16,529 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 20:05:16,529 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 20:05:16,529 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 20:05:16,529 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 20:05:16,529 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 20:05:16,529 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 20:05:16,529 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 20:05:16,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-01 20:05:16,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 20:05:16,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:05:16,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:05:16,553 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 20:05:16,553 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 20:05:16,554 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 20:05:16,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-01 20:05:16,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 20:05:16,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:05:16,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:05:16,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 20:05:16,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 20:05:16,559 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 11#L552-2true [2018-12-01 20:05:16,560 INFO L796 eck$LassoCheckResult]: Loop: 11#L552-2true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 12#L551-1true assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4#L551-3true main_#t~short9 := main_#t~short7; 7#L551-4true assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 10#L551-6true assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5; 8#L552true assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 11#L552-2true [2018-12-01 20:05:16,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:16,563 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-01 20:05:16,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:16,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:16,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:16,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:05:16,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:16,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2018-12-01 20:05:16,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:16,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:16,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:16,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:05:16,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:16,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2018-12-01 20:05:16,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:16,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:16,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:16,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:05:16,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:16,821 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-12-01 20:05:16,957 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 20:05:16,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 20:05:16,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 20:05:16,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 20:05:16,958 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 20:05:16,958 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:05:16,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 20:05:16,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 20:05:16,959 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-01 20:05:16,959 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 20:05:16,959 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 20:05:16,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:16,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:17,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:17,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:17,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 20:05:17,469 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 20:05:17,471 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 [2018-12-01 20:05:17,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:17,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:17,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:17,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,475 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 [2018-12-01 20:05:17,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:17,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,476 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 20:05:17,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,476 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 20:05:17,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:17,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,479 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 [2018-12-01 20:05:17,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:17,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:17,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:17,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,481 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 [2018-12-01 20:05:17,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:17,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:17,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:05:17,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:17,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:17,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,489 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 [2018-12-01 20:05:17,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:17,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:17,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,493 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 [2018-12-01 20:05:17,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:17,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:17,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:17,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,494 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 [2018-12-01 20:05:17,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:17,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:17,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:17,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,496 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 [2018-12-01 20:05:17,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:17,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:17,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:17,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,498 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 [2018-12-01 20:05:17,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:17,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:17,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:17,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,499 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 [2018-12-01 20:05:17,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:17,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:17,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:17,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,501 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 [2018-12-01 20:05:17,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:17,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:17,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:17,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,503 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 [2018-12-01 20:05:17,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:17,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:17,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,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 [2018-12-01 20:05:17,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:17,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:17,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:17,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,508 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 [2018-12-01 20:05:17,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:17,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:17,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,531 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 [2018-12-01 20:05:17,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:17,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:17,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:17,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 [2018-12-01 20:05:17,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:17,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:17,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:17,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:17,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:17,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:17,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:17,540 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 20:05:17,542 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 20:05:17,543 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 20:05:17,544 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 20:05:17,544 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 20:05:17,544 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 20:05:17,544 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-12-01 20:05:17,598 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-01 20:05:17,604 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 20:05:17,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:17,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:17,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:05:17,690 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 [2018-12-01 20:05:17,691 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2018-12-01 20:05:17,762 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 55 states and 71 transitions. Complement of second has 10 states. [2018-12-01 20:05:17,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 20:05:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 20:05:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-12-01 20:05:17,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-01 20:05:17,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:17,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-01 20:05:17,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:17,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-01 20:05:17,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:17,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 71 transitions. [2018-12-01 20:05:17,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-01 20:05:17,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 31 states and 44 transitions. [2018-12-01 20:05:17,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-01 20:05:17,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-01 20:05:17,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 44 transitions. [2018-12-01 20:05:17,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 20:05:17,773 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-12-01 20:05:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 44 transitions. [2018-12-01 20:05:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-01 20:05:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-01 20:05:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-12-01 20:05:17,791 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2018-12-01 20:05:17,791 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2018-12-01 20:05:17,791 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 20:05:17,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 42 transitions. [2018-12-01 20:05:17,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-01 20:05:17,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:05:17,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:05:17,792 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 20:05:17,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 20:05:17,792 INFO L794 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 228#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 229#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 242#L551-1 [2018-12-01 20:05:17,793 INFO L796 eck$LassoCheckResult]: Loop: 242#L551-1 assume !main_#t~short7; 224#L551-3 main_#t~short9 := main_#t~short7; 225#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 231#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5; 243#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 244#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 242#L551-1 [2018-12-01 20:05:17,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:17,793 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-01 20:05:17,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:17,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:17,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:17,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:05:17,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:17,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:17,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1244514134, now seen corresponding path program 1 times [2018-12-01 20:05:17,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:17,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:17,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:17,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:05:17,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:05:17,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:05:17,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 20:05:17,845 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 20:05:17,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 20:05:17,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 20:05:17,847 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-12-01 20:05:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:05:17,867 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-01 20:05:17,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 20:05:17,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2018-12-01 20:05:17,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 20:05:17,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 23 transitions. [2018-12-01 20:05:17,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-01 20:05:17,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-01 20:05:17,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-12-01 20:05:17,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 20:05:17,869 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-01 20:05:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-12-01 20:05:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-01 20:05:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-01 20:05:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-01 20:05:17,870 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-01 20:05:17,870 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-01 20:05:17,871 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 20:05:17,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-12-01 20:05:17,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 20:05:17,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:05:17,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:05:17,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:05:17,871 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 20:05:17,871 INFO L794 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 295#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 296#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 311#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 297#L551-3 main_#t~short9 := main_#t~short7; 298#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 309#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5; 305#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 306#L552-2 [2018-12-01 20:05:17,872 INFO L796 eck$LassoCheckResult]: Loop: 306#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 310#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 314#L551-3 main_#t~short9 := main_#t~short7; 301#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 302#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5; 313#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 306#L552-2 [2018-12-01 20:05:17,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2018-12-01 20:05:17,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:17,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:17,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:17,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:05:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:17,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:17,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2018-12-01 20:05:17,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:17,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:17,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:17,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:05:17,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:17,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:17,904 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2018-12-01 20:05:17,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:17,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:17,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:17,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:05:17,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:18,036 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-12-01 20:05:18,319 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 97 [2018-12-01 20:05:18,386 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 20:05:18,386 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 20:05:18,386 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 20:05:18,386 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 20:05:18,386 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 20:05:18,386 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:05:18,386 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 20:05:18,386 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 20:05:18,387 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-01 20:05:18,387 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 20:05:18,387 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 20:05:18,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:18,863 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 20:05:18,863 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 20:05:18,863 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 [2018-12-01 20:05:18,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:18,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:18,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:18,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:18,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,866 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 [2018-12-01 20:05:18,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:18,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:18,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:18,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,868 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 [2018-12-01 20:05:18,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:18,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:18,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:18,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:18,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,869 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 [2018-12-01 20:05:18,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:18,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:18,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:18,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:18,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,870 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 [2018-12-01 20:05:18,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:18,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:18,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:18,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,873 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 [2018-12-01 20:05:18,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:18,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:18,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:18,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,875 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 [2018-12-01 20:05:18,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:18,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:18,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:18,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,879 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 [2018-12-01 20:05:18,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,880 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:05:18,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,880 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:05:18,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:18,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,883 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 [2018-12-01 20:05:18,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:18,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:18,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:18,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,886 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 [2018-12-01 20:05:18,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:18,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:18,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:18,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,890 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 [2018-12-01 20:05:18,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:18,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:18,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:18,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,900 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 [2018-12-01 20:05:18,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:18,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:18,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:18,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,904 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 [2018-12-01 20:05:18,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:18,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:18,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:18,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,908 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 [2018-12-01 20:05:18,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,909 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:05:18,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,909 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:05:18,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:18,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,912 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 [2018-12-01 20:05:18,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,912 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:05:18,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,913 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:05:18,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:18,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:18,916 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 [2018-12-01 20:05:18,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:18,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:18,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:18,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:18,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:18,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:18,919 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 20:05:18,921 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 20:05:18,921 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 20:05:18,922 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 20:05:18,922 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 20:05:18,922 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 20:05:18,923 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2018-12-01 20:05:18,986 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-01 20:05:18,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 20:05:19,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:19,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:19,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:19,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-01 20:05:19,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:19,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:19,060 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 13 [2018-12-01 20:05:19,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:19,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:19,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:19,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-01 20:05:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:19,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:05:19,104 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-01 20:05:19,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-12-01 20:05:19,139 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 32 states and 37 transitions. Complement of second has 8 states. [2018-12-01 20:05:19,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 20:05:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 20:05:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-12-01 20:05:19,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-01 20:05:19,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:19,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-01 20:05:19,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:19,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 12 letters. [2018-12-01 20:05:19,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:19,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-12-01 20:05:19,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 20:05:19,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2018-12-01 20:05:19,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-01 20:05:19,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-01 20:05:19,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2018-12-01 20:05:19,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 20:05:19,142 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-01 20:05:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2018-12-01 20:05:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-01 20:05:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-01 20:05:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-01 20:05:19,144 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-01 20:05:19,144 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-01 20:05:19,144 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 20:05:19,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-12-01 20:05:19,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 20:05:19,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:05:19,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:05:19,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1] [2018-12-01 20:05:19,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 20:05:19,145 INFO L794 eck$LassoCheckResult]: Stem: 525#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 521#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 522#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 540#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 539#L551-3 main_#t~short9 := main_#t~short7; 538#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 537#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5; 536#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 535#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 531#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 517#L551-3 main_#t~short9 := main_#t~short7; 518#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 523#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5; 526#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 527#L552-2 [2018-12-01 20:05:19,145 INFO L796 eck$LassoCheckResult]: Loop: 527#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 533#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 548#L551-3 main_#t~short9 := main_#t~short7; 546#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 544#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5; 542#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 527#L552-2 [2018-12-01 20:05:19,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:19,145 INFO L82 PathProgramCache]: Analyzing trace with hash -692497895, now seen corresponding path program 2 times [2018-12-01 20:05:19,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:19,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:19,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:19,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:05:19,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:19,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2018-12-01 20:05:19,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:19,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:19,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:19,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:05:19,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:19,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:19,172 INFO L82 PathProgramCache]: Analyzing trace with hash 502600418, now seen corresponding path program 2 times [2018-12-01 20:05:19,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:19,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:19,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:19,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:05:19,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:19,302 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-12-01 20:05:19,860 WARN L180 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 134 [2018-12-01 20:05:20,042 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-01 20:05:20,045 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 20:05:20,045 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 20:05:20,045 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 20:05:20,045 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 20:05:20,045 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 20:05:20,045 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:05:20,045 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 20:05:20,046 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 20:05:20,046 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-01 20:05:20,046 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 20:05:20,046 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 20:05:20,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:20,517 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 20:05:20,518 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 20:05:20,518 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 [2018-12-01 20:05:20,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:20,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:20,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:20,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:20,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:20,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:20,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:20,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:20,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 [2018-12-01 20:05:20,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:20,520 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:05:20,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:20,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:20,520 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:05:20,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:20,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:20,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 [2018-12-01 20:05:20,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:20,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:20,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:20,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:20,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:20,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:20,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:20,528 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 [2018-12-01 20:05:20,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:20,529 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:05:20,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:20,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:20,530 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:05:20,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:20,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:20,533 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 [2018-12-01 20:05:20,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:20,534 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:05:20,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:20,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:20,534 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:05:20,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:20,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:20,537 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 [2018-12-01 20:05:20,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:20,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:20,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:20,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:20,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:20,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:20,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:20,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 [2018-12-01 20:05:20,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:20,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:20,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:20,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:20,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:20,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:20,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:20,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:05:20,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:20,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:20,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:20,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:20,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:20,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:20,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:20,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:05:20,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:20,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:20,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:20,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:20,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:20,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:20,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:20,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:05:20,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:20,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:20,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:20,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:20,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:20,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:20,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:20,550 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 [2018-12-01 20:05:20,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:20,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:20,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:20,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:20,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:20,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:20,553 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 20:05:20,555 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 20:05:20,555 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 20:05:20,555 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 20:05:20,555 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 20:05:20,556 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 20:05:20,556 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-12-01 20:05:20,610 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-01 20:05:20,612 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 20:05:20,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:20,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:20,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:20,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-01 20:05:20,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:20,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:20,655 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 13 [2018-12-01 20:05:20,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:20,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:20,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:20,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-01 20:05:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:20,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:05:20,694 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-01 20:05:20,694 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-01 20:05:20,726 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 42 states and 49 transitions. Complement of second has 8 states. [2018-12-01 20:05:20,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 20:05:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 20:05:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-12-01 20:05:20,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-01 20:05:20,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:20,727 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 20:05:20,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:20,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:20,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:20,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-01 20:05:20,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:20,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:20,790 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 13 [2018-12-01 20:05:20,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:20,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:20,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:20,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-01 20:05:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:20,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:05:20,831 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-01 20:05:20,831 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-01 20:05:20,862 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 42 states and 49 transitions. Complement of second has 8 states. [2018-12-01 20:05:20,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 20:05:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 20:05:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-12-01 20:05:20,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-01 20:05:20,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:20,863 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 20:05:20,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:20,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:20,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:20,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-01 20:05:20,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:20,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:20,903 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 13 [2018-12-01 20:05:20,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:20,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:20,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:20,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-01 20:05:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:20,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:05:20,948 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-01 20:05:20,949 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-01 20:05:20,985 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 48 states and 56 transitions. Complement of second has 7 states. [2018-12-01 20:05:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 20:05:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 20:05:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-12-01 20:05:20,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-01 20:05:20,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:20,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 20 letters. Loop has 6 letters. [2018-12-01 20:05:20,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:20,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 12 letters. [2018-12-01 20:05:20,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:20,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2018-12-01 20:05:20,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-01 20:05:20,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 44 transitions. [2018-12-01 20:05:20,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-01 20:05:20,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-01 20:05:20,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2018-12-01 20:05:20,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 20:05:20,988 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-12-01 20:05:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2018-12-01 20:05:20,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 14. [2018-12-01 20:05:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-01 20:05:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-01 20:05:20,989 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-01 20:05:20,989 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-01 20:05:20,989 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 20:05:20,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-12-01 20:05:20,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-01 20:05:20,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:05:20,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:05:20,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 20:05:20,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 20:05:20,990 INFO L794 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1020#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1021#L552-2 [2018-12-01 20:05:20,990 INFO L796 eck$LassoCheckResult]: Loop: 1021#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1028#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1016#L551-3 main_#t~short9 := main_#t~short7; 1017#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1022#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5; 1025#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 1021#L552-2 [2018-12-01 20:05:20,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:20,990 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-01 20:05:20,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:20,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:20,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:20,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:05:20,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:20,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:20,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577164, now seen corresponding path program 1 times [2018-12-01 20:05:20,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:20,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:20,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:20,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:05:20,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:21,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:21,001 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 3 times [2018-12-01 20:05:21,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:21,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:21,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:21,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:05:21,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:21,127 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-12-01 20:05:21,221 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 20:05:21,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 20:05:21,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 20:05:21,221 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 20:05:21,221 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 20:05:21,221 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:05:21,221 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 20:05:21,221 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 20:05:21,221 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-01 20:05:21,221 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 20:05:21,221 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 20:05:21,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:21,609 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 20:05:21,609 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 20:05:21,609 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 [2018-12-01 20:05:21,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:21,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:21,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:21,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:21,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:21,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:21,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:21,612 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 [2018-12-01 20:05:21,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:21,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:21,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:21,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:21,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:21,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:21,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:21,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:21,613 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 [2018-12-01 20:05:21,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:21,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:21,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:21,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:21,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:21,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:21,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:21,614 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 [2018-12-01 20:05:21,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:21,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:21,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:21,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:21,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:21,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:21,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:21,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:21,616 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 [2018-12-01 20:05:21,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:21,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:21,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:21,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:21,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:21,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:21,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:21,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:21,617 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 [2018-12-01 20:05:21,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:21,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:21,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:21,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:21,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:21,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:21,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:21,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:21,619 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 [2018-12-01 20:05:21,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:21,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:21,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:21,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:21,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:21,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:21,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:21,620 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 [2018-12-01 20:05:21,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:21,621 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:05:21,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:21,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:21,621 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:05:21,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:21,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:21,623 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 [2018-12-01 20:05:21,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:21,624 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:05:21,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:21,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:21,625 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:05:21,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:21,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:21,627 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 [2018-12-01 20:05:21,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:21,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:21,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:21,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:21,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:21,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:21,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:21,628 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 [2018-12-01 20:05:21,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:21,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:21,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:21,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:21,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:21,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:21,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:21,631 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 [2018-12-01 20:05:21,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:21,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:21,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:21,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:21,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:21,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:21,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:21,634 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 [2018-12-01 20:05:21,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:21,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:21,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:21,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:21,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:21,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:21,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:21,635 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 20:05:21,636 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 20:05:21,636 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 20:05:21,637 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 20:05:21,637 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 20:05:21,637 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 20:05:21,637 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_4 Supporting invariants [] [2018-12-01 20:05:21,684 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-01 20:05:21,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 20:05:21,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:21,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:21,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:05:21,729 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 [2018-12-01 20:05:21,729 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-01 20:05:21,755 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 36 states and 42 transitions. Complement of second has 9 states. [2018-12-01 20:05:21,755 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 [2018-12-01 20:05:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 20:05:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-12-01 20:05:21,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-01 20:05:21,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:21,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-01 20:05:21,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:21,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-01 20:05:21,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:21,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2018-12-01 20:05:21,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-01 20:05:21,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 30 transitions. [2018-12-01 20:05:21,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-01 20:05:21,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-01 20:05:21,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-12-01 20:05:21,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 20:05:21,758 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-01 20:05:21,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-12-01 20:05:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-12-01 20:05:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-01 20:05:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-01 20:05:21,759 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-01 20:05:21,760 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-01 20:05:21,760 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 20:05:21,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-12-01 20:05:21,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-01 20:05:21,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:05:21,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:05:21,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:05:21,761 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 20:05:21,761 INFO L794 eck$LassoCheckResult]: Stem: 1225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1219#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1220#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1233#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1223#L551-3 main_#t~short9 := main_#t~short7; 1224#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1227#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5; 1230#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 1231#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1235#L551-1 [2018-12-01 20:05:21,761 INFO L796 eck$LassoCheckResult]: Loop: 1235#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1221#L551-3 main_#t~short9 := main_#t~short7; 1222#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1226#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5; 1228#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 1229#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1235#L551-1 [2018-12-01 20:05:21,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:21,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2018-12-01 20:05:21,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:21,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:21,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:21,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:05:21,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:21,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:21,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2018-12-01 20:05:21,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:21,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:21,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:21,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:05:21,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:21,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:21,780 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 3 times [2018-12-01 20:05:21,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:21,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:21,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:05:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:21,938 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2018-12-01 20:05:22,272 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 109 [2018-12-01 20:05:22,763 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2018-12-01 20:05:22,766 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 20:05:22,766 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 20:05:22,766 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 20:05:22,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 20:05:22,766 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 20:05:22,766 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:05:22,766 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 20:05:22,766 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 20:05:22,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-01 20:05:22,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 20:05:22,766 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 20:05:22,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:22,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:22,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:22,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:22,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:22,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:23,079 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2018-12-01 20:05:23,281 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-12-01 20:05:23,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:23,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:23,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:23,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:23,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:23,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:23,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:23,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:23,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:23,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:23,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:23,588 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 20:05:23,588 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 20:05:23,588 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 [2018-12-01 20:05:23,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:23,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:23,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:23,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:23,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:23,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:23,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:23,589 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 [2018-12-01 20:05:23,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:23,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:23,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:23,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:23,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:23,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:23,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:23,591 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 [2018-12-01 20:05:23,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:23,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:23,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:23,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:23,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:23,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:23,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:23,592 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 [2018-12-01 20:05:23,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:23,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:23,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:23,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:23,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:23,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:23,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:23,594 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 [2018-12-01 20:05:23,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:23,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:05:23,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:23,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:23,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:23,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:05:23,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:05:23,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:23,595 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 [2018-12-01 20:05:23,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:23,595 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:05:23,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:23,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:23,596 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:05:23,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:23,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:23,597 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 [2018-12-01 20:05:23,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:23,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:23,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:23,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:23,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:23,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:23,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:23,600 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 [2018-12-01 20:05:23,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:23,600 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:05:23,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:23,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:23,601 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:05:23,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:23,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:05:23,602 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 [2018-12-01 20:05:23,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:05:23,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:05:23,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:05:23,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:05:23,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:05:23,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:05:23,605 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 20:05:23,606 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 20:05:23,606 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 20:05:23,606 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 20:05:23,606 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 20:05:23,607 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 20:05:23,607 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_5 Supporting invariants [] [2018-12-01 20:05:23,678 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-01 20:05:23,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 20:05:23,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:23,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:23,701 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 11 treesize of output 14 [2018-12-01 20:05:23,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:23,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:23,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 20:05:23,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-01 20:05:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:23,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:23,783 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 0 case distinctions, treesize of input 116 treesize of output 80 [2018-12-01 20:05:23,811 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 [2018-12-01 20:05:23,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:23,824 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 0 case distinctions, treesize of input 59 treesize of output 59 [2018-12-01 20:05:23,826 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 24 treesize of output 19 [2018-12-01 20:05:23,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:23,837 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-01 20:05:23,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:23,840 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 33 treesize of output 22 [2018-12-01 20:05:23,841 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,845 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,864 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2018-12-01 20:05:23,894 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 [2018-12-01 20:05:23,894 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:23,930 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 0 case distinctions, treesize of input 71 treesize of output 73 [2018-12-01 20:05:23,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:23,933 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 23 treesize of output 16 [2018-12-01 20:05:23,933 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:23,947 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 39 treesize of output 44 [2018-12-01 20:05:23,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:23,950 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 33 treesize of output 22 [2018-12-01 20:05:23,950 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,954 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,958 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:23,963 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-12-01 20:05:23,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:23,966 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-12-01 20:05:23,966 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:23,977 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-01 20:05:23,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:23,979 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 35 treesize of output 24 [2018-12-01 20:05:23,980 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,984 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,989 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:23,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,005 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 84 [2018-12-01 20:05:24,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-12-01 20:05:24,010 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:24,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,061 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 61 [2018-12-01 20:05:24,061 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:24,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 87 [2018-12-01 20:05:24,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,110 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 20:05:24,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,116 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 100 [2018-12-01 20:05:24,116 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:24,128 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:24,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,160 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 52 [2018-12-01 20:05:24,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:24,163 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:24,169 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:24,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,198 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 3 case distinctions, treesize of input 43 treesize of output 70 [2018-12-01 20:05:24,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:24,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-12-01 20:05:24,202 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:24,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 40 treesize of output 39 [2018-12-01 20:05:24,233 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:24,248 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:24,258 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:24,274 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 20:05:24,297 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 4 case distinctions, treesize of input 126 treesize of output 101 [2018-12-01 20:05:24,882 WARN L180 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-12-01 20:05:24,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 84 treesize of output 83 [2018-12-01 20:05:24,884 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:24,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 84 treesize of output 83 [2018-12-01 20:05:24,886 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:24,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 86 treesize of output 85 [2018-12-01 20:05:24,888 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:25,247 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 71 treesize of output 74 [2018-12-01 20:05:25,247 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:25,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,582 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 0 case distinctions, treesize of input 80 treesize of output 83 [2018-12-01 20:05:25,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-12-01 20:05:25,588 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:25,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,605 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 52 treesize of output 84 [2018-12-01 20:05:25,616 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 59 treesize of output 71 [2018-12-01 20:05:25,618 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-01 20:05:25,630 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:25,637 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:25,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,655 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 100 [2018-12-01 20:05:25,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 90 [2018-12-01 20:05:25,661 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:25,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,719 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2018-12-01 20:05:25,719 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:25,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 77 [2018-12-01 20:05:25,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,772 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 33 treesize of output 22 [2018-12-01 20:05:25,772 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:25,781 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:25,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,820 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-12-01 20:05:25,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:25,823 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:25,829 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:25,843 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:25,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:25,889 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 111 [2018-12-01 20:05:25,896 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 20:05:25,896 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:26,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:26,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2018-12-01 20:05:26,594 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:27,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:27,184 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 60 treesize of output 65 [2018-12-01 20:05:27,184 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:27,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:27,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 92 [2018-12-01 20:05:27,775 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-12-01 20:05:28,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:28,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:28,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:28,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:28,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:28,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:28,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 100 [2018-12-01 20:05:28,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:28,420 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 20:05:28,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:28,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:28,437 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 122 [2018-12-01 20:05:28,438 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-12-01 20:05:28,480 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:28,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:28,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:28,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:28,984 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 98 [2018-12-01 20:05:28,985 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:29,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,301 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-01 20:05:29,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:29,304 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:29,311 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:29,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,534 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 63 treesize of output 93 [2018-12-01 20:05:29,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 65 [2018-12-01 20:05:29,538 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:29,567 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:29,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2018-12-01 20:05:29,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:29,723 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:29,733 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:29,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 109 [2018-12-01 20:05:29,855 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 114 treesize of output 99 [2018-12-01 20:05:29,856 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:29,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,901 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 73 [2018-12-01 20:05:29,902 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:29,921 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:29,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,936 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 59 treesize of output 90 [2018-12-01 20:05:29,939 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 91 treesize of output 83 [2018-12-01 20:05:29,939 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:29,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:29,978 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-12-01 20:05:29,978 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:29,997 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:30,248 INFO L267 ElimStorePlain]: Start of recursive call 44: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-01 20:05:30,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:30,534 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 75 treesize of output 99 [2018-12-01 20:05:30,540 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 20:05:30,540 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:31,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:31,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-12-01 20:05:31,127 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:31,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:31,632 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 60 treesize of output 65 [2018-12-01 20:05:31,633 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:32,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:32,118 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 56 treesize of output 65 [2018-12-01 20:05:32,118 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:32,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:32,654 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-01 20:05:32,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:32,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:32,657 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:32,664 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:33,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 91 [2018-12-01 20:05:33,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,043 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 20:05:33,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,049 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 96 [2018-12-01 20:05:33,050 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:33,062 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:33,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,218 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 66 treesize of output 84 [2018-12-01 20:05:33,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,225 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 20:05:33,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,248 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 122 [2018-12-01 20:05:33,248 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-12-01 20:05:33,284 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:33,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,419 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 63 treesize of output 93 [2018-12-01 20:05:33,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 73 [2018-12-01 20:05:33,423 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:33,450 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:33,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,840 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-01 20:05:33,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:33,843 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:33,852 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:33,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,930 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-12-01 20:05:33,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:33,933 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:33,938 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:33,952 INFO L267 ElimStorePlain]: Start of recursive call 64: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:33,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,956 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2018-12-01 20:05:33,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,959 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-12-01 20:05:33,959 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:33,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,971 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-01 20:05:33,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,973 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 35 treesize of output 24 [2018-12-01 20:05:33,973 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:33,978 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:33,984 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:33,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:33,998 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 88 [2018-12-01 20:05:34,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-12-01 20:05:34,002 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,051 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2018-12-01 20:05:34,052 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,094 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-12-01 20:05:34,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,097 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 33 treesize of output 22 [2018-12-01 20:05:34,097 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,104 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2018-12-01 20:05:34,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,143 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 33 treesize of output 22 [2018-12-01 20:05:34,144 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,152 INFO L267 ElimStorePlain]: Start of recursive call 90: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,181 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 47 treesize of output 52 [2018-12-01 20:05:34,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:34,183 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,192 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,202 INFO L267 ElimStorePlain]: Start of recursive call 85: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,261 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 20:05:34,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:34,296 INFO L202 ElimStorePlain]: Needed 93 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-12-01 20:05:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:05:34,308 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-01 20:05:34,309 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-12-01 20:05:34,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 38 states and 44 transitions. Complement of second has 10 states. [2018-12-01 20:05:34,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 20:05:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 20:05:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-12-01 20:05:34,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-01 20:05:34,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:34,340 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 20:05:34,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:34,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:34,362 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 11 treesize of output 14 [2018-12-01 20:05:34,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 20:05:34,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-01 20:05:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:34,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:34,463 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2018-12-01 20:05:34,495 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 [2018-12-01 20:05:34,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,528 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 0 case distinctions, treesize of input 71 treesize of output 73 [2018-12-01 20:05:34,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,531 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 23 treesize of output 16 [2018-12-01 20:05:34,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,542 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 39 treesize of output 44 [2018-12-01 20:05:34,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,545 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 33 treesize of output 22 [2018-12-01 20:05:34,545 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,551 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,560 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-12-01 20:05:34,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,562 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-12-01 20:05:34,563 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,575 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-01 20:05:34,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,577 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 35 treesize of output 24 [2018-12-01 20:05:34,577 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,583 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,588 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,603 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 84 [2018-12-01 20:05:34,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-12-01 20:05:34,607 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,658 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 61 [2018-12-01 20:05:34,659 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,702 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-12-01 20:05:34,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:34,705 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,711 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,742 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 43 treesize of output 48 [2018-12-01 20:05:34,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:34,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:34,744 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,750 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,765 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:34,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 20:05:34,803 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 4 case distinctions, treesize of input 126 treesize of output 101 [2018-12-01 20:05:35,400 WARN L180 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-12-01 20:05:35,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 86 treesize of output 85 [2018-12-01 20:05:35,403 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:35,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 84 treesize of output 83 [2018-12-01 20:05:35,405 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:35,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 84 treesize of output 83 [2018-12-01 20:05:35,407 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:35,749 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 71 treesize of output 74 [2018-12-01 20:05:35,750 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:36,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:36,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:36,168 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 111 [2018-12-01 20:05:36,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:36,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 108 [2018-12-01 20:05:36,187 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-12-01 20:05:36,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:36,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2018-12-01 20:05:36,976 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:37,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:37,634 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 60 treesize of output 65 [2018-12-01 20:05:37,635 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:38,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:38,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:38,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:38,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84 [2018-12-01 20:05:38,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:38,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:38,870 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:38,880 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:39,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:39,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:39,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:39,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:39,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 117 [2018-12-01 20:05:39,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 96 [2018-12-01 20:05:39,292 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:39,330 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:39,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:39,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:39,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:39,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:39,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:39,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:39,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 100 [2018-12-01 20:05:39,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:39,864 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 20:05:39,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:39,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:39,879 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 122 [2018-12-01 20:05:39,880 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-12-01 20:05:39,918 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:40,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,160 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 66 treesize of output 84 [2018-12-01 20:05:40,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,164 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 20:05:40,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,180 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 122 [2018-12-01 20:05:40,181 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-12-01 20:05:40,219 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:40,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2018-12-01 20:05:40,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:40,461 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:40,472 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:40,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,817 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-01 20:05:40,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:40,821 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:40,829 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:40,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:40,971 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 59 treesize of output 90 [2018-12-01 20:05:40,974 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 91 treesize of output 83 [2018-12-01 20:05:40,974 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:41,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,022 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-12-01 20:05:41,022 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:41,047 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:41,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 109 [2018-12-01 20:05:41,065 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 114 treesize of output 99 [2018-12-01 20:05:41,066 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:41,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,113 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 73 [2018-12-01 20:05:41,113 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:41,133 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:41,210 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-01 20:05:41,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,228 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 100 [2018-12-01 20:05:41,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2018-12-01 20:05:41,233 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:41,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,292 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2018-12-01 20:05:41,292 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:41,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 77 [2018-12-01 20:05:41,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,344 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 33 treesize of output 22 [2018-12-01 20:05:41,344 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:41,354 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:41,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,401 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-12-01 20:05:41,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,403 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 33 treesize of output 22 [2018-12-01 20:05:41,404 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:41,410 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:41,427 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:41,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,432 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 0 case distinctions, treesize of input 80 treesize of output 83 [2018-12-01 20:05:41,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-12-01 20:05:41,439 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:41,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,457 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 52 treesize of output 84 [2018-12-01 20:05:41,473 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 59 treesize of output 71 [2018-12-01 20:05:41,474 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-01 20:05:41,487 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:41,494 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:41,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,714 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 75 treesize of output 99 [2018-12-01 20:05:41,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:41,721 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 78 treesize of output 73 [2018-12-01 20:05:41,722 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:42,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:42,547 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 56 treesize of output 65 [2018-12-01 20:05:42,547 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:43,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:43,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-12-01 20:05:43,167 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:44,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:44,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:44,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:44,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84 [2018-12-01 20:05:44,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:44,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:44,208 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:44,220 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:44,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:44,526 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 55 treesize of output 60 [2018-12-01 20:05:44,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:44,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:44,529 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:44,536 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:44,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:44,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:44,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:44,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:44,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 117 [2018-12-01 20:05:44,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 110 treesize of output 95 [2018-12-01 20:05:44,808 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:44,846 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:45,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,092 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 66 treesize of output 84 [2018-12-01 20:05:45,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,096 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 20:05:45,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,109 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 122 [2018-12-01 20:05:45,110 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2018-12-01 20:05:45,145 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:45,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,222 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-01 20:05:45,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:45,224 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,231 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,289 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 70 [2018-12-01 20:05:45,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 67 treesize of output 59 [2018-12-01 20:05:45,291 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-12-01 20:05:45,319 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,333 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:45,346 INFO L267 ElimStorePlain]: Start of recursive call 57: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2018-12-01 20:05:45,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,353 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-12-01 20:05:45,353 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,365 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-01 20:05:45,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,367 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 35 treesize of output 24 [2018-12-01 20:05:45,368 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,371 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,377 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,392 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 88 [2018-12-01 20:05:45,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-12-01 20:05:45,395 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,448 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2018-12-01 20:05:45,448 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,493 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 51 treesize of output 56 [2018-12-01 20:05:45,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,495 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 33 treesize of output 22 [2018-12-01 20:05:45,495 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,501 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,522 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-12-01 20:05:45,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,524 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 33 treesize of output 22 [2018-12-01 20:05:45,525 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,530 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,545 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,602 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 20:05:45,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2018-12-01 20:05:45,634 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 [2018-12-01 20:05:45,635 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,648 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 0 case distinctions, treesize of input 59 treesize of output 59 [2018-12-01 20:05:45,650 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 24 treesize of output 19 [2018-12-01 20:05:45,650 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,661 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-01 20:05:45,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,663 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 33 treesize of output 22 [2018-12-01 20:05:45,663 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,669 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,672 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,677 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:45,713 INFO L202 ElimStorePlain]: Needed 90 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-12-01 20:05:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:05:45,726 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-01 20:05:45,726 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-12-01 20:05:45,762 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 35 states and 39 transitions. Complement of second has 12 states. [2018-12-01 20:05:45,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-01 20:05:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 20:05:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-01 20:05:45,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-01 20:05:45,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:45,763 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 20:05:45,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:45,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:45,784 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 11 treesize of output 14 [2018-12-01 20:05:45,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 20:05:45,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-01 20:05:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:05:45,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:05:45,867 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 0 case distinctions, treesize of input 116 treesize of output 80 [2018-12-01 20:05:45,897 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 [2018-12-01 20:05:45,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,912 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 0 case distinctions, treesize of input 59 treesize of output 59 [2018-12-01 20:05:45,914 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 24 treesize of output 19 [2018-12-01 20:05:45,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,928 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-01 20:05:45,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:45,931 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 33 treesize of output 22 [2018-12-01 20:05:45,931 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,938 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,943 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:45,970 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2018-12-01 20:05:46,033 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 [2018-12-01 20:05:46,033 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,118 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-12-01 20:05:46,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,127 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-12-01 20:05:46,127 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,157 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-01 20:05:46,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,163 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 35 treesize of output 24 [2018-12-01 20:05:46,164 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,175 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,188 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,209 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 0 case distinctions, treesize of input 71 treesize of output 73 [2018-12-01 20:05:46,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,216 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 23 treesize of output 16 [2018-12-01 20:05:46,216 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,241 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 39 treesize of output 44 [2018-12-01 20:05:46,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,245 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 33 treesize of output 22 [2018-12-01 20:05:46,245 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,253 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,262 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,305 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 84 [2018-12-01 20:05:46,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-12-01 20:05:46,312 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,469 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 61 [2018-12-01 20:05:46,470 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,572 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-12-01 20:05:46,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:46,579 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,594 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 87 [2018-12-01 20:05:46,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,644 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 20:05:46,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,650 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 96 [2018-12-01 20:05:46,651 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,662 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,685 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 43 treesize of output 48 [2018-12-01 20:05:46,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:46,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:46,688 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,693 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,702 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:46,720 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 20:05:46,743 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 4 case distinctions, treesize of input 126 treesize of output 101 [2018-12-01 20:05:47,317 WARN L180 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-12-01 20:05:47,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 84 treesize of output 83 [2018-12-01 20:05:47,319 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:47,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 86 treesize of output 85 [2018-12-01 20:05:47,321 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:47,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 84 treesize of output 83 [2018-12-01 20:05:47,323 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:47,654 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 71 treesize of output 74 [2018-12-01 20:05:47,654 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:47,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:47,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:47,992 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 0 case distinctions, treesize of input 80 treesize of output 83 [2018-12-01 20:05:47,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:47,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-12-01 20:05:47,997 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:48,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,014 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 52 treesize of output 84 [2018-12-01 20:05:48,025 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 59 treesize of output 71 [2018-12-01 20:05:48,026 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-01 20:05:48,039 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:48,045 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:48,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,062 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 100 [2018-12-01 20:05:48,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2018-12-01 20:05:48,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,076 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 45 [2018-12-01 20:05:48,077 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 20:05:48,087 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:48,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 74 [2018-12-01 20:05:48,136 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:48,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2018-12-01 20:05:48,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,188 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 33 treesize of output 22 [2018-12-01 20:05:48,188 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:48,197 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:48,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,232 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-12-01 20:05:48,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,234 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 33 treesize of output 22 [2018-12-01 20:05:48,234 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:48,240 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:48,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 77 [2018-12-01 20:05:48,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,274 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 33 treesize of output 22 [2018-12-01 20:05:48,274 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:48,283 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:48,298 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:48,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,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, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 111 [2018-12-01 20:05:48,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:48,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 108 [2018-12-01 20:05:48,339 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-12-01 20:05:49,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:49,145 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 60 treesize of output 65 [2018-12-01 20:05:49,145 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:50,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:50,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2018-12-01 20:05:50,466 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:51,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,144 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-01 20:05:51,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:51,147 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:51,153 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:51,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,543 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 98 [2018-12-01 20:05:51,543 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:51,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 100 [2018-12-01 20:05:51,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,819 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 20:05:51,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:51,835 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 122 [2018-12-01 20:05:51,835 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-12-01 20:05:51,875 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:52,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:52,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:52,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:52,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2018-12-01 20:05:52,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:52,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:52,673 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:52,689 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:53,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 109 [2018-12-01 20:05:53,405 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 114 treesize of output 99 [2018-12-01 20:05:53,406 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:53,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,480 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 73 [2018-12-01 20:05:53,481 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:53,511 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:53,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,532 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 59 treesize of output 90 [2018-12-01 20:05:53,536 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 91 treesize of output 83 [2018-12-01 20:05:53,536 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:53,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,582 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-12-01 20:05:53,583 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:53,601 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:53,675 INFO L267 ElimStorePlain]: Start of recursive call 46: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-01 20:05:53,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,895 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 88 [2018-12-01 20:05:53,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-12-01 20:05:53,899 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:53,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,950 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2018-12-01 20:05:53,950 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:53,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,992 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-12-01 20:05:53,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:53,995 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 33 treesize of output 22 [2018-12-01 20:05:53,995 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:54,001 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:54,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:54,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:54,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:54,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2018-12-01 20:05:54,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:54,038 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 33 treesize of output 22 [2018-12-01 20:05:54,038 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:54,048 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:54,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:54,074 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 47 treesize of output 52 [2018-12-01 20:05:54,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:54,077 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 33 treesize of output 22 [2018-12-01 20:05:54,077 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:54,082 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:54,093 INFO L267 ElimStorePlain]: Start of recursive call 63: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:54,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:54,098 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2018-12-01 20:05:54,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:54,100 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-12-01 20:05:54,100 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:54,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:54,112 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-01 20:05:54,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:54,114 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 35 treesize of output 24 [2018-12-01 20:05:54,114 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:54,118 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:54,124 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:54,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:54,147 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 75 treesize of output 99 [2018-12-01 20:05:54,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:54,154 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 74 treesize of output 73 [2018-12-01 20:05:54,154 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:55,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:55,005 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 60 treesize of output 65 [2018-12-01 20:05:55,006 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:55,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:55,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-12-01 20:05:55,487 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:56,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:56,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:56,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:56,589 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 98 [2018-12-01 20:05:56,589 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:57,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:57,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2018-12-01 20:05:57,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:57,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:57,052 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:57,060 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:57,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:57,191 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-01 20:05:57,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:57,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:57,194 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:57,200 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:57,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:57,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:57,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:57,247 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 66 treesize of output 84 [2018-12-01 20:05:57,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:57,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:57,251 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 20:05:57,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:57,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:57,265 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 122 [2018-12-01 20:05:57,266 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 2 xjuncts. [2018-12-01 20:05:57,300 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:57,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:57,497 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-01 20:05:57,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:05:57,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-01 20:05:57,499 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-12-01 20:05:57,507 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:57,530 INFO L267 ElimStorePlain]: Start of recursive call 76: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:05:57,603 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 20:05:57,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 20:05:57,642 INFO L202 ElimStorePlain]: Needed 88 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-12-01 20:05:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:05:57,657 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-01 20:05:57,657 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-12-01 20:05:57,695 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 46 states and 53 transitions. Complement of second has 11 states. [2018-12-01 20:05:57,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 20:05:57,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 20:05:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-12-01 20:05:57,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-01 20:05:57,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:57,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-01 20:05:57,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:57,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2018-12-01 20:05:57,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:05:57,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 53 transitions. [2018-12-01 20:05:57,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-01 20:05:57,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 25 states and 29 transitions. [2018-12-01 20:05:57,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-12-01 20:05:57,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-12-01 20:05:57,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2018-12-01 20:05:57,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 20:05:57,697 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-12-01 20:05:57,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2018-12-01 20:05:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-01 20:05:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-01 20:05:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-12-01 20:05:57,698 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-01 20:05:57,698 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-01 20:05:57,699 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 20:05:57,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-12-01 20:05:57,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 20:05:57,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:05:57,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:05:57,699 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:05:57,699 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1] [2018-12-01 20:05:57,699 INFO L794 eck$LassoCheckResult]: Stem: 1670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1666#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1667#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1675#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1681#L551-3 main_#t~short9 := main_#t~short7; 1680#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1679#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5; 1678#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 1677#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1676#L551-1 [2018-12-01 20:05:57,699 INFO L796 eck$LassoCheckResult]: Loop: 1676#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1668#L551-3 main_#t~short9 := main_#t~short7; 1669#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1671#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5; 1672#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 1673#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1675#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1681#L551-3 main_#t~short9 := main_#t~short7; 1680#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1679#L551-6 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5; 1678#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 1677#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1676#L551-1 [2018-12-01 20:05:57,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:57,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 3 times [2018-12-01 20:05:57,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:57,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:57,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:57,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:05:57,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:57,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:57,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1005496147, now seen corresponding path program 1 times [2018-12-01 20:05:57,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:57,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:57,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:05:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:57,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:05:57,716 INFO L82 PathProgramCache]: Analyzing trace with hash -588138969, now seen corresponding path program 4 times [2018-12-01 20:05:57,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:05:57,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:05:57,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:57,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:05:57,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:05:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:05:58,107 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 106 [2018-12-01 20:05:58,527 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2018-12-01 20:05:58,766 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2018-12-01 20:05:59,141 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-12-01 20:05:59,144 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 20:05:59,144 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 20:05:59,144 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 20:05:59,144 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 20:05:59,144 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 20:05:59,144 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:05:59,144 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 20:05:59,144 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 20:05:59,144 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-01 20:05:59,144 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 20:05:59,144 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 20:05:59,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,441 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2018-12-01 20:05:59,669 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-12-01 20:05:59,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:05:59,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:06:00,150 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 20:06:00,150 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 20:06:00,150 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 [2018-12-01 20:06:00,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:06:00,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:06:00,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,152 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 [2018-12-01 20:06:00,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:06:00,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:06:00,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,154 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 [2018-12-01 20:06:00,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:06:00,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:06:00,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,156 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 [2018-12-01 20:06:00,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:06:00,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:06:00,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:06:00,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,158 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 [2018-12-01 20:06:00,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:06:00,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:06:00,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,160 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 [2018-12-01 20:06:00,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:06:00,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:06:00,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:06:00,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,162 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 [2018-12-01 20:06:00,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:06:00,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:06:00,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,165 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 [2018-12-01 20:06:00,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:06:00,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:06:00,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:06:00,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,167 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 [2018-12-01 20:06:00,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:06:00,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:06:00,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:06:00,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:06:00,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:06:00,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:06:00,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:06:00,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:06:00,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:06:00,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:06:00,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,173 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 [2018-12-01 20:06:00,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:06:00,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:06:00,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,179 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 [2018-12-01 20:06:00,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:06:00,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:06:00,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,182 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 [2018-12-01 20:06:00,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:06:00,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:06:00,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:06:00,184 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 [2018-12-01 20:06:00,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:06:00,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:06:00,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:06:00,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:06:00,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:06:00,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:06:00,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:06:00,186 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 20:06:00,187 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 20:06:00,187 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 20:06:00,187 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 20:06:00,187 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 20:06:00,187 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 20:06:00,187 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-12-01 20:06:00,251 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-01 20:06:00,254 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 20:06:00,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:06:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:06:00,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:06:00,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:06:00,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-01 20:06:00,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:06:00,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:06:00,291 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 13 [2018-12-01 20:06:00,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:06:00,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:06:00,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:06:00,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-01 20:06:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:06:00,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:06:00,393 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 0 case distinctions, treesize of input 122 treesize of output 86 [2018-12-01 20:06:00,422 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 [2018-12-01 20:06:00,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:06:00,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:06:00,444 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 1 case distinctions, treesize of input 67 treesize of output 65 [2018-12-01 20:06:00,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:06:00,447 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 33 treesize of output 22 [2018-12-01 20:06:00,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 20:06:00,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:06:00,469 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 3 case distinctions, treesize of input 41 treesize of output 69 [2018-12-01 20:06:00,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:06:00,472 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 58 treesize of output 51 [2018-12-01 20:06:00,472 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 20:06:00,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:06:00,502 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 54 [2018-12-01 20:06:00,503 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-12-01 20:06:00,522 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 20:06:00,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 20:06:00,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 20:06:00,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 20:06:00,574 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:154, output treesize:93 [2018-12-01 20:06:00,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:06:00,602 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2018-12-01 20:06:00,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 20:06:00,605 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 23 treesize of output 16 [2018-12-01 20:06:00,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:06:00,619 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-01 20:06:00,620 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 [2018-12-01 20:06:00,620 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 20:06:00,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:06:00,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:06:00,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:06:00,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:25 [2018-12-01 20:06:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 20:06:00,633 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-01 20:06:00,633 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-12-01 20:06:00,694 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 58 states and 69 transitions. Complement of second has 11 states. [2018-12-01 20:06:00,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-01 20:06:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 20:06:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-01 20:06:00,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 9 letters. Loop has 12 letters. [2018-12-01 20:06:00,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:06:00,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 21 letters. Loop has 12 letters. [2018-12-01 20:06:00,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:06:00,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 9 letters. Loop has 24 letters. [2018-12-01 20:06:00,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:06:00,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 69 transitions. [2018-12-01 20:06:00,696 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 20:06:00,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 0 states and 0 transitions. [2018-12-01 20:06:00,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 20:06:00,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 20:06:00,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 20:06:00,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 20:06:00,697 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 20:06:00,697 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 20:06:00,697 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 20:06:00,697 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 20:06:00,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 20:06:00,697 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 20:06:00,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 20:06:00,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 08:06:00 BoogieIcfgContainer [2018-12-01 20:06:00,703 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 20:06:00,703 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 20:06:00,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 20:06:00,703 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 20:06:00,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:05:16" (3/4) ... [2018-12-01 20:06:00,706 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 20:06:00,706 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 20:06:00,707 INFO L168 Benchmark]: Toolchain (without parser) took 44642.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. [2018-12-01 20:06:00,707 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 20:06:00,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-01 20:06:00,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 20:06:00,708 INFO L168 Benchmark]: Boogie Preprocessor took 13.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 20:06:00,708 INFO L168 Benchmark]: RCFGBuilder took 142.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-01 20:06:00,708 INFO L168 Benchmark]: BuchiAutomizer took 44209.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 212.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.8 MB). Peak memory consumption was 174.5 MB. Max. memory is 11.5 GB. [2018-12-01 20:06:00,708 INFO L168 Benchmark]: Witness Printer took 3.36 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 20:06:00,710 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 142.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 44209.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 212.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.8 MB). Peak memory consumption was 174.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.36 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 - 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 (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[d][d] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[d][d] and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.1s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 8.8s. Construction of modules took 0.1s. Büchi inclusion checks took 35.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 39 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/6 HoareTripleCheckerStatistics: 67 SDtfs, 147 SDslu, 43 SDs, 0 SdLazy, 184 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital1222 mio100 ax103 hnf99 lsp80 ukn49 mio100 lsp34 div100 bol103 ite100 ukn100 eq178 hnf88 smp97 dnf124 smp86 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...