./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_12495aad-c5da-49e9-9420-22c439028472/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_12495aad-c5da-49e9-9420-22c439028472/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_12495aad-c5da-49e9-9420-22c439028472/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_12495aad-c5da-49e9-9420-22c439028472/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_12495aad-c5da-49e9-9420-22c439028472/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_12495aad-c5da-49e9-9420-22c439028472/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 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 18:02:18,028 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 18:02:18,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 18:02:18,038 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 18:02:18,038 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 18:02:18,039 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 18:02:18,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 18:02:18,041 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 18:02:18,042 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 18:02:18,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 18:02:18,043 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 18:02:18,043 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 18:02:18,044 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 18:02:18,044 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 18:02:18,045 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 18:02:18,046 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 18:02:18,046 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 18:02:18,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 18:02:18,049 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 18:02:18,050 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 18:02:18,050 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 18:02:18,051 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 18:02:18,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 18:02:18,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 18:02:18,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 18:02:18,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 18:02:18,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 18:02:18,055 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 18:02:18,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 18:02:18,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 18:02:18,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 18:02:18,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 18:02:18,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 18:02:18,057 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 18:02:18,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 18:02:18,058 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 18:02:18,058 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_12495aad-c5da-49e9-9420-22c439028472/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 18:02:18,069 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 18:02:18,069 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 18:02:18,070 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 18:02:18,070 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 18:02:18,070 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 18:02:18,071 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 18:02:18,071 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 18:02:18,071 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 18:02:18,071 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 18:02:18,071 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 18:02:18,071 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 18:02:18,071 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 18:02:18,072 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 18:02:18,072 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 18:02:18,072 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 18:02:18,072 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 18:02:18,072 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 18:02:18,072 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 18:02:18,072 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 18:02:18,072 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 18:02:18,073 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 18:02:18,073 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 18:02:18,073 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 18:02:18,073 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 18:02:18,073 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 18:02:18,073 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 18:02:18,073 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 18:02:18,073 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 18:02:18,074 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 18:02:18,074 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_12495aad-c5da-49e9-9420-22c439028472/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 -> 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 [2018-12-01 18:02:18,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 18:02:18,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 18:02:18,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 18:02:18,106 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 18:02:18,106 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 18:02:18,106 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_12495aad-c5da-49e9-9420-22c439028472/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i [2018-12-01 18:02:18,145 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_12495aad-c5da-49e9-9420-22c439028472/bin-2019/uautomizer/data/3d48962ed/4673c497958545a982573e933a732074/FLAG4095cf423 [2018-12-01 18:02:18,466 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 18:02:18,467 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_12495aad-c5da-49e9-9420-22c439028472/sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i [2018-12-01 18:02:18,473 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_12495aad-c5da-49e9-9420-22c439028472/bin-2019/uautomizer/data/3d48962ed/4673c497958545a982573e933a732074/FLAG4095cf423 [2018-12-01 18:02:18,876 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_12495aad-c5da-49e9-9420-22c439028472/bin-2019/uautomizer/data/3d48962ed/4673c497958545a982573e933a732074 [2018-12-01 18:02:18,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 18:02:18,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 18:02:18,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 18:02:18,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 18:02:18,882 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 18:02:18,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:02:18" (1/1) ... [2018-12-01 18:02:18,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ceaa519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:02:18, skipping insertion in model container [2018-12-01 18:02:18,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:02:18" (1/1) ... [2018-12-01 18:02:18,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 18:02:18,907 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 18:02:19,046 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:02:19,052 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 18:02:19,116 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:02:19,138 INFO L195 MainTranslator]: Completed translation [2018-12-01 18:02:19,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:02:19 WrapperNode [2018-12-01 18:02:19,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 18:02:19,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 18:02:19,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 18:02:19,139 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 18:02:19,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:02:19" (1/1) ... [2018-12-01 18:02:19,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:02:19" (1/1) ... [2018-12-01 18:02:19,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 18:02:19,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 18:02:19,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 18:02:19,169 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 18:02:19,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:02:19" (1/1) ... [2018-12-01 18:02:19,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:02:19" (1/1) ... [2018-12-01 18:02:19,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:02:19" (1/1) ... [2018-12-01 18:02:19,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:02:19" (1/1) ... [2018-12-01 18:02:19,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:02:19" (1/1) ... [2018-12-01 18:02:19,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:02:19" (1/1) ... [2018-12-01 18:02:19,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:02:19" (1/1) ... [2018-12-01 18:02:19,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 18:02:19,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 18:02:19,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 18:02:19,187 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 18:02:19,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:02:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_12495aad-c5da-49e9-9420-22c439028472/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:02:19,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 18:02:19,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 18:02:19,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 18:02:19,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 18:02:19,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 18:02:19,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 18:02:19,366 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 18:02:19,366 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-01 18:02:19,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:02:19 BoogieIcfgContainer [2018-12-01 18:02:19,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 18:02:19,367 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 18:02:19,367 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 18:02:19,369 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 18:02:19,370 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:02:19,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 06:02:18" (1/3) ... [2018-12-01 18:02:19,370 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78a5cd70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 06:02:19, skipping insertion in model container [2018-12-01 18:02:19,370 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:02:19,371 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:02:19" (2/3) ... [2018-12-01 18:02:19,371 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78a5cd70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 06:02:19, skipping insertion in model container [2018-12-01 18:02:19,371 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:02:19,371 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:02:19" (3/3) ... [2018-12-01 18:02:19,372 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.11-alloca_true-termination_true-no-overflow.c.i [2018-12-01 18:02:19,402 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 18:02:19,403 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 18:02:19,403 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 18:02:19,403 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 18:02:19,403 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 18:02:19,403 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 18:02:19,403 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 18:02:19,403 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 18:02:19,403 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 18:02:19,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-01 18:02:19,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-01 18:02:19,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:02:19,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:02:19,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 18:02:19,428 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:02:19,428 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 18:02:19,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-01 18:02:19,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-01 18:02:19,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:02:19,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:02:19,429 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 18:02:19,429 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:02:19,434 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 5#L559-2true [2018-12-01 18:02:19,434 INFO L796 eck$LassoCheckResult]: Loop: 5#L559-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 10#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 14#L555-3true test_fun_#t~short13 := test_fun_#t~short8; 16#L555-4true assume test_fun_#t~short13; 6#L555-9true test_fun_#t~short16 := test_fun_#t~short13; 8#L555-10true assume !test_fun_#t~short16; 11#L555-12true assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~short16;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 7#L556true assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; 5#L559-2true [2018-12-01 18:02:19,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:19,438 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-01 18:02:19,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:19,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:19,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:19,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:19,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:19,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:19,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1790206705, now seen corresponding path program 1 times [2018-12-01 18:02:19,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:19,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:19,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:19,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:19,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:02:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:02:19,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:02:19,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:02:19,558 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 18:02:19,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:02:19,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:02:19,568 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2018-12-01 18:02:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:02:19,606 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-12-01 18:02:19,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 18:02:19,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-01 18:02:19,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-01 18:02:19,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2018-12-01 18:02:19,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-01 18:02:19,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-01 18:02:19,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-12-01 18:02:19,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:02:19,612 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-01 18:02:19,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-12-01 18:02:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-12-01 18:02:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-01 18:02:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-12-01 18:02:19,629 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-12-01 18:02:19,629 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-12-01 18:02:19,629 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 18:02:19,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-12-01 18:02:19,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 18:02:19,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:02:19,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:02:19,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 18:02:19,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:02:19,630 INFO L794 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 61#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 53#L559-2 [2018-12-01 18:02:19,631 INFO L796 eck$LassoCheckResult]: Loop: 53#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 54#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 60#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 63#L555-4 assume test_fun_#t~short13; 64#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 58#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 59#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~short16;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 56#L556 assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; 53#L559-2 [2018-12-01 18:02:19,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:19,631 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-01 18:02:19,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:19,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:19,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:19,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:19,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:19,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:19,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1790208627, now seen corresponding path program 1 times [2018-12-01 18:02:19,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:19,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:19,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:02:19,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:19,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:19,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1099647153, now seen corresponding path program 1 times [2018-12-01 18:02:19,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:19,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:19,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:19,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:19,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:19,816 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2018-12-01 18:02:20,008 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-12-01 18:02:20,089 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:02:20,090 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:02:20,090 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:02:20,090 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:02:20,091 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 18:02:20,091 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:02:20,091 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:02:20,091 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:02:20,092 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-12-01 18:02:20,092 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:02:20,092 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:02:20,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,301 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-12-01 18:02:20,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,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-12-01 18:02:20,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-12-01 18:02:20,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-12-01 18:02:20,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-12-01 18:02:20,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-12-01 18:02:20,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:20,667 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:02:20,670 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 18:02:20,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:20,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:20,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:20,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:20,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:20,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:20,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:20,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:20,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:20,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:20,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:20,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:20,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:20,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:20,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:20,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:20,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:20,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:20,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:20,754 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 18:02:20,764 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 18:02:20,765 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-01 18:02:20,766 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 18:02:20,767 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 18:02:20,767 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 18:02:20,768 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-12-01 18:02:20,814 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-12-01 18:02:20,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 18:02:20,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:02:20,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:02:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:02:20,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:02:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:02:20,891 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-01 18:02:20,891 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-01 18:02:20,966 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 31 states and 45 transitions. Complement of second has 8 states. [2018-12-01 18:02:20,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 18:02:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 18:02:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-01 18:02:20,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-01 18:02:20,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:02:20,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2018-12-01 18:02:20,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:02:20,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2018-12-01 18:02:20,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:02:20,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2018-12-01 18:02:20,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 18:02:20,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2018-12-01 18:02:20,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-01 18:02:20,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-01 18:02:20,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2018-12-01 18:02:20,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:02:20,974 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-12-01 18:02:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2018-12-01 18:02:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-01 18:02:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-01 18:02:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-12-01 18:02:20,976 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-12-01 18:02:20,976 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-12-01 18:02:20,976 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 18:02:20,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 43 transitions. [2018-12-01 18:02:20,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 18:02:20,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:02:20,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:02:20,977 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 18:02:20,977 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:02:20,977 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 256#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 257#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 240#L555-1 [2018-12-01 18:02:20,977 INFO L796 eck$LassoCheckResult]: Loop: 240#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 254#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 259#L555-4 assume test_fun_#t~short13; 243#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 244#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 251#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~short16;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 246#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 247#L559 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem21;havoc test_fun_#t~mem20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23; 239#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 240#L555-1 [2018-12-01 18:02:20,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:20,978 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-01 18:02:20,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:20,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:20,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:20,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:20,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:20,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash 572463690, now seen corresponding path program 1 times [2018-12-01 18:02:20,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:20,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:20,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:20,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:20,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:21,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:21,015 INFO L82 PathProgramCache]: Analyzing trace with hash -198955769, now seen corresponding path program 1 times [2018-12-01 18:02:21,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:21,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:21,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:21,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:21,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:21,171 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2018-12-01 18:02:21,454 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-12-01 18:02:21,662 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-12-01 18:02:21,665 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:02:21,665 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:02:21,665 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:02:21,665 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:02:21,665 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 18:02:21,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:02:21,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:02:21,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:02:21,665 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-01 18:02:21,665 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:02:21,665 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:02:21,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:21,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:22,094 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-12-01 18:02:22,234 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-12-01 18:02:22,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:22,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:22,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:22,721 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:02:22,721 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 18:02:22,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:22,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:22,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:22,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:22,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:22,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:22,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:22,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:22,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:22,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:22,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:22,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:22,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,772 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 18:02:22,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,772 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:02:22,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:22,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,778 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 18:02:22,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,779 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:02:22,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:22,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:22,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,785 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 18:02:22,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:22,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,785 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:02:22,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:22,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:22,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:22,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:22,788 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 18:02:22,788 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:02:22,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:22,791 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-01 18:02:22,791 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-01 18:02:22,824 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 18:02:22,850 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 18:02:22,851 INFO L444 ModelExtractionUtils]: 48 out of 56 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-01 18:02:22,851 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 18:02:22,852 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-01 18:02:22,852 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 18:02:22,852 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-12-01 18:02:22,907 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-12-01 18:02:22,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 18:02:22,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:02:22,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:02:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:02:22,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:02:22,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 18:02:22,997 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 49 treesize of output 61 [2018-12-01 18:02:23,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 18:02:23,003 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 52 treesize of output 39 [2018-12-01 18:02:23,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 18:02:23,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 18:02:23,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 49 [2018-12-01 18:02:23,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 18:02:23,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 18:02:23,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 18:02:23,069 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2018-12-01 18:02:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:02:23,084 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-01 18:02:23,084 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15 Second operand 7 states. [2018-12-01 18:02:23,181 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15. Second operand 7 states. Result 64 states and 97 transitions. Complement of second has 10 states. [2018-12-01 18:02:23,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-01 18:02:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 18:02:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-12-01 18:02:23,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 9 letters. [2018-12-01 18:02:23,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:02:23,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 12 letters. Loop has 9 letters. [2018-12-01 18:02:23,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:02:23,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 18 letters. [2018-12-01 18:02:23,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:02:23,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 97 transitions. [2018-12-01 18:02:23,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 18:02:23,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 97 transitions. [2018-12-01 18:02:23,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-01 18:02:23,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-01 18:02:23,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 97 transitions. [2018-12-01 18:02:23,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:02:23,186 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 97 transitions. [2018-12-01 18:02:23,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 97 transitions. [2018-12-01 18:02:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-01 18:02:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-01 18:02:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2018-12-01 18:02:23,189 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-12-01 18:02:23,189 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-12-01 18:02:23,189 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 18:02:23,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 94 transitions. [2018-12-01 18:02:23,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 18:02:23,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:02:23,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:02:23,191 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 18:02:23,191 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:02:23,191 INFO L794 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 513#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 514#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 552#L555-1 assume !test_fun_#t~short8; 516#L555-3 [2018-12-01 18:02:23,192 INFO L796 eck$LassoCheckResult]: Loop: 516#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 517#L555-4 assume test_fun_#t~short13; 519#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 507#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 508#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~short16;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 502#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 503#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem21;havoc test_fun_#t~mem20;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 495#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 496#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 516#L555-3 [2018-12-01 18:02:23,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:23,192 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-12-01 18:02:23,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:23,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:23,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:23,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:23,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:23,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:23,202 INFO L82 PathProgramCache]: Analyzing trace with hash -162891098, now seen corresponding path program 1 times [2018-12-01 18:02:23,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:23,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:23,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:23,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:23,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:23,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2029276831, now seen corresponding path program 1 times [2018-12-01 18:02:23,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:23,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:23,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:23,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:23,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:02:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:02:23,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:02:23,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:02:23,364 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2018-12-01 18:02:23,478 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-12-01 18:02:23,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:02:23,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:02:23,478 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. cyclomatic complexity: 36 Second operand 4 states. [2018-12-01 18:02:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:02:23,495 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2018-12-01 18:02:23,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 18:02:23,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 130 transitions. [2018-12-01 18:02:23,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-12-01 18:02:23,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 130 transitions. [2018-12-01 18:02:23,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-01 18:02:23,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-01 18:02:23,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2018-12-01 18:02:23,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:02:23,497 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2018-12-01 18:02:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2018-12-01 18:02:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-12-01 18:02:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-01 18:02:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2018-12-01 18:02:23,500 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2018-12-01 18:02:23,500 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2018-12-01 18:02:23,500 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 18:02:23,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 102 transitions. [2018-12-01 18:02:23,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-01 18:02:23,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:02:23,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:02:23,501 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 18:02:23,501 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:02:23,501 INFO L794 eck$LassoCheckResult]: Stem: 680#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 678#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 679#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 709#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 690#L555-3 [2018-12-01 18:02:23,501 INFO L796 eck$LassoCheckResult]: Loop: 690#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 719#L555-4 assume test_fun_#t~short13; 718#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 669#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 670#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~short16;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 665#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 666#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem21;havoc test_fun_#t~mem20;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 658#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 659#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 690#L555-3 [2018-12-01 18:02:23,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:23,501 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2018-12-01 18:02:23,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:23,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:23,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:23,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:23,510 INFO L82 PathProgramCache]: Analyzing trace with hash -162891098, now seen corresponding path program 2 times [2018-12-01 18:02:23,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:23,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:23,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:23,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1872663455, now seen corresponding path program 1 times [2018-12-01 18:02:23,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:23,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:23,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:02:23,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:23,647 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2018-12-01 18:02:23,766 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-12-01 18:02:24,069 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2018-12-01 18:02:24,461 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-01 18:02:24,464 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:02:24,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:02:24,464 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:02:24,464 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:02:24,465 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 18:02:24,465 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:02:24,465 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:02:24,465 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:02:24,465 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-12-01 18:02:24,465 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:02:24,465 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:02:24,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:24,929 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-12-01 18:02:25,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:25,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:25,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:25,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:25,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:25,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:25,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:25,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:25,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:25,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:25,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:02:25,383 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-12-01 18:02:25,534 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:02:25,535 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 18:02:25,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:25,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:25,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:25,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:25,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:25,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:25,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:25,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:25,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:25,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,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-12-01 18:02:25,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:25,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:25,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:25,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:25,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:25,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:25,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:25,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:25,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:25,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:25,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:25,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:25,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:25,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:25,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:25,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:25,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:25,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:25,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:25,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:25,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:25,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:25,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:25,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:25,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:25,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:25,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:25,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:25,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:02:25,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:02:25,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:02:25,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:25,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:25,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,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-12-01 18:02:25,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:25,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:25,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:25,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:25,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,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-12-01 18:02:25,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,561 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 18:02:25,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,562 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:02:25,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:25,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:02:25,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:02:25,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:02:25,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:02:25,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:02:25,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:02:25,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:02:25,568 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 18:02:25,568 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:02:25,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:02:25,585 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-01 18:02:25,585 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-01 18:02:25,836 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 18:02:25,863 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-12-01 18:02:25,863 INFO L444 ModelExtractionUtils]: 64 out of 66 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 18:02:25,863 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 18:02:25,864 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-01 18:02:25,864 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 18:02:25,864 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-12-01 18:02:25,943 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-12-01 18:02:25,944 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 18:02:25,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:02:25,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:02:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:02:25,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:02:26,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 18:02:26,024 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 49 treesize of output 61 [2018-12-01 18:02:26,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 18:02:26,028 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 52 treesize of output 39 [2018-12-01 18:02:26,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 18:02:26,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 18:02:26,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 49 [2018-12-01 18:02:26,054 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 18:02:26,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 18:02:26,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 18:02:26,081 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2018-12-01 18:02:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:02:26,093 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-01 18:02:26,093 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-12-01 18:02:26,152 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 204 states and 297 transitions. Complement of second has 10 states. [2018-12-01 18:02:26,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-01 18:02:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 18:02:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-12-01 18:02:26,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 4 letters. Loop has 9 letters. [2018-12-01 18:02:26,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:02:26,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 13 letters. Loop has 9 letters. [2018-12-01 18:02:26,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:02:26,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 4 letters. Loop has 18 letters. [2018-12-01 18:02:26,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:02:26,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 297 transitions. [2018-12-01 18:02:26,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-01 18:02:26,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 54 states and 73 transitions. [2018-12-01 18:02:26,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-01 18:02:26,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-01 18:02:26,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 73 transitions. [2018-12-01 18:02:26,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:02:26,157 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2018-12-01 18:02:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 73 transitions. [2018-12-01 18:02:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-01 18:02:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-01 18:02:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2018-12-01 18:02:26,160 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2018-12-01 18:02:26,160 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2018-12-01 18:02:26,160 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 18:02:26,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. [2018-12-01 18:02:26,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-01 18:02:26,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:02:26,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:02:26,160 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 18:02:26,160 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:02:26,161 INFO L794 eck$LassoCheckResult]: Stem: 1117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1115#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1116#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1144#L555-1 assume !test_fun_#t~short8; 1118#L555-3 [2018-12-01 18:02:26,161 INFO L796 eck$LassoCheckResult]: Loop: 1118#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1119#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1122#L555-6 assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; 1092#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1093#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1100#L555-10 assume !test_fun_#t~short16; 1107#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~short16;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1102#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1103#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem21;havoc test_fun_#t~mem20;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1096#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1097#L555-1 assume !test_fun_#t~short8; 1118#L555-3 [2018-12-01 18:02:26,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-12-01 18:02:26,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:26,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:26,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:26,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:26,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:26,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:26,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1675651104, now seen corresponding path program 1 times [2018-12-01 18:02:26,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:26,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:26,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:26,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:02:26,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:02:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:02:26,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:02:26,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:02:26,181 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 18:02:26,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:02:26,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:02:26,181 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. cyclomatic complexity: 23 Second operand 3 states. [2018-12-01 18:02:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:02:26,190 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-12-01 18:02:26,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:02:26,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2018-12-01 18:02:26,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-01 18:02:26,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 54 states and 69 transitions. [2018-12-01 18:02:26,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-01 18:02:26,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-01 18:02:26,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 69 transitions. [2018-12-01 18:02:26,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:02:26,193 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2018-12-01 18:02:26,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 69 transitions. [2018-12-01 18:02:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-01 18:02:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-01 18:02:26,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2018-12-01 18:02:26,195 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2018-12-01 18:02:26,195 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2018-12-01 18:02:26,195 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 18:02:26,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 69 transitions. [2018-12-01 18:02:26,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-01 18:02:26,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:02:26,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:02:26,196 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 18:02:26,196 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:02:26,196 INFO L794 eck$LassoCheckResult]: Stem: 1235#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1234#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1214#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1215#L555-1 assume !test_fun_#t~short8; 1236#L555-3 [2018-12-01 18:02:26,197 INFO L796 eck$LassoCheckResult]: Loop: 1236#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1237#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1240#L555-6 assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; 1210#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1211#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1219#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1226#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~short16;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1221#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1222#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem21;havoc test_fun_#t~mem20;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1243#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1246#L555-1 assume !test_fun_#t~short8; 1236#L555-3 [2018-12-01 18:02:26,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:26,197 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2018-12-01 18:02:26,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:26,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:26,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:26,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:26,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:26,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:26,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1732909406, now seen corresponding path program 1 times [2018-12-01 18:02:26,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:26,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:26,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:26,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:02:26,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:02:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:02:26,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:02:26,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 18:02:26,253 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 18:02:26,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 18:02:26,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 18:02:26,254 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. cyclomatic complexity: 19 Second operand 7 states. [2018-12-01 18:02:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:02:26,333 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2018-12-01 18:02:26,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 18:02:26,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 93 transitions. [2018-12-01 18:02:26,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-01 18:02:26,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 86 transitions. [2018-12-01 18:02:26,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-01 18:02:26,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-01 18:02:26,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 86 transitions. [2018-12-01 18:02:26,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:02:26,335 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2018-12-01 18:02:26,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 86 transitions. [2018-12-01 18:02:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-01 18:02:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-01 18:02:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2018-12-01 18:02:26,338 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2018-12-01 18:02:26,338 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2018-12-01 18:02:26,339 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 18:02:26,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 86 transitions. [2018-12-01 18:02:26,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-01 18:02:26,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:02:26,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:02:26,339 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 18:02:26,340 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:02:26,340 INFO L794 eck$LassoCheckResult]: Stem: 1378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1376#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1377#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1413#L555-1 assume !test_fun_#t~short8; 1379#L555-3 [2018-12-01 18:02:26,340 INFO L796 eck$LassoCheckResult]: Loop: 1379#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1380#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1382#L555-6 assume !test_fun_#t~short12; 1358#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1359#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1366#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1372#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~short16;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1368#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1369#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem21;havoc test_fun_#t~mem20;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1362#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1363#L555-1 assume !test_fun_#t~short8; 1379#L555-3 [2018-12-01 18:02:26,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2018-12-01 18:02:26,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:26,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:26,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:02:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:02:26,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:02:26,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1052851036, now seen corresponding path program 1 times [2018-12-01 18:02:26,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:02:26,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:02:26,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:26,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:02:26,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:02:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:02:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:02:26,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:02:26,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 18:02:26,361 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 18:02:26,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 18:02:26,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 18:02:26,361 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. cyclomatic complexity: 19 Second operand 5 states. [2018-12-01 18:02:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:02:26,382 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-12-01 18:02:26,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 18:02:26,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 62 transitions. [2018-12-01 18:02:26,382 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 18:02:26,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2018-12-01 18:02:26,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 18:02:26,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 18:02:26,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 18:02:26,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:02:26,383 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 18:02:26,383 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 18:02:26,383 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 18:02:26,383 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 18:02:26,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 18:02:26,383 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 18:02:26,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 18:02:26,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 06:02:26 BoogieIcfgContainer [2018-12-01 18:02:26,387 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 18:02:26,387 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 18:02:26,387 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 18:02:26,387 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 18:02:26,388 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:02:19" (3/4) ... [2018-12-01 18:02:26,390 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 18:02:26,390 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 18:02:26,391 INFO L168 Benchmark]: Toolchain (without parser) took 7511.82 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 359.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 184.3 MB. Max. memory is 11.5 GB. [2018-12-01 18:02:26,391 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:02:26,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -113.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-01 18:02:26,392 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:02:26,392 INFO L168 Benchmark]: Boogie Preprocessor took 17.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:02:26,392 INFO L168 Benchmark]: RCFGBuilder took 180.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-01 18:02:26,392 INFO L168 Benchmark]: BuchiAutomizer took 7019.92 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 277.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -87.8 MB). Peak memory consumption was 190.1 MB. Max. memory is 11.5 GB. [2018-12-01 18:02:26,393 INFO L168 Benchmark]: Witness Printer took 3.08 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:02:26,394 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -113.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 180.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7019.92 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 277.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -87.8 MB). Peak memory consumption was 190.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.08 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (5 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 6.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 71 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 132 SDtfs, 80 SDslu, 179 SDs, 0 SdLazy, 214 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital501 mio100 ax104 hnf99 lsp73 ukn72 mio100 lsp30 div100 bol107 ite100 ukn100 eq162 hnf90 smp91 dnf263 smp65 tf100 neg99 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 64ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...