./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.13-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_63e62c9b-350a-430a-b636-0241b64a85d4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63e62c9b-350a-430a-b636-0241b64a85d4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63e62c9b-350a-430a-b636-0241b64a85d4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63e62c9b-350a-430a-b636-0241b64a85d4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_63e62c9b-350a-430a-b636-0241b64a85d4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63e62c9b-350a-430a-b636-0241b64a85d4/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 72925b65ef321f719f00e79529e35268c3f3eaa3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 00:02:01,242 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 00:02:01,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 00:02:01,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 00:02:01,249 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 00:02:01,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 00:02:01,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 00:02:01,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 00:02:01,251 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 00:02:01,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 00:02:01,252 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 00:02:01,252 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 00:02:01,253 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 00:02:01,253 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 00:02:01,254 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 00:02:01,254 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 00:02:01,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 00:02:01,255 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 00:02:01,256 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 00:02:01,257 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 00:02:01,258 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 00:02:01,258 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 00:02:01,259 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 00:02:01,259 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 00:02:01,259 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 00:02:01,260 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 00:02:01,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 00:02:01,261 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 00:02:01,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 00:02:01,262 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 00:02:01,262 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 00:02:01,262 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 00:02:01,262 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 00:02:01,262 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 00:02:01,263 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 00:02:01,263 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 00:02:01,263 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63e62c9b-350a-430a-b636-0241b64a85d4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-03 00:02:01,271 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 00:02:01,271 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 00:02:01,272 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 00:02:01,272 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 00:02:01,272 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 00:02:01,272 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-03 00:02:01,272 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-03 00:02:01,272 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-03 00:02:01,272 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-03 00:02:01,272 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-03 00:02:01,273 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-03 00:02:01,273 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 00:02:01,273 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 00:02:01,273 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 00:02:01,273 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 00:02:01,273 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-03 00:02:01,273 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-03 00:02:01,273 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-03 00:02:01,274 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 00:02:01,274 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-03 00:02:01,274 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 00:02:01,274 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-03 00:02:01,274 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 00:02:01,274 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 00:02:01,274 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-03 00:02:01,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 00:02:01,275 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-03 00:02:01,275 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-03 00:02:01,275 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-03 00:02:01,275 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_63e62c9b-350a-430a-b636-0241b64a85d4/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 -> 72925b65ef321f719f00e79529e35268c3f3eaa3 [2018-12-03 00:02:01,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 00:02:01,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 00:02:01,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 00:02:01,301 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 00:02:01,301 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 00:02:01,301 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63e62c9b-350a-430a-b636-0241b64a85d4/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i [2018-12-03 00:02:01,333 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63e62c9b-350a-430a-b636-0241b64a85d4/bin-2019/uautomizer/data/21ad460ab/378947663943405ab36b3e6c7ff866a6/FLAG94f5c012e [2018-12-03 00:02:01,726 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 00:02:01,727 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63e62c9b-350a-430a-b636-0241b64a85d4/sv-benchmarks/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i [2018-12-03 00:02:01,732 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63e62c9b-350a-430a-b636-0241b64a85d4/bin-2019/uautomizer/data/21ad460ab/378947663943405ab36b3e6c7ff866a6/FLAG94f5c012e [2018-12-03 00:02:01,741 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63e62c9b-350a-430a-b636-0241b64a85d4/bin-2019/uautomizer/data/21ad460ab/378947663943405ab36b3e6c7ff866a6 [2018-12-03 00:02:01,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 00:02:01,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 00:02:01,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 00:02:01,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 00:02:01,747 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 00:02:01,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:02:01" (1/1) ... [2018-12-03 00:02:01,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469267af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:02:01, skipping insertion in model container [2018-12-03 00:02:01,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:02:01" (1/1) ... [2018-12-03 00:02:01,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 00:02:01,776 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 00:02:01,913 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:02:01,920 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 00:02:01,986 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:02:02,006 INFO L195 MainTranslator]: Completed translation [2018-12-03 00:02:02,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:02:02 WrapperNode [2018-12-03 00:02:02,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 00:02:02,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 00:02:02,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 00:02:02,007 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 00:02:02,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:02:02" (1/1) ... [2018-12-03 00:02:02,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:02:02" (1/1) ... [2018-12-03 00:02:02,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 00:02:02,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 00:02:02,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 00:02:02,033 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 00:02:02,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:02:02" (1/1) ... [2018-12-03 00:02:02,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:02:02" (1/1) ... [2018-12-03 00:02:02,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:02:02" (1/1) ... [2018-12-03 00:02:02,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:02:02" (1/1) ... [2018-12-03 00:02:02,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:02:02" (1/1) ... [2018-12-03 00:02:02,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:02:02" (1/1) ... [2018-12-03 00:02:02,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:02:02" (1/1) ... [2018-12-03 00:02:02,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 00:02:02,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 00:02:02,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 00:02:02,047 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 00:02:02,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:02:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63e62c9b-350a-430a-b636-0241b64a85d4/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-03 00:02:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 00:02:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 00:02:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 00:02:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 00:02:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 00:02:02,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 00:02:02,206 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 00:02:02,206 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-03 00:02:02,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:02:02 BoogieIcfgContainer [2018-12-03 00:02:02,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 00:02:02,207 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-03 00:02:02,207 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-03 00:02:02,210 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-03 00:02:02,211 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-03 00:02:02,211 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 03.12 12:02:01" (1/3) ... [2018-12-03 00:02:02,212 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50b16d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 03.12 12:02:02, skipping insertion in model container [2018-12-03 00:02:02,212 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-03 00:02:02,212 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:02:02" (2/3) ... [2018-12-03 00:02:02,212 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50b16d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 03.12 12:02:02, skipping insertion in model container [2018-12-03 00:02:02,213 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-03 00:02:02,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:02:02" (3/3) ... [2018-12-03 00:02:02,214 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.13-alloca_true-termination_true-no-overflow.c.i [2018-12-03 00:02:02,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 00:02:02,259 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-03 00:02:02,260 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-03 00:02:02,260 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-03 00:02:02,260 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 00:02:02,260 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 00:02:02,260 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-03 00:02:02,260 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 00:02:02,260 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-03 00:02:02,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-03 00:02:02,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-03 00:02:02,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 00:02:02,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 00:02:02,287 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-03 00:02:02,288 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 00:02:02,288 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-03 00:02:02,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-03 00:02:02,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-03 00:02:02,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 00:02:02,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 00:02:02,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-03 00:02:02,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 00:02:02,294 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 14#L561-2true [2018-12-03 00:02:02,294 INFO L796 eck$LassoCheckResult]: Loop: 14#L561-2true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 8#L557-1true assume test_fun_#t~short10; 12#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 4#L558true assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 14#L561-2true [2018-12-03 00:02:02,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:02,298 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-03 00:02:02,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:02,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:02,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:02,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:02,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:02,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:02,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2018-12-03 00:02:02,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:02,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:02,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:02,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:02,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:02,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:02,409 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2018-12-03 00:02:02,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:02,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:02,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:02,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:02,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:02,860 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2018-12-03 00:02:03,022 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-12-03 00:02:03,032 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 00:02:03,033 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 00:02:03,033 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 00:02:03,034 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 00:02:03,034 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-03 00:02:03,034 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 00:02:03,034 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 00:02:03,034 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 00:02:03,034 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-12-03 00:02:03,035 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 00:02:03,035 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 00:02:03,049 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-03 00:02:03,054 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-03 00:02:03,055 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-03 00:02:03,057 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-03 00:02:03,058 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-03 00:02:03,060 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-03 00:02:03,062 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-03 00:02:03,064 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-03 00:02:03,065 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-03 00:02:03,067 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-03 00:02:03,409 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-12-03 00:02:03,497 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-03 00:02:03,499 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-03 00:02:03,501 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-03 00:02:03,502 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-03 00:02:03,504 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-03 00:02:03,505 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-03 00:02:03,506 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-03 00:02:03,507 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-03 00:02:03,509 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-03 00:02:03,510 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-03 00:02:03,511 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-03 00:02:03,512 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-03 00:02:03,850 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 00:02:03,854 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-03 00:02:03,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:02:03,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:03,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:02:03,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:02:03,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:02:03,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:02:03,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:02:03,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:02:03,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:02:03,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:02:03,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:02:03,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:02:03,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:02:03,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:02:03,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:02:03,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:02:03,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:02:03,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:02:03,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:02:03,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:02:03,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:03,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:02:03,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:02:03,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:02:03,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:02:03,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:02:03,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:02:03,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:02:03,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:02:03,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:03,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,885 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:02:03,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,886 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:02:03,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:03,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,899 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:02:03,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,900 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:02:03,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:03,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:03,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:03,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:02:03,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:03,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:02:03,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:03,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:03,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:03,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,931 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:02:03,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,932 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:02:03,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,936 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:02:03,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,937 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:02:03,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:03,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:03,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:03,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:03,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:03,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:03,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:03,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:03,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:03,963 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-03 00:02:03,968 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-03 00:02:03,968 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-03 00:02:03,970 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-03 00:02:03,970 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-03 00:02:03,971 INFO L518 LassoAnalysis]: Proved termination. [2018-12-03 00:02:03,971 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, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 Supporting invariants [] [2018-12-03 00:02:04,076 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-12-03 00:02:04,082 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 00:02:04,083 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 00:02:04,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:02:04,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:02:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:02:04,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:02:04,158 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-03 00:02:04,168 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-03 00:02:04,169 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2018-12-03 00:02:04,226 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 60 states and 79 transitions. Complement of second has 10 states. [2018-12-03 00:02:04,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-03 00:02:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-03 00:02:04,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-12-03 00:02:04,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-03 00:02:04,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:02:04,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-03 00:02:04,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:02:04,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-03 00:02:04,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:02:04,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2018-12-03 00:02:04,234 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-12-03 00:02:04,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 30 states and 45 transitions. [2018-12-03 00:02:04,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-03 00:02:04,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-03 00:02:04,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2018-12-03 00:02:04,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-03 00:02:04,239 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2018-12-03 00:02:04,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2018-12-03 00:02:04,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-03 00:02:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 00:02:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2018-12-03 00:02:04,257 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-12-03 00:02:04,258 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-12-03 00:02:04,258 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-03 00:02:04,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2018-12-03 00:02:04,258 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-12-03 00:02:04,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 00:02:04,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 00:02:04,259 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-03 00:02:04,259 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 00:02:04,259 INFO L794 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 282#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 283#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 302#L557-1 [2018-12-03 00:02:04,259 INFO L796 eck$LassoCheckResult]: Loop: 302#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 299#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 300#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 296#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 302#L557-1 [2018-12-03 00:02:04,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:04,260 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-03 00:02:04,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:04,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:04,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:04,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:04,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1298969, now seen corresponding path program 1 times [2018-12-03 00:02:04,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:04,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:04,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:04,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:04,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908732, now seen corresponding path program 1 times [2018-12-03 00:02:04,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:04,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:02:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:02:04,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:02:04,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 00:02:04,465 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2018-12-03 00:02:04,629 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2018-12-03 00:02:04,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:02:04,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:02:04,631 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-12-03 00:02:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:02:04,662 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2018-12-03 00:02:04,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 00:02:04,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 65 transitions. [2018-12-03 00:02:04,663 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2018-12-03 00:02:04,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 51 transitions. [2018-12-03 00:02:04,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-03 00:02:04,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-03 00:02:04,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 51 transitions. [2018-12-03 00:02:04,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-03 00:02:04,664 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-12-03 00:02:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 51 transitions. [2018-12-03 00:02:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-12-03 00:02:04,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 00:02:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2018-12-03 00:02:04,665 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2018-12-03 00:02:04,665 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2018-12-03 00:02:04,665 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-03 00:02:04,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2018-12-03 00:02:04,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-03 00:02:04,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 00:02:04,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 00:02:04,666 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-03 00:02:04,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-03 00:02:04,666 INFO L794 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 369#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 370#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 377#L557-1 [2018-12-03 00:02:04,666 INFO L796 eck$LassoCheckResult]: Loop: 377#L557-1 assume test_fun_#t~short10; 378#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 371#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 372#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem14;havoc test_fun_#t~mem15; 382#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 377#L557-1 [2018-12-03 00:02:04,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:04,667 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-12-03 00:02:04,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:04,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:04,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:04,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:04,684 INFO L82 PathProgramCache]: Analyzing trace with hash 38423577, now seen corresponding path program 1 times [2018-12-03 00:02:04,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:04,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:04,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:02:04,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:04,692 INFO L82 PathProgramCache]: Analyzing trace with hash 177751382, now seen corresponding path program 1 times [2018-12-03 00:02:04,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:04,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:04,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:04,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:02:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:02:04,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:02:04,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 00:02:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:02:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:02:04,813 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-03 00:02:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:02:04,833 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2018-12-03 00:02:04,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 00:02:04,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2018-12-03 00:02:04,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-03 00:02:04,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 20 transitions. [2018-12-03 00:02:04,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-03 00:02:04,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-03 00:02:04,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-12-03 00:02:04,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-03 00:02:04,835 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-03 00:02:04,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-12-03 00:02:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 00:02:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 00:02:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-12-03 00:02:04,836 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-03 00:02:04,836 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-03 00:02:04,836 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-03 00:02:04,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-12-03 00:02:04,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-03 00:02:04,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 00:02:04,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 00:02:04,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-03 00:02:04,837 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-03 00:02:04,837 INFO L794 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 418#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 419#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 425#L557-1 [2018-12-03 00:02:04,837 INFO L796 eck$LassoCheckResult]: Loop: 425#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 426#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 431#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 429#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem14;havoc test_fun_#t~mem15; 430#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 425#L557-1 [2018-12-03 00:02:04,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:04,838 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2018-12-03 00:02:04,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:04,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:04,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:04,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:04,854 INFO L82 PathProgramCache]: Analyzing trace with hash 40270619, now seen corresponding path program 1 times [2018-12-03 00:02:04,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:04,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:04,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:02:04,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:02:04,881 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-03 00:02:04,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:02:04,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:02:04,882 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-03 00:02:04,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:02:04,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:02:04,882 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-12-03 00:02:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:02:04,905 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-12-03 00:02:04,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 00:02:04,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-12-03 00:02:04,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-03 00:02:04,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2018-12-03 00:02:04,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-03 00:02:04,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-03 00:02:04,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2018-12-03 00:02:04,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-03 00:02:04,907 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-03 00:02:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2018-12-03 00:02:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 00:02:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 00:02:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-12-03 00:02:04,909 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-03 00:02:04,909 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-03 00:02:04,909 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-03 00:02:04,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-12-03 00:02:04,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-03 00:02:04,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 00:02:04,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 00:02:04,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-03 00:02:04,910 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-03 00:02:04,910 INFO L794 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 459#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 460#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 466#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 467#L557-3 [2018-12-03 00:02:04,910 INFO L796 eck$LassoCheckResult]: Loop: 467#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 471#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 470#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 462#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 472#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 467#L557-3 [2018-12-03 00:02:04,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:04,910 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-12-03 00:02:04,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:04,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:04,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:04,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash 45962937, now seen corresponding path program 1 times [2018-12-03 00:02:04,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:04,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:04,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:04,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:04,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581938, now seen corresponding path program 1 times [2018-12-03 00:02:04,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:04,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:04,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:04,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:05,073 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-12-03 00:02:05,227 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2018-12-03 00:02:05,634 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 130 [2018-12-03 00:02:06,208 WARN L180 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-12-03 00:02:06,211 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 00:02:06,211 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 00:02:06,211 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 00:02:06,211 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 00:02:06,211 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-03 00:02:06,211 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 00:02:06,212 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 00:02:06,212 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 00:02:06,212 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-12-03 00:02:06,212 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 00:02:06,212 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 00:02:06,217 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-03 00:02:06,219 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-03 00:02:06,221 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-03 00:02:06,917 WARN L180 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2018-12-03 00:02:07,044 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-12-03 00:02:07,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:02:07,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:02:07,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:02:07,049 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-03 00:02:07,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:02:07,051 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-03 00:02:07,052 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-03 00:02:07,053 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-03 00:02:07,056 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-03 00:02:07,061 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-03 00:02:07,062 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-03 00:02:07,064 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-03 00:02:07,064 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-03 00:02:07,065 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-03 00:02:07,608 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-12-03 00:02:07,716 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 00:02:07,750 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 00:02:07,750 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-03 00:02:07,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-03 00:02:07,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:07,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:07,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:07,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:07,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:07,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:07,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:07,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:07,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:07,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:02:07,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:07,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:07,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:07,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:02:07,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:02:07,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:07,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:07,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:07,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:07,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:07,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:07,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:07,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:07,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:07,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:07,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:07,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:07,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:07,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:07,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:07,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:07,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:07,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:07,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:07,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:07,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:07,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:07,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:07,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:07,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:07,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:07,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:07,776 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:02:07,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:07,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:07,777 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:02:07,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:07,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:07,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-03 00:02:07,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:07,781 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:02:07,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:07,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:07,782 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:02:07,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:07,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:07,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:07,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:07,786 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:02:07,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:07,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:07,787 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:02:07,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:07,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:07,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:07,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:07,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:07,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:07,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:07,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:07,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:07,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:07,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:07,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:07,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:02:07,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:07,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:07,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:02:07,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:07,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:07,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:07,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:07,796 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:02:07,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:02:07,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:07,797 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:02:07,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:02:07,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:02:07,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-03 00:02:07,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:02:07,801 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:02:07,801 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 00:02:07,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:02:07,809 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-03 00:02:07,809 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-03 00:02:07,864 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-03 00:02:07,919 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-03 00:02:07,919 INFO L444 ModelExtractionUtils]: 81 out of 91 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-03 00:02:07,919 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-03 00:02:07,920 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-03 00:02:07,920 INFO L518 LassoAnalysis]: Proved termination. [2018-12-03 00:02:07,920 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, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 Supporting invariants [] [2018-12-03 00:02:08,054 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-12-03 00:02:08,055 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 00:02:08,055 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 00:02:08,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:02:08,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:02:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:02:08,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:02:08,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-12-03 00:02:08,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-12-03 00:02:08,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:02:08,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-12-03 00:02:08,150 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:02:08,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:02:08,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:02:08,174 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-12-03 00:02:08,189 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-03 00:02:08,189 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-03 00:02:08,189 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-12-03 00:02:08,207 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2018-12-03 00:02:08,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-03 00:02:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 00:02:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-03 00:02:08,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 5 letters. [2018-12-03 00:02:08,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:02:08,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 5 letters. [2018-12-03 00:02:08,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:02:08,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 10 letters. [2018-12-03 00:02:08,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:02:08,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-12-03 00:02:08,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-03 00:02:08,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2018-12-03 00:02:08,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-03 00:02:08,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-03 00:02:08,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-12-03 00:02:08,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-03 00:02:08,210 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-03 00:02:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-12-03 00:02:08,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-12-03 00:02:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 00:02:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-12-03 00:02:08,212 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-12-03 00:02:08,212 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-12-03 00:02:08,212 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-03 00:02:08,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-12-03 00:02:08,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-03 00:02:08,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 00:02:08,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 00:02:08,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:02:08,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 00:02:08,213 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 720#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 721#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 734#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 737#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 735#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 732#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 733#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 727#L557-1 assume test_fun_#t~short10; 728#L557-3 [2018-12-03 00:02:08,213 INFO L796 eck$LassoCheckResult]: Loop: 728#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 722#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 723#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 741#L557-1 assume test_fun_#t~short10; 728#L557-3 [2018-12-03 00:02:08,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:08,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581936, now seen corresponding path program 1 times [2018-12-03 00:02:08,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:08,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:08,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:08,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:08,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:02:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:02:08,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:02:08,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63e62c9b-350a-430a-b636-0241b64a85d4/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 00:02:08,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:02:08,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:02:08,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-03 00:02:08,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-03 00:02:08,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-03 00:02:08,375 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:02:08,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:02:08,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:02:08,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:02:08,393 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:13 [2018-12-03 00:02:08,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 46 [2018-12-03 00:02:08,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:02:08,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-03 00:02:08,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:02:08,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:02:08,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:02:08,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2018-12-03 00:02:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:02:08,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 00:02:08,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-03 00:02:08,501 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-03 00:02:08,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:02:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1480167, now seen corresponding path program 2 times [2018-12-03 00:02:08,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:02:08,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:02:08,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:08,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:02:08,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:02:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:02:08,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 00:02:08,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-03 00:02:08,589 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand 11 states. [2018-12-03 00:02:08,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:02:08,628 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-12-03 00:02:08,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 00:02:08,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-12-03 00:02:08,628 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-03 00:02:08,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-12-03 00:02:08,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-03 00:02:08,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-03 00:02:08,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-03 00:02:08,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 00:02:08,629 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 00:02:08,629 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 00:02:08,629 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 00:02:08,629 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-03 00:02:08,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-03 00:02:08,629 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-03 00:02:08,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-03 00:02:08,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 03.12 12:02:08 BoogieIcfgContainer [2018-12-03 00:02:08,634 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-03 00:02:08,635 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 00:02:08,635 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 00:02:08,635 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 00:02:08,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:02:02" (3/4) ... [2018-12-03 00:02:08,638 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 00:02:08,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 00:02:08,638 INFO L168 Benchmark]: Toolchain (without parser) took 6894.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 949.5 MB in the beginning and 1.0 GB in the end (delta: -82.1 MB). Peak memory consumption was 127.0 MB. Max. memory is 11.5 GB. [2018-12-03 00:02:08,639 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-03 00:02:08,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-03 00:02:08,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-03 00:02:08,640 INFO L168 Benchmark]: Boogie Preprocessor took 14.06 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-03 00:02:08,640 INFO L168 Benchmark]: RCFGBuilder took 159.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-03 00:02:08,640 INFO L168 Benchmark]: BuchiAutomizer took 6427.24 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.6 MB). Peak memory consumption was 141.7 MB. Max. memory is 11.5 GB. [2018-12-03 00:02:08,641 INFO L168 Benchmark]: Witness Printer took 3.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:02:08,643 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 261.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.06 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 159.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6427.24 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.6 MB). Peak memory consumption was 141.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 39 SDtfs, 64 SDslu, 37 SDs, 0 SdLazy, 138 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital630 mio100 ax103 hnf99 lsp73 ukn72 mio100 lsp30 div100 bol104 ite100 ukn100 eq182 hnf88 smp96 dnf231 smp73 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 120ms VariablesStem: 17 VariablesLoop: 12 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...