./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/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 1a7013a4cfa859e3e95189f90d363983a25fcd0e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:53:17,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:53:17,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:53:17,696 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:53:17,696 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:53:17,697 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:53:17,698 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:53:17,699 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:53:17,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:53:17,701 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:53:17,701 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:53:17,702 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:53:17,702 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:53:17,703 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:53:17,704 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:53:17,704 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:53:17,705 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:53:17,706 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:53:17,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:53:17,708 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:53:17,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:53:17,710 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:53:17,712 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:53:17,712 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:53:17,712 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:53:17,713 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:53:17,713 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:53:17,714 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:53:17,714 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:53:17,715 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:53:17,715 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:53:17,716 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:53:17,716 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:53:17,716 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:53:17,717 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:53:17,717 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:53:17,717 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:53:17,726 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:53:17,727 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:53:17,727 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:53:17,728 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:53:17,728 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:53:17,728 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:53:17,728 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:53:17,728 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:53:17,728 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:53:17,728 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:53:17,728 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:53:17,729 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:53:17,729 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:53:17,729 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:53:17,729 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:53:17,729 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:53:17,729 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:53:17,729 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:53:17,730 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:53:17,730 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:53:17,730 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:53:17,730 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:53:17,730 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:53:17,730 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:53:17,730 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:53:17,731 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:53:17,731 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:53:17,731 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:53:17,732 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:53:17,732 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_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/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 -> 1a7013a4cfa859e3e95189f90d363983a25fcd0e [2018-11-28 11:53:17,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:53:17,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:53:17,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:53:17,763 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:53:17,763 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:53:17,764 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca_true-termination.c.i [2018-11-28 11:53:17,798 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/bin-2019/uautomizer/data/0a8561df4/decc3f6ce4af463db7714fcace50f9d4/FLAG33936423e [2018-11-28 11:53:18,232 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:53:18,233 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/sv-benchmarks/c/termination-memory-alloca/twisted-alloca_true-termination.c.i [2018-11-28 11:53:18,241 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/bin-2019/uautomizer/data/0a8561df4/decc3f6ce4af463db7714fcace50f9d4/FLAG33936423e [2018-11-28 11:53:18,249 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/bin-2019/uautomizer/data/0a8561df4/decc3f6ce4af463db7714fcace50f9d4 [2018-11-28 11:53:18,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:53:18,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:53:18,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:53:18,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:53:18,256 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:53:18,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:53:18" (1/1) ... [2018-11-28 11:53:18,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5143111f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:18, skipping insertion in model container [2018-11-28 11:53:18,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:53:18" (1/1) ... [2018-11-28 11:53:18,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:53:18,287 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:53:18,459 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:53:18,468 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:53:18,533 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:53:18,564 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:53:18,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:18 WrapperNode [2018-11-28 11:53:18,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:53:18,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:53:18,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:53:18,566 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:53:18,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:18" (1/1) ... [2018-11-28 11:53:18,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:18" (1/1) ... [2018-11-28 11:53:18,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:53:18,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:53:18,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:53:18,593 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:53:18,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:18" (1/1) ... [2018-11-28 11:53:18,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:18" (1/1) ... [2018-11-28 11:53:18,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:18" (1/1) ... [2018-11-28 11:53:18,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:18" (1/1) ... [2018-11-28 11:53:18,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:18" (1/1) ... [2018-11-28 11:53:18,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:18" (1/1) ... [2018-11-28 11:53:18,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:18" (1/1) ... [2018-11-28 11:53:18,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:53:18,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:53:18,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:53:18,609 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:53:18,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/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-11-28 11:53:18,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:53:18,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:53:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:53:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:53:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:53:18,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:53:18,874 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:53:18,874 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 11:53:18,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:53:18 BoogieIcfgContainer [2018-11-28 11:53:18,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:53:18,875 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:53:18,875 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:53:18,879 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:53:18,880 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:53:18,880 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:53:18" (1/3) ... [2018-11-28 11:53:18,881 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f5c7a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:53:18, skipping insertion in model container [2018-11-28 11:53:18,881 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:53:18,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:18" (2/3) ... [2018-11-28 11:53:18,881 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f5c7a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:53:18, skipping insertion in model container [2018-11-28 11:53:18,882 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:53:18,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:53:18" (3/3) ... [2018-11-28 11:53:18,883 INFO L375 chiAutomizerObserver]: Analyzing ICFG twisted-alloca_true-termination.c.i [2018-11-28 11:53:18,926 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:53:18,927 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:53:18,927 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:53:18,927 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:53:18,927 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:53:18,927 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:53:18,928 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:53:18,928 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:53:18,928 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:53:18,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 11:53:18,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:53:18,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:18,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:18,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:53:18,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:53:18,961 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:53:18,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 11:53:18,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:53:18,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:18,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:18,963 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:53:18,963 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:53:18,970 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 3#L569true [2018-11-28 11:53:18,970 INFO L796 eck$LassoCheckResult]: Loop: 3#L569true assume !true; 8#L564true goto; 4#L567true call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 11#L564-1true assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 6#L566true assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 3#L569true [2018-11-28 11:53:18,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:18,975 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 11:53:18,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:18,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:19,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:19,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:19,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:19,097 INFO L82 PathProgramCache]: Analyzing trace with hash 46885240, now seen corresponding path program 1 times [2018-11-28 11:53:19,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:19,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:19,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:19,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:19,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:19,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-28 11:53:19,121 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:19,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:53:19,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:53:19,131 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-28 11:53:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:19,135 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-28 11:53:19,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:53:19,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-28 11:53:19,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:53:19,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-11-28 11:53:19,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 11:53:19,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 11:53:19,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-28 11:53:19,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:19,141 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 11:53:19,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-28 11:53:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 11:53:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 11:53:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 11:53:19,165 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 11:53:19,165 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 11:53:19,165 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:53:19,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-28 11:53:19,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:53:19,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:19,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:19,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:53:19,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:19,166 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 39#L569 [2018-11-28 11:53:19,166 INFO L796 eck$LassoCheckResult]: Loop: 39#L569 goto; 42#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 46#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; 40#L564 goto; 41#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 44#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 45#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 39#L569 [2018-11-28 11:53:19,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:19,167 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 11:53:19,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:19,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:19,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:19,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:19,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1311753714, now seen corresponding path program 1 times [2018-11-28 11:53:19,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:19,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:19,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:19,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:19,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:19,225 INFO L82 PathProgramCache]: Analyzing trace with hash 234543116, now seen corresponding path program 1 times [2018-11-28 11:53:19,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:19,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:19,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:19,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:19,473 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-11-28 11:53:19,780 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2018-11-28 11:53:19,906 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-28 11:53:19,914 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:19,915 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:19,915 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:19,915 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:19,916 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:53:19,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:19,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:19,916 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:19,916 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 11:53:19,916 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:19,916 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:19,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:19,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:19,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:19,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:19,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:19,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:19,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:19,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:19,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:19,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:19,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:20,283 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2018-11-28 11:53:20,394 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2018-11-28 11:53:20,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:20,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:20,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:20,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:20,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:20,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:20,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:20,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:20,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:20,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:20,804 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:20,808 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:53:20,810 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-11-28 11:53:20,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:20,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:20,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:20,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,817 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-11-28 11:53:20,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:20,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:20,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:20,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,820 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-11-28 11:53:20,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:20,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:20,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:20,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,827 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-11-28 11:53:20,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:20,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:20,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,832 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-11-28 11:53:20,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:20,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:20,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,837 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-11-28 11:53:20,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:20,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:20,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,844 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-11-28 11:53:20,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:20,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:20,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:20,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,848 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-11-28 11:53:20,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:20,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:20,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,853 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-11-28 11:53:20,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:20,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:20,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:20,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,855 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-11-28 11:53:20,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:20,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:20,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:20,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,857 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-11-28 11:53:20,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:20,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:20,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:20,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,870 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:53:20,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,871 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:53:20,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:20,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,876 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-11-28 11:53:20,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:20,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:20,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,880 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-11-28 11:53:20,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:20,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:20,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,885 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-11-28 11:53:20,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,886 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:53:20,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,887 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:53:20,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:20,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,895 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-11-28 11:53:20,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:20,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:20,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,919 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-11-28 11:53:20,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:20,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:20,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:20,924 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-11-28 11:53:20,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:20,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:20,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:20,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:20,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:20,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:20,930 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:53:20,936 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:53:20,936 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:53:20,938 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:53:20,939 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:53:20,939 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:53:20,940 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1 + 1 Supporting invariants [] [2018-11-28 11:53:21,051 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-28 11:53:21,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:53:21,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:21,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:21,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:21,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:21,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-28 11:53:21,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:21,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-28 11:53:21,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:21,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:21,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:21,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-11-28 11:53:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:21,157 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:53:21,157 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-28 11:53:21,187 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 20 states and 27 transitions. Complement of second has 6 states. [2018-11-28 11:53:21,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:53:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:53:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 11:53:21,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-28 11:53:21,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:21,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-28 11:53:21,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:21,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-28 11:53:21,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:21,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2018-11-28 11:53:21,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:53:21,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 21 transitions. [2018-11-28 11:53:21,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 11:53:21,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 11:53:21,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-11-28 11:53:21,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:53:21,196 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-28 11:53:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-11-28 11:53:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 11:53:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 11:53:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-28 11:53:21,198 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 11:53:21,198 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 11:53:21,198 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:53:21,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-28 11:53:21,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:53:21,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:21,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:21,199 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:53:21,199 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:53:21,199 INFO L794 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 267#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 268#L569 goto; 272#L560 [2018-11-28 11:53:21,199 INFO L796 eck$LassoCheckResult]: Loop: 272#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 278#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 279#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 272#L560 [2018-11-28 11:53:21,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:21,199 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-28 11:53:21,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:21,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:21,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:21,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:21,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:21,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:21,217 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2018-11-28 11:53:21,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:21,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:21,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:21,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:21,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:21,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:21,226 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2018-11-28 11:53:21,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:21,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:21,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:21,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:21,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:21,640 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 103 [2018-11-28 11:53:21,767 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-11-28 11:53:21,769 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:21,769 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:21,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:21,769 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:21,769 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:53:21,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:21,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:21,769 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:21,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 11:53:21,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:21,770 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:21,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:21,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:21,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:21,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:21,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:21,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:21,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:21,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:21,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:21,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:21,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:21,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:21,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:21,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:22,032 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2018-11-28 11:53:22,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:22,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:22,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:22,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:22,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:22,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:22,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:22,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:22,463 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:22,463 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:53:22,463 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-11-28 11:53:22,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:22,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:22,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:22,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:22,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:22,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:22,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:22,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:22,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:22,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,472 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-11-28 11:53:22,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,478 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-11-28 11:53:22,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:22,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:22,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:22,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,480 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-11-28 11:53:22,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:22,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:22,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:22,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,482 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-11-28 11:53:22,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,484 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-11-28 11:53:22,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:22,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:22,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:22,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:22,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:22,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:22,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,488 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-11-28 11:53:22,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:22,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:22,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:22,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,495 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-11-28 11:53:22,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:22,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:22,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:22,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,497 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:53:22,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,498 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:53:22,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,509 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-11-28 11:53:22,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,514 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:53:22,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,515 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:53:22,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,526 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:53:22,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,527 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:53:22,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,531 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:53:22,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,532 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:53:22,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,539 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-11-28 11:53:22,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:22,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,556 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-11-28 11:53:22,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,561 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-11-28 11:53:22,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,573 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-11-28 11:53:22,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:22,576 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-11-28 11:53:22,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:22,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:22,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:22,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:22,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:22,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:22,586 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:53:22,594 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:53:22,594 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:53:22,595 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:53:22,595 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:53:22,596 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:53:22,596 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2 Supporting invariants [] [2018-11-28 11:53:22,709 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-11-28 11:53:22,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:53:22,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:53:22,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:22,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:22,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:22,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:22,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-11-28 11:53:22,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:22,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-28 11:53:22,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:22,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:22,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:22,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:22,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-11-28 11:53:22,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:22,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:53:22,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:53:22,855 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-28 11:53:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:22,878 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:53:22,878 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-28 11:53:22,901 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 34 states and 43 transitions. Complement of second has 7 states. [2018-11-28 11:53:22,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:53:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:53:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 11:53:22,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-28 11:53:22,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:22,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 11:53:22,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:22,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-28 11:53:22,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:22,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2018-11-28 11:53:22,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:53:22,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2018-11-28 11:53:22,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 11:53:22,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 11:53:22,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2018-11-28 11:53:22,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:53:22,906 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-28 11:53:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2018-11-28 11:53:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-28 11:53:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 11:53:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-11-28 11:53:22,908 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-28 11:53:22,908 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-28 11:53:22,908 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:53:22,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-11-28 11:53:22,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:53:22,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:22,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:22,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:22,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:53:22,912 INFO L794 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 505#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 506#L569 goto; 507#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 515#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; 503#L564 goto; 504#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 510#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 511#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 516#L569 goto; 517#L560 [2018-11-28 11:53:22,912 INFO L796 eck$LassoCheckResult]: Loop: 517#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 513#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 514#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 517#L560 [2018-11-28 11:53:22,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:22,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1319097990, now seen corresponding path program 2 times [2018-11-28 11:53:22,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:22,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:22,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:22,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:22,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:22,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2018-11-28 11:53:22,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:22,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:22,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:22,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:22,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:22,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:22,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1702545424, now seen corresponding path program 1 times [2018-11-28 11:53:22,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:22,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:22,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:22,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:22,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:23,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:53:23,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/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-11-28 11:53:23,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:23,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:23,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-28 11:53:23,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-28 11:53:23,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:23,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:23,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:23,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-28 11:53:23,089 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:23,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:23,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:23,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:23,104 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-11-28 11:53:23,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:23,138 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 42 [2018-11-28 11:53:23,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:23,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:53:23,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:23,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:23,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:23,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-11-28 11:53:23,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 11:53:23,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-28 11:53:23,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:53:23,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:23,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:23,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-28 11:53:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:23,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:53:23,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-11-28 11:53:23,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:53:23,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:53:23,323 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-11-28 11:53:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:23,438 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-28 11:53:23,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:53:23,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2018-11-28 11:53:23,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:53:23,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 19 states and 23 transitions. [2018-11-28 11:53:23,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 11:53:23,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 11:53:23,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-11-28 11:53:23,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:53:23,441 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-28 11:53:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-11-28 11:53:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-11-28 11:53:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 11:53:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 11:53:23,442 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 11:53:23,442 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 11:53:23,442 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:53:23,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-28 11:53:23,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:53:23,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:23,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:23,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:23,443 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:53:23,444 INFO L794 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 611#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 612#L569 goto; 613#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 620#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 621#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 609#L564 goto; 610#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 615#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 616#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 622#L569 goto; 623#L560 [2018-11-28 11:53:23,444 INFO L796 eck$LassoCheckResult]: Loop: 623#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 618#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 619#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 623#L560 [2018-11-28 11:53:23,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:23,444 INFO L82 PathProgramCache]: Analyzing trace with hash -635175977, now seen corresponding path program 1 times [2018-11-28 11:53:23,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:23,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:23,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:23,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:23,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:23,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:53:23,515 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:53:23,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:23,515 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2018-11-28 11:53:23,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:23,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:23,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:23,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:23,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:53:23,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:53:23,613 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-28 11:53:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:23,637 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-28 11:53:23,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:53:23,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-28 11:53:23,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:53:23,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-11-28 11:53:23,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 11:53:23,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 11:53:23,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-28 11:53:23,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:53:23,641 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 11:53:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-28 11:53:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-28 11:53:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 11:53:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-28 11:53:23,642 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 11:53:23,642 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 11:53:23,642 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:53:23,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-28 11:53:23,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:53:23,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:23,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:23,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:23,643 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:53:23,644 INFO L794 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 653#L569 goto; 654#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 662#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 663#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 656#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 667#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 666#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 650#L564 goto; 651#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 657#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 658#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 664#L569 goto; 665#L560 [2018-11-28 11:53:23,644 INFO L796 eck$LassoCheckResult]: Loop: 665#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 660#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 661#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 665#L560 [2018-11-28 11:53:23,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:23,644 INFO L82 PathProgramCache]: Analyzing trace with hash 184869755, now seen corresponding path program 1 times [2018-11-28 11:53:23,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:23,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:23,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:23,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:23,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:23,675 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2018-11-28 11:53:23,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:23,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:23,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:23,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:23,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:23,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1306804847, now seen corresponding path program 2 times [2018-11-28 11:53:23,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:23,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:23,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:23,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:25,036 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 193 DAG size of output: 149 [2018-11-28 11:53:25,343 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-11-28 11:53:25,345 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:25,345 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:25,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:25,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:25,345 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:53:25,346 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:25,346 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:25,346 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:25,346 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-28 11:53:25,346 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:25,346 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:25,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,732 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2018-11-28 11:53:25,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:26,133 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:26,133 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:53:26,133 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-11-28 11:53:26,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:26,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,135 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-11-28 11:53:26,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:26,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,136 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-11-28 11:53:26,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:26,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,142 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-11-28 11:53:26,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:26,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,143 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-11-28 11:53:26,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:26,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,144 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-11-28 11:53:26,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:26,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,146 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-11-28 11:53:26,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:26,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,149 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-11-28 11:53:26,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:26,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:26,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,155 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-11-28 11:53:26,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:26,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,159 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-11-28 11:53:26,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:26,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:26,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,166 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-11-28 11:53:26,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,166 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:53:26,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,167 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:53:26,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,170 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-11-28 11:53:26,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:26,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,173 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:53:26,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,173 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:53:26,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,176 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-11-28 11:53:26,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:26,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:26,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:26,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,188 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-11-28 11:53:26,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,189 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:53:26,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,190 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:53:26,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,193 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-11-28 11:53:26,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:26,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:53:26,204 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:53:26,209 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:53:26,209 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:53:26,210 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:53:26,210 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:53:26,210 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:53:26,211 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3 Supporting invariants [] [2018-11-28 11:53:26,332 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-11-28 11:53:26,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:53:26,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:53:26,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:26,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:26,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:26,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:26,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-11-28 11:53:26,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:26,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-28 11:53:26,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:26,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:26,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:26,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:26,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-11-28 11:53:26,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:26,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:53:26,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:53:26,447 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-28 11:53:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:26,463 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:53:26,463 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-28 11:53:26,476 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2018-11-28 11:53:26,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:53:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:53:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 11:53:26,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 11:53:26,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:26,477 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:53:26,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:26,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:26,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:26,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:26,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-11-28 11:53:26,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:26,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-28 11:53:26,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:26,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:26,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:26,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:26,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-11-28 11:53:26,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:26,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:53:26,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:53:26,578 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-28 11:53:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:26,594 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:53:26,594 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-28 11:53:26,621 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 51 states and 59 transitions. Complement of second has 9 states. [2018-11-28 11:53:26,622 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-11-28 11:53:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:53:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-28 11:53:26,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 11:53:26,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:26,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-28 11:53:26,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:26,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 11:53:26,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:53:26,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2018-11-28 11:53:26,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:53:26,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 37 states and 43 transitions. [2018-11-28 11:53:26,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 11:53:26,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 11:53:26,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2018-11-28 11:53:26,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:53:26,625 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-28 11:53:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2018-11-28 11:53:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-28 11:53:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 11:53:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-28 11:53:26,628 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-28 11:53:26,628 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-28 11:53:26,628 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:53:26,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2018-11-28 11:53:26,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:53:26,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:26,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:26,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:26,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:53:26,629 INFO L794 eck$LassoCheckResult]: Stem: 1058#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1051#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 1052#L569 goto; 1053#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1075#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1068#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1069#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1083#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1082#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 1081#L564 goto; 1079#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1056#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1057#L566 assume 0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2);havoc f_#t~mem14; 1072#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1074#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~post13;havoc f_#t~mem12;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1071#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 1070#L569 goto; 1066#L560 [2018-11-28 11:53:26,629 INFO L796 eck$LassoCheckResult]: Loop: 1066#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1060#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1061#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1066#L560 [2018-11-28 11:53:26,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:26,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1305515858, now seen corresponding path program 1 times [2018-11-28 11:53:26,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:26,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:26,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:26,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:26,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:53:26,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:53:26,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f2e15fe-edd4-40ea-9411-ee99c8c0dd3b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:53:26,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:26,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:26,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-28 11:53:26,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-28 11:53:26,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:26,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:26,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:53:26,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-28 11:53:26,744 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:26,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:26,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:26,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:26,762 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 [2018-11-28 11:53:26,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 18 treesize of output 14 [2018-11-28 11:53:26,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-11-28 11:53:26,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:53:26,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:26,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:53:26,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:6 [2018-11-28 11:53:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 11:53:26,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:53:26,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-28 11:53:26,861 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:53:26,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:26,861 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 5 times [2018-11-28 11:53:26,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:26,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:26,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:26,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:26,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:26,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:53:26,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:53:26,942 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand 11 states. [2018-11-28 11:53:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:27,035 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-28 11:53:27,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:53:27,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 38 transitions. [2018-11-28 11:53:27,036 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:53:27,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-11-28 11:53:27,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:53:27,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:53:27,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:53:27,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:27,036 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:27,036 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:27,036 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:27,036 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:53:27,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:53:27,037 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:53:27,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:53:27,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:53:27 BoogieIcfgContainer [2018-11-28 11:53:27,043 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:53:27,043 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:53:27,043 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:53:27,044 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:53:27,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:53:18" (3/4) ... [2018-11-28 11:53:27,047 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:53:27,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:53:27,048 INFO L168 Benchmark]: Toolchain (without parser) took 8795.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.2 MB). Free memory was 949.9 MB in the beginning and 964.8 MB in the end (delta: -14.8 MB). Peak memory consumption was 302.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:27,048 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:53:27,049 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:27,049 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:27,050 INFO L168 Benchmark]: Boogie Preprocessor took 15.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:53:27,050 INFO L168 Benchmark]: RCFGBuilder took 266.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:27,051 INFO L168 Benchmark]: BuchiAutomizer took 8167.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 964.8 MB in the end (delta: 127.7 MB). Peak memory consumption was 307.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:27,051 INFO L168 Benchmark]: Witness Printer took 3.90 ms. Allocated memory is still 1.3 GB. Free memory is still 964.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:53:27,053 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 266.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8167.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 964.8 MB in the end (delta: 127.7 MB). Peak memory consumption was 307.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.90 ms. Allocated memory is still 1.3 GB. Free memory is still 964.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[k_ref][k_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[k_ref][k_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 6. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 74 SDtfs, 60 SDslu, 134 SDs, 0 SdLazy, 170 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital879 mio100 ax103 hnf100 lsp94 ukn41 mio100 lsp36 div100 bol100 ite100 ukn100 eq183 hnf88 smp93 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 2 VariablesLoop: 0 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...