./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.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_233cee02-4c54-41ae-a797-6d139773b40f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_233cee02-4c54-41ae-a797-6d139773b40f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_233cee02-4c54-41ae-a797-6d139773b40f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_233cee02-4c54-41ae-a797-6d139773b40f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_233cee02-4c54-41ae-a797-6d139773b40f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_233cee02-4c54-41ae-a797-6d139773b40f/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 14310793a2daa3bf62d53b5cef67b6406903d242 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 08:31:52,866 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:31:52,867 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:31:52,873 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:31:52,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:31:52,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:31:52,874 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:31:52,875 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:31:52,876 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:31:52,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:31:52,877 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:31:52,877 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:31:52,878 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:31:52,878 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:31:52,879 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:31:52,879 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:31:52,879 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:31:52,880 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:31:52,881 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:31:52,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:31:52,882 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:31:52,883 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:31:52,884 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:31:52,884 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:31:52,884 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:31:52,884 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:31:52,885 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:31:52,885 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:31:52,886 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:31:52,886 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:31:52,886 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:31:52,887 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:31:52,887 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:31:52,887 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:31:52,887 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:31:52,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:31:52,888 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_233cee02-4c54-41ae-a797-6d139773b40f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 08:31:52,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:31:52,895 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:31:52,896 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 08:31:52,896 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 08:31:52,896 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 08:31:52,896 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 08:31:52,897 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 08:31:52,897 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 08:31:52,897 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 08:31:52,897 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 08:31:52,897 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 08:31:52,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:31:52,897 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 08:31:52,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:31:52,898 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:31:52,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 08:31:52,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 08:31:52,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 08:31:52,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 08:31:52,898 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 08:31:52,898 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 08:31:52,898 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 08:31:52,899 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:31:52,899 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:31:52,899 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 08:31:52,899 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:31:52,899 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 08:31:52,899 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 08:31:52,900 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 08:31:52,900 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_233cee02-4c54-41ae-a797-6d139773b40f/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 -> 14310793a2daa3bf62d53b5cef67b6406903d242 [2018-12-02 08:31:52,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:31:52,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:31:52,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:31:52,926 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:31:52,926 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:31:52,926 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_233cee02-4c54-41ae-a797-6d139773b40f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.c.i [2018-12-02 08:31:52,960 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_233cee02-4c54-41ae-a797-6d139773b40f/bin-2019/uautomizer/data/f806cded3/2baf43fb33064633be6537b706cbfe60/FLAG1ad9a1ff1 [2018-12-02 08:31:53,303 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:31:53,303 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_233cee02-4c54-41ae-a797-6d139773b40f/sv-benchmarks/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.c.i [2018-12-02 08:31:53,309 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_233cee02-4c54-41ae-a797-6d139773b40f/bin-2019/uautomizer/data/f806cded3/2baf43fb33064633be6537b706cbfe60/FLAG1ad9a1ff1 [2018-12-02 08:31:53,695 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_233cee02-4c54-41ae-a797-6d139773b40f/bin-2019/uautomizer/data/f806cded3/2baf43fb33064633be6537b706cbfe60 [2018-12-02 08:31:53,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:31:53,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:31:53,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:31:53,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:31:53,700 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:31:53,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:31:53" (1/1) ... [2018-12-02 08:31:53,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae65c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:53, skipping insertion in model container [2018-12-02 08:31:53,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:31:53" (1/1) ... [2018-12-02 08:31:53,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:31:53,726 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:31:53,873 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:31:53,880 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:31:53,935 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:31:53,954 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:31:53,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:53 WrapperNode [2018-12-02 08:31:53,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:31:53,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:31:53,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:31:53,955 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:31:53,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:53" (1/1) ... [2018-12-02 08:31:53,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:53" (1/1) ... [2018-12-02 08:31:53,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:31:53,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:31:53,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:31:53,981 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:31:53,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:53" (1/1) ... [2018-12-02 08:31:53,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:53" (1/1) ... [2018-12-02 08:31:53,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:53" (1/1) ... [2018-12-02 08:31:53,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:53" (1/1) ... [2018-12-02 08:31:53,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:53" (1/1) ... [2018-12-02 08:31:53,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:53" (1/1) ... [2018-12-02 08:31:53,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:53" (1/1) ... [2018-12-02 08:31:53,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:31:53,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:31:53,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:31:53,996 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:31:53,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_233cee02-4c54-41ae-a797-6d139773b40f/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-02 08:31:54,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 08:31:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 08:31:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 08:31:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 08:31:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:31:54,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:31:54,155 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:31:54,155 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 08:31:54,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:31:54 BoogieIcfgContainer [2018-12-02 08:31:54,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:31:54,156 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 08:31:54,156 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 08:31:54,159 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 08:31:54,159 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 08:31:54,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 08:31:53" (1/3) ... [2018-12-02 08:31:54,160 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7eada6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 08:31:54, skipping insertion in model container [2018-12-02 08:31:54,160 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 08:31:54,160 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:53" (2/3) ... [2018-12-02 08:31:54,160 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7eada6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 08:31:54, skipping insertion in model container [2018-12-02 08:31:54,160 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 08:31:54,161 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:31:54" (3/3) ... [2018-12-02 08:31:54,162 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.14-alloca_true-termination_true-no-overflow.c.i [2018-12-02 08:31:54,194 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 08:31:54,195 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 08:31:54,195 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 08:31:54,195 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 08:31:54,195 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:31:54,195 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:31:54,195 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 08:31:54,195 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:31:54,195 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 08:31:54,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-02 08:31:54,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 08:31:54,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:54,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:54,220 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 08:31:54,220 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 08:31:54,221 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 08:31:54,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-02 08:31:54,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 08:31:54,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:54,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:54,222 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 08:31:54,222 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 08:31:54,227 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~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L556-4true [2018-12-02 08:31:54,227 INFO L796 eck$LassoCheckResult]: Loop: 6#L556-4true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 14#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 7#L555-3true assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8; 4#L556-3true assume !true; 6#L556-4true [2018-12-02 08:31:54,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:54,231 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 08:31:54,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:54,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:54,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:54,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:54,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:54,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1142256, now seen corresponding path program 1 times [2018-12-02 08:31:54,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:54,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:54,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:54,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:54,339 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-02 08:31:54,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:31:54,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-02 08:31:54,342 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 08:31:54,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 08:31:54,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 08:31:54,352 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-12-02 08:31:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:31:54,356 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-12-02 08:31:54,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 08:31:54,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-12-02 08:31:54,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 08:31:54,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 9 transitions. [2018-12-02 08:31:54,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 08:31:54,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 08:31:54,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2018-12-02 08:31:54,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 08:31:54,361 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-02 08:31:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2018-12-02 08:31:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-02 08:31:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 08:31:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-02 08:31:54,377 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-02 08:31:54,377 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-02 08:31:54,377 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 08:31:54,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-12-02 08:31:54,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 08:31:54,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:54,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:54,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 08:31:54,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 08:31:54,378 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L556-4 [2018-12-02 08:31:54,378 INFO L796 eck$LassoCheckResult]: Loop: 33#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 37#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 38#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8; 34#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 33#L556-4 [2018-12-02 08:31:54,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:54,378 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 08:31:54,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:54,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:54,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:54,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:54,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:54,397 INFO L82 PathProgramCache]: Analyzing trace with hash 35409745, now seen corresponding path program 1 times [2018-12-02 08:31:54,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:54,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:31:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:54,451 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-02 08:31:54,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:31:54,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:31:54,452 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 08:31:54,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:31:54,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:31:54,452 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-12-02 08:31:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:31:54,524 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2018-12-02 08:31:54,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:31:54,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2018-12-02 08:31:54,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 08:31:54,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2018-12-02 08:31:54,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 08:31:54,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 08:31:54,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-12-02 08:31:54,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 08:31:54,526 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-02 08:31:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-12-02 08:31:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-02 08:31:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 08:31:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-02 08:31:54,527 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-02 08:31:54,527 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-02 08:31:54,527 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 08:31:54,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-12-02 08:31:54,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 08:31:54,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:54,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:54,527 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 08:31:54,527 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-02 08:31:54,528 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 64#L556-4 [2018-12-02 08:31:54,528 INFO L796 eck$LassoCheckResult]: Loop: 64#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 68#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 69#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8; 65#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 66#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 70#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 71#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 64#L556-4 [2018-12-02 08:31:54,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:54,528 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-02 08:31:54,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:54,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:54,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:54,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:54,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:54,543 INFO L82 PathProgramCache]: Analyzing trace with hash -330970762, now seen corresponding path program 1 times [2018-12-02 08:31:54,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:54,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:54,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:31:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:54,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:54,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2018-12-02 08:31:54,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:54,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:54,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:54,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:54,716 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2018-12-02 08:31:54,928 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-12-02 08:31:55,011 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 08:31:55,012 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 08:31:55,012 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 08:31:55,012 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 08:31:55,012 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 08:31:55,012 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 08:31:55,012 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 08:31:55,013 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 08:31:55,013 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.14-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-02 08:31:55,013 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 08:31:55,013 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 08:31:55,027 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-02 08:31:55,031 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-02 08:31:55,032 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-02 08:31:55,034 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-02 08:31:55,035 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-02 08:31:55,036 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-02 08:31:55,039 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-02 08:31:55,040 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-02 08:31:55,042 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-02 08:31:55,043 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-02 08:31:55,045 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-02 08:31:55,047 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-02 08:31:55,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-02 08:31:55,242 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2018-12-02 08:31:55,317 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-02 08:31:55,318 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-02 08:31:55,320 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-02 08:31:55,321 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-02 08:31:55,322 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-02 08:31:55,608 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 08:31:55,611 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 08:31:55,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-02 08:31:55,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:55,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:55,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:55,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:55,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:55,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-02 08:31:55,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:55,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:55,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:55,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:55,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:55,618 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-02 08:31:55,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:55,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:55,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:55,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:55,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:55,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-02 08:31:55,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:55,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:55,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:55,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:55,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:55,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:31:55,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:55,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:55,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:55,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:55,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:55,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-02 08:31:55,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:55,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:55,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:55,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:55,626 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-02 08:31:55,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:55,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:55,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:55,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:55,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:55,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-02 08:31:55,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:55,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:55,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:55,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:55,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:55,630 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-02 08:31:55,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:55,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:55,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:55,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:55,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:55,632 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-02 08:31:55,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:55,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:55,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:55,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:55,638 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-02 08:31:55,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:55,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:55,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:55,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:55,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:55,641 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-02 08:31:55,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:55,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:55,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:55,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:55,645 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-02 08:31:55,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,646 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 08:31:55,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,648 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 08:31:55,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:55,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:55,655 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-02 08:31:55,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:55,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:55,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:55,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:55,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:55,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:55,678 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 08:31:55,687 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 08:31:55,688 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 08:31:55,689 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 08:31:55,690 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 08:31:55,691 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 08:31:55,691 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-12-02 08:31:55,756 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 08:31:55,760 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 08:31:55,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:55,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:55,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:55,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:55,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 92 [2018-12-02 08:31:55,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:55,919 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 68 treesize of output 63 [2018-12-02 08:31:55,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:55,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:55,923 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 68 treesize of output 63 [2018-12-02 08:31:55,924 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:55,925 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 08:31:55,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:55,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:55,949 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 62 treesize of output 59 [2018-12-02 08:31:55,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:55,952 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-02 08:31:55,952 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:55,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:55,966 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 36 treesize of output 45 [2018-12-02 08:31:55,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:55,969 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-02 08:31:55,969 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:55,973 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:55,975 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:55,979 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-02 08:31:55,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:56,001 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 107 [2018-12-02 08:31:56,348 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-12-02 08:31:56,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:56,352 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 80 treesize of output 79 [2018-12-02 08:31:56,353 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:56,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:56,356 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 80 treesize of output 79 [2018-12-02 08:31:56,356 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:56,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:56,359 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 80 treesize of output 79 [2018-12-02 08:31:56,360 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:56,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:56,824 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 71 treesize of output 74 [2018-12-02 08:31:56,825 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,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 69 treesize of output 63 [2018-12-02 08:31:57,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,123 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 35 treesize of output 36 [2018-12-02 08:31:57,123 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,136 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 34 treesize of output 43 [2018-12-02 08:31:57,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,140 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-02 08:31:57,141 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,144 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,149 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 81 [2018-12-02 08:31:57,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,346 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 72 treesize of output 65 [2018-12-02 08:31:57,346 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,394 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 49 treesize of output 56 [2018-12-02 08:31:57,395 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,441 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 46 treesize of output 55 [2018-12-02 08:31:57,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,444 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-02 08:31:57,444 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,450 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,483 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 50 [2018-12-02 08:31:57,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,486 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-02 08:31:57,486 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,491 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,500 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,503 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 70 treesize of output 66 [2018-12-02 08:31:57,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,506 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 36 treesize of output 27 [2018-12-02 08:31:57,507 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,519 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 34 treesize of output 43 [2018-12-02 08:31:57,521 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 23 treesize of output 19 [2018-12-02 08:31:57,521 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,525 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,530 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:57,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,555 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 70 treesize of output 96 [2018-12-02 08:31:57,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:57,566 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 73 treesize of output 68 [2018-12-02 08:31:57,566 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:58,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:58,001 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 53 treesize of output 60 [2018-12-02 08:31:58,002 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:58,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:58,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2018-12-02 08:31:58,388 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,083 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 50 treesize of output 59 [2018-12-02 08:31:59,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,086 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 23 treesize of output 16 [2018-12-02 08:31:59,086 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,093 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,239 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 61 treesize of output 81 [2018-12-02 08:31:59,241 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:31:59,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,262 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 117 [2018-12-02 08:31:59,263 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-12-02 08:31:59,311 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:31:59,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,400 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 45 treesize of output 54 [2018-12-02 08:31:59,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,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, 2 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-02 08:31:59,403 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,409 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,452 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 45 treesize of output 54 [2018-12-02 08:31:59,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,454 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 23 treesize of output 16 [2018-12-02 08:31:59,454 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,460 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,492 INFO L267 ElimStorePlain]: Start of recursive call 30: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,518 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,523 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 162 treesize of output 96 [2018-12-02 08:31:59,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,550 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 22 [2018-12-02 08:31:59,551 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,576 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 66 treesize of output 68 [2018-12-02 08:31:59,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,580 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-02 08:31:59,580 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-12-02 08:31:59,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,596 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-02 08:31:59,596 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,600 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,605 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,609 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 66 treesize of output 62 [2018-12-02 08:31:59,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,612 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 36 treesize of output 27 [2018-12-02 08:31:59,612 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,622 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 34 treesize of output 43 [2018-12-02 08:31:59,624 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 23 treesize of output 19 [2018-12-02 08:31:59,624 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,628 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,632 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,647 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 66 treesize of output 83 [2018-12-02 08:31:59,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,652 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 72 treesize of output 65 [2018-12-02 08:31:59,652 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,699 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-02 08:31:59,700 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,735 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 41 treesize of output 50 [2018-12-02 08:31:59,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,738 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 23 treesize of output 16 [2018-12-02 08:31:59,738 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,743 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,771 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 38 treesize of output 47 [2018-12-02 08:31:59,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:59,773 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 23 treesize of output 16 [2018-12-02 08:31:59,773 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,777 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,790 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,800 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:59,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:31:59,816 INFO L202 ElimStorePlain]: Needed 58 recursive calls to eliminate 4 variables, input treesize:204, output treesize:45 [2018-12-02 08:31:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:31:59,833 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 08:31:59,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-12-02 08:31:59,891 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand 6 states. Result 20 states and 27 transitions. Complement of second has 8 states. [2018-12-02 08:31:59,892 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-02 08:31:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 08:31:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-12-02 08:31:59,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 7 letters. [2018-12-02 08:31:59,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:59,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 7 letters. [2018-12-02 08:31:59,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:59,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 14 letters. [2018-12-02 08:31:59,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:59,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2018-12-02 08:31:59,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 08:31:59,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 17 transitions. [2018-12-02 08:31:59,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-02 08:31:59,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 08:31:59,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-12-02 08:31:59,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:31:59,896 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-02 08:31:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-12-02 08:31:59,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-02 08:31:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 08:31:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-12-02 08:31:59,897 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-02 08:31:59,897 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-02 08:31:59,897 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 08:31:59,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-12-02 08:31:59,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 08:31:59,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:59,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:59,898 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-02 08:31:59,898 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 08:31:59,898 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 248#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 249#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 256#L555-1 assume !test_fun_#t~short8; 255#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8; 252#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 253#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 258#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 251#L556-1 [2018-12-02 08:31:59,898 INFO L796 eck$LassoCheckResult]: Loop: 251#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 250#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 251#L556-1 [2018-12-02 08:31:59,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:59,898 INFO L82 PathProgramCache]: Analyzing trace with hash 179598440, now seen corresponding path program 1 times [2018-12-02 08:31:59,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:59,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:59,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:59,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:59,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 08:31:59,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:31:59,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:31:59,909 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 08:31:59,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:59,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 1 times [2018-12-02 08:31:59,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:59,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:59,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:59,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:59,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:59,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:31:59,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:31:59,986 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 08:31:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:31:59,991 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-12-02 08:31:59,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:31:59,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-12-02 08:31:59,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 08:31:59,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 15 transitions. [2018-12-02 08:31:59,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-02 08:31:59,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-12-02 08:31:59,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-12-02 08:31:59,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:31:59,992 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-02 08:31:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-12-02 08:31:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 08:31:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 08:31:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-02 08:31:59,993 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-02 08:31:59,993 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-02 08:31:59,993 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 08:31:59,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-12-02 08:31:59,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 08:31:59,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:59,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:59,994 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-02 08:31:59,994 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 08:31:59,994 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 281#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 282#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 288#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 290#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8; 291#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 293#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 292#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 284#L556-1 [2018-12-02 08:31:59,994 INFO L796 eck$LassoCheckResult]: Loop: 284#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 283#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 284#L556-1 [2018-12-02 08:31:59,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:59,994 INFO L82 PathProgramCache]: Analyzing trace with hash 177751398, now seen corresponding path program 1 times [2018-12-02 08:31:59,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:59,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:59,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:59,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:59,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:32:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:32:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:32:00,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:32:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 2 times [2018-12-02 08:32:00,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:32:00,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:32:00,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:32:00,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:32:00,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:32:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:32:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:32:00,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:32:00,013 INFO L82 PathProgramCache]: Analyzing trace with hash -979597471, now seen corresponding path program 2 times [2018-12-02 08:32:00,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:32:00,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:32:00,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:32:00,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:32:00,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:32:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:32:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:32:00,558 WARN L180 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 120 [2018-12-02 08:32:00,744 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-12-02 08:32:00,747 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 08:32:00,747 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 08:32:00,747 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 08:32:00,747 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 08:32:00,747 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 08:32:00,747 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 08:32:00,747 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 08:32:00,747 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 08:32:00,747 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.14-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-12-02 08:32:00,747 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 08:32:00,747 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 08:32:00,750 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-02 08:32:00,751 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-02 08:32:00,753 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-02 08:32:00,753 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-02 08:32:00,755 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-02 08:32:00,756 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-02 08:32:00,757 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-02 08:32:00,757 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-02 08:32:00,758 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-02 08:32:00,957 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-12-02 08:32:01,015 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-02 08:32:01,016 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-02 08:32:01,018 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-02 08:32:01,018 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-02 08:32:01,019 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-02 08:32:01,020 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-02 08:32:01,021 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-02 08:32:01,022 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-02 08:32:01,023 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-02 08:32:01,270 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 08:32:01,270 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 08:32:01,270 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-02 08:32:01,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:32:01,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:32:01,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:32:01,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:32:01,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:32:01,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:32:01,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:32:01,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:32:01,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:32:01,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:32:01,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:32:01,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:32:01,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:32:01,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:32:01,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:32:01,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:32:01,273 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-02 08:32:01,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:32:01,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:32:01,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:32:01,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:32:01,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:32:01,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:32:01,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:32:01,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:32:01,274 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-02 08:32:01,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:32:01,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:32:01,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:32:01,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:32:01,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:32:01,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:32:01,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:32:01,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:32:01,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:32:01,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:32:01,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:32:01,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:32:01,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:32:01,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:32:01,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:32:01,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:32:01,277 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-02 08:32:01,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:32:01,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:32:01,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:32:01,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:32:01,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:32:01,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:32:01,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:32:01,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:32:01,278 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-02 08:32:01,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:32:01,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:32:01,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:32:01,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:32:01,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:32:01,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:32:01,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:32:01,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:32:01,279 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-02 08:32:01,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:32:01,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:32:01,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:32:01,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:32:01,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:32:01,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:32:01,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:32:01,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:32:01,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:32:01,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:32:01,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:32:01,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:32:01,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:32:01,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:32:01,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:32:01,285 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-02 08:32:01,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:32:01,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:32:01,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:32:01,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:32:01,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:32:01,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:32:01,300 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 08:32:01,309 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 08:32:01,309 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 08:32:01,310 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 08:32:01,310 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 08:32:01,310 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 08:32:01,310 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1*ULTIMATE.start_test_fun_#t~mem9 >= 0] [2018-12-02 08:32:01,385 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2018-12-02 08:32:01,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 08:32:01,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:32:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:32:01,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:32:01,419 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-02 08:32:01,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:01,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:01,424 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-02 08:32:01,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:01,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:01,430 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-02 08:32:01,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-02 08:32:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:32:01,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:32:01,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:01,510 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 107 [2018-12-02 08:32:01,886 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-12-02 08:32:01,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:01,891 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 75 treesize of output 86 [2018-12-02 08:32:01,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:01,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:01,896 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 75 treesize of output 86 [2018-12-02 08:32:01,896 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:01,897 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 08:32:01,897 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,015 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 80 treesize of output 83 [2018-12-02 08:32:02,016 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,094 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 67 treesize of output 61 [2018-12-02 08:32:02,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,096 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-02 08:32:02,097 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,107 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 34 treesize of output 43 [2018-12-02 08:32:02,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,109 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-02 08:32:02,110 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,113 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,116 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,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, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 93 [2018-12-02 08:32:02,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,172 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:32:02,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,179 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-02 08:32:02,179 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,206 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 58 treesize of output 86 [2018-12-02 08:32:02,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,210 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 83 treesize of output 76 [2018-12-02 08:32:02,210 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 101 [2018-12-02 08:32:02,260 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 9 xjuncts. [2018-12-02 08:32:02,329 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 08:32:02,365 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 08:32:02,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,426 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 64 treesize of output 58 [2018-12-02 08:32:02,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,429 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-02 08:32:02,429 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,438 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 34 treesize of output 43 [2018-12-02 08:32:02,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,441 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-02 08:32:02,441 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,444 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,447 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,467 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 162 treesize of output 100 [2018-12-02 08:32:02,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,494 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 12 treesize of output 16 [2018-12-02 08:32:02,494 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,514 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 60 treesize of output 54 [2018-12-02 08:32:02,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,517 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-02 08:32:02,518 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-12-02 08:32:02,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,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, 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-02 08:32:02,529 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,532 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,534 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,537 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,540 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 164 treesize of output 92 [2018-12-02 08:32:02,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,568 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 68 treesize of output 66 [2018-12-02 08:32:02,569 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,570 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 08:32:02,570 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,573 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 68 treesize of output 66 [2018-12-02 08:32:02,573 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,595 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 62 treesize of output 59 [2018-12-02 08:32:02,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,599 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-02 08:32:02,599 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,609 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 36 treesize of output 45 [2018-12-02 08:32:02,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,611 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-02 08:32:02,612 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,616 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,618 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,622 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:32:02,636 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 4 variables, input treesize:204, output treesize:45 [2018-12-02 08:32:02,649 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-02 08:32:02,649 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 08:32:02,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-02 08:32:02,673 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 21 transitions. Complement of second has 5 states. [2018-12-02 08:32:02,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2018-12-02 08:32:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 08:32:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-12-02 08:32:02,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-02 08:32:02,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:32:02,674 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 08:32:02,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:32:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:32:02,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:32:02,699 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-02 08:32:02,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,704 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-02 08:32:02,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:02,709 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-02 08:32:02,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-02 08:32:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:32:02,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:32:02,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:02,777 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 107 [2018-12-02 08:32:03,205 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-12-02 08:32:03,206 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 08:32:03,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:03,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,210 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 87 [2018-12-02 08:32:03,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:03,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,214 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 87 [2018-12-02 08:32:03,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:03,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,343 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 71 treesize of output 82 [2018-12-02 08:32:03,343 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:03,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,445 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 1 case distinctions, treesize of input 80 treesize of output 93 [2018-12-02 08:32:03,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,449 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:32:03,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,458 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 96 [2018-12-02 08:32:03,459 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:03,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,497 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 58 treesize of output 86 [2018-12-02 08:32:03,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,504 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 83 treesize of output 76 [2018-12-02 08:32:03,504 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:03,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:03,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 101 [2018-12-02 08:32:03,733 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 9 xjuncts. [2018-12-02 08:32:03,989 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 08:32:04,130 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 08:32:04,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,349 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 68 treesize of output 62 [2018-12-02 08:32:04,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,354 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-02 08:32:04,354 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,373 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 34 treesize of output 43 [2018-12-02 08:32:04,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,377 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-02 08:32:04,377 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,382 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,387 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,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, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 76 [2018-12-02 08:32:04,446 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 73 treesize of output 65 [2018-12-02 08:32:04,447 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,489 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 47 treesize of output 46 [2018-12-02 08:32:04,489 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,533 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 52 treesize of output 80 [2018-12-02 08:32:04,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,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, 1 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-02 08:32:04,538 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,584 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 74 [2018-12-02 08:32:04,585 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 3 xjuncts. [2018-12-02 08:32:04,613 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 08:32:04,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,679 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 49 treesize of output 79 [2018-12-02 08:32:04,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,683 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 74 treesize of output 67 [2018-12-02 08:32:04,683 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,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 3 case distinctions, treesize of input 41 treesize of output 70 [2018-12-02 08:32:04,720 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts. [2018-12-02 08:32:04,744 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 08:32:04,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,781 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 50 [2018-12-02 08:32:04,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,783 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-02 08:32:04,783 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,790 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,815 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 08:32:04,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:32:04,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,835 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 164 treesize of output 92 [2018-12-02 08:32:04,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,871 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 68 treesize of output 66 [2018-12-02 08:32:04,871 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,874 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 68 treesize of output 66 [2018-12-02 08:32:04,874 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,875 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 08:32:04,875 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,897 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 62 treesize of output 59 [2018-12-02 08:32:04,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,900 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-02 08:32:04,900 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,908 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 36 treesize of output 45 [2018-12-02 08:32:04,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,910 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-02 08:32:04,910 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,913 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,916 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,919 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,925 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 162 treesize of output 100 [2018-12-02 08:32:04,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,952 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 12 treesize of output 16 [2018-12-02 08:32:04,952 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,967 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 60 treesize of output 54 [2018-12-02 08:32:04,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,969 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-02 08:32:04,969 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,978 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 34 treesize of output 43 [2018-12-02 08:32:04,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:32:04,980 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-02 08:32:04,980 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,983 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,985 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:04,988 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:05,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:32:05,007 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 4 variables, input treesize:204, output treesize:45 [2018-12-02 08:32:05,019 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-02 08:32:05,019 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 08:32:05,019 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-02 08:32:05,039 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 26 states and 31 transitions. Complement of second has 6 states. [2018-12-02 08:32:05,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 08:32:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 08:32:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-12-02 08:32:05,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-02 08:32:05,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:32:05,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-02 08:32:05,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:32:05,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-02 08:32:05,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:32:05,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-12-02 08:32:05,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 08:32:05,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2018-12-02 08:32:05,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-02 08:32:05,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-12-02 08:32:05,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-12-02 08:32:05,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:32:05,042 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-02 08:32:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-12-02 08:32:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-12-02 08:32:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 08:32:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-02 08:32:05,043 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-02 08:32:05,043 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-02 08:32:05,043 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 08:32:05,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-12-02 08:32:05,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 08:32:05,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:32:05,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:32:05,044 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2018-12-02 08:32:05,044 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 08:32:05,044 INFO L794 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 540#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 541#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 547#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 550#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8; 551#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 552#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 544#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 545#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 548#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 549#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 556#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8; 555#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 554#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 553#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 543#L556-1 [2018-12-02 08:32:05,044 INFO L796 eck$LassoCheckResult]: Loop: 543#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 542#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 543#L556-1 [2018-12-02 08:32:05,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:32:05,044 INFO L82 PathProgramCache]: Analyzing trace with hash -618569641, now seen corresponding path program 2 times [2018-12-02 08:32:05,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:32:05,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:32:05,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:32:05,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:32:05,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:32:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:32:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 08:32:05,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:32:05,068 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_233cee02-4c54-41ae-a797-6d139773b40f/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:32:05,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 08:32:05,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 08:32:05,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 08:32:05,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:32:05,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 08:32:05,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 08:32:05,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:32:05,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:05,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:32:05,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 08:32:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 08:32:05,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:32:05,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-02 08:32:05,134 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 08:32:05,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:32:05,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 3 times [2018-12-02 08:32:05,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:32:05,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:32:05,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:32:05,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:32:05,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:32:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:32:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:32:05,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:32:05,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:32:05,209 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-12-02 08:32:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:32:05,237 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-02 08:32:05,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:32:05,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2018-12-02 08:32:05,238 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 08:32:05,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2018-12-02 08:32:05,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 08:32:05,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 08:32:05,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 08:32:05,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 08:32:05,238 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 08:32:05,238 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 08:32:05,238 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 08:32:05,238 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 08:32:05,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 08:32:05,239 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 08:32:05,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 08:32:05,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 08:32:05 BoogieIcfgContainer [2018-12-02 08:32:05,243 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 08:32:05,243 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:32:05,243 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:32:05,243 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:32:05,243 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:31:54" (3/4) ... [2018-12-02 08:32:05,245 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 08:32:05,246 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:32:05,246 INFO L168 Benchmark]: Toolchain (without parser) took 11548.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 950.6 MB in the beginning and 976.1 MB in the end (delta: -25.5 MB). Peak memory consumption was 160.1 MB. Max. memory is 11.5 GB. [2018-12-02 08:32:05,247 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-02 08:32:05,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-02 08:32:05,247 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.18 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-02 08:32:05,247 INFO L168 Benchmark]: Boogie Preprocessor took 14.62 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-02 08:32:05,248 INFO L168 Benchmark]: RCFGBuilder took 160.07 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:32:05,248 INFO L168 Benchmark]: BuchiAutomizer took 11086.43 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 983.0 MB in the end (delta: 84.7 MB). Peak memory consumption was 168.6 MB. Max. memory is 11.5 GB. [2018-12-02 08:32:05,248 INFO L168 Benchmark]: Witness Printer took 2.87 ms. Allocated memory is still 1.2 GB. Free memory was 983.0 MB in the beginning and 976.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 08:32:05,249 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 256.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.18 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 14.62 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 160.07 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11086.43 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 983.0 MB in the end (delta: 84.7 MB). Peak memory consumption was 168.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.87 ms. Allocated memory is still 1.2 GB. Free memory was 983.0 MB in the beginning and 976.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.0s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 3.0s. Construction of modules took 0.0s. Büchi inclusion checks took 7.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 5. Nontrivial modules had stage [1, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 46 SDtfs, 20 SDslu, 29 SDs, 0 SdLazy, 84 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1351 mio100 ax102 hnf100 lsp96 ukn25 mio100 lsp36 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms 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...