./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d8147c1a-1011-4486-b964-0b92dac4e839/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d8147c1a-1011-4486-b964-0b92dac4e839/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d8147c1a-1011-4486-b964-0b92dac4e839/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d8147c1a-1011-4486-b964-0b92dac4e839/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d8147c1a-1011-4486-b964-0b92dac4e839/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d8147c1a-1011-4486-b964-0b92dac4e839/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 0c73140129db08253eb2666e014a272764010e16 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:58:31,198 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:58:31,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:58:31,208 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:58:31,208 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:58:31,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:58:31,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:58:31,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:58:31,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:58:31,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:58:31,212 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:58:31,212 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:58:31,213 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:58:31,213 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:58:31,214 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:58:31,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:58:31,215 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:58:31,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:58:31,217 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:58:31,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:58:31,219 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:58:31,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:58:31,222 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:58:31,222 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:58:31,222 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:58:31,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:58:31,223 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:58:31,223 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:58:31,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:58:31,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:58:31,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:58:31,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:58:31,225 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:58:31,225 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:58:31,225 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:58:31,226 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:58:31,226 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d8147c1a-1011-4486-b964-0b92dac4e839/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:58:31,234 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:58:31,234 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:58:31,235 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:58:31,235 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:58:31,235 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:58:31,236 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:58:31,236 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:58:31,236 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:58:31,236 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:58:31,236 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:58:31,236 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:58:31,237 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:58:31,237 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:58:31,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:58:31,237 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:58:31,237 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:58:31,237 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:58:31,237 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:58:31,238 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:58:31,238 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:58:31,238 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:58:31,238 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:58:31,238 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:58:31,238 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:58:31,239 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:58:31,239 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:58:31,239 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:58:31,239 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:58:31,240 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:58:31,240 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_d8147c1a-1011-4486-b964-0b92dac4e839/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 -> 0c73140129db08253eb2666e014a272764010e16 [2018-11-28 12:58:31,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:58:31,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:58:31,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:58:31,279 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:58:31,280 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:58:31,280 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d8147c1a-1011-4486-b964-0b92dac4e839/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2018-11-28 12:58:31,327 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8147c1a-1011-4486-b964-0b92dac4e839/bin-2019/uautomizer/data/9df3d4a29/5b58d888ef8d479d89485f282bdfa2c8/FLAGa9c3ebf04 [2018-11-28 12:58:31,714 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:58:31,715 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d8147c1a-1011-4486-b964-0b92dac4e839/sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2018-11-28 12:58:31,725 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8147c1a-1011-4486-b964-0b92dac4e839/bin-2019/uautomizer/data/9df3d4a29/5b58d888ef8d479d89485f282bdfa2c8/FLAGa9c3ebf04 [2018-11-28 12:58:32,087 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d8147c1a-1011-4486-b964-0b92dac4e839/bin-2019/uautomizer/data/9df3d4a29/5b58d888ef8d479d89485f282bdfa2c8 [2018-11-28 12:58:32,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:58:32,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:58:32,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:58:32,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:58:32,093 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:58:32,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:58:32" (1/1) ... [2018-11-28 12:58:32,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ee58e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:32, skipping insertion in model container [2018-11-28 12:58:32,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:58:32" (1/1) ... [2018-11-28 12:58:32,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:58:32,125 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:58:32,310 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:58:32,319 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:58:32,391 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:58:32,414 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:58:32,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:32 WrapperNode [2018-11-28 12:58:32,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:58:32,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:58:32,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:58:32,415 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:58:32,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:32" (1/1) ... [2018-11-28 12:58:32,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:32" (1/1) ... [2018-11-28 12:58:32,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:58:32,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:58:32,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:58:32,447 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:58:32,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:32" (1/1) ... [2018-11-28 12:58:32,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:32" (1/1) ... [2018-11-28 12:58:32,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:32" (1/1) ... [2018-11-28 12:58:32,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:32" (1/1) ... [2018-11-28 12:58:32,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:32" (1/1) ... [2018-11-28 12:58:32,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:32" (1/1) ... [2018-11-28 12:58:32,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:32" (1/1) ... [2018-11-28 12:58:32,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:58:32,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:58:32,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:58:32,464 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:58:32,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8147c1a-1011-4486-b964-0b92dac4e839/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:58:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:58:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:58:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:58:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:58:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:58:32,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:58:32,677 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:58:32,677 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 12:58:32,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:58:32 BoogieIcfgContainer [2018-11-28 12:58:32,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:58:32,678 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:58:32,678 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:58:32,680 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:58:32,681 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:58:32,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:58:32" (1/3) ... [2018-11-28 12:58:32,682 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d09167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:58:32, skipping insertion in model container [2018-11-28 12:58:32,682 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:58:32,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:58:32" (2/3) ... [2018-11-28 12:58:32,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d09167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:58:32, skipping insertion in model container [2018-11-28 12:58:32,683 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:58:32,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:58:32" (3/3) ... [2018-11-28 12:58:32,685 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-termination.c.i [2018-11-28 12:58:32,723 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:58:32,724 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:58:32,724 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:58:32,724 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:58:32,724 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:58:32,724 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:58:32,724 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:58:32,724 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:58:32,724 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:58:32,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 12:58:32,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:58:32,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:58:32,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:58:32,752 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:58:32,752 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:58:32,752 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:58:32,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 12:58:32,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:58:32,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:58:32,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:58:32,754 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:58:32,754 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:58:32,760 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 9#L574true assume !(main_~Alen~0 < 1); 14#L574-2true assume !(main_~Blen~0 < 1); 7#L577-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 12#L554-2true [2018-11-28 12:58:32,761 INFO L796 eck$LassoCheckResult]: Loop: 12#L554-2true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 5#L558-2true assume !true; 6#L557-2true assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 11#L564-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 12#L554-2true [2018-11-28 12:58:32,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:32,765 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-28 12:58:32,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:32,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:32,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:32,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:32,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:32,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:32,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2018-11-28 12:58:32,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:32,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:32,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:32,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:32,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:32,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:32,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:58:32,882 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:58:32,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 12:58:32,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:58:32,893 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-28 12:58:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:32,897 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-11-28 12:58:32,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 12:58:32,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-11-28 12:58:32,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:58:32,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2018-11-28 12:58:32,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 12:58:32,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 12:58:32,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2018-11-28 12:58:32,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:58:32,906 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-28 12:58:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2018-11-28 12:58:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 12:58:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 12:58:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-11-28 12:58:32,926 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-28 12:58:32,926 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-28 12:58:32,926 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:58:32,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2018-11-28 12:58:32,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:58:32,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:58:32,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:58:32,927 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:58:32,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:58:32,928 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 37#L574 assume !(main_~Alen~0 < 1); 38#L574-2 assume !(main_~Blen~0 < 1); 44#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 42#L554-2 [2018-11-28 12:58:32,928 INFO L796 eck$LassoCheckResult]: Loop: 42#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 40#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 45#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 41#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 42#L554-2 [2018-11-28 12:58:32,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:32,928 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-28 12:58:32,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:32,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:32,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:32,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:32,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:32,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2018-11-28 12:58:32,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:32,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:32,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:32,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:58:32,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:32,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2018-11-28 12:58:32,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:32,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:32,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:33,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:33,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:58:33,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:58:33,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:58:33,171 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-28 12:58:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:33,213 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2018-11-28 12:58:33,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:58:33,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2018-11-28 12:58:33,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:58:33,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2018-11-28 12:58:33,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 12:58:33,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 12:58:33,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2018-11-28 12:58:33,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:58:33,217 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-28 12:58:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2018-11-28 12:58:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-28 12:58:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 12:58:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-11-28 12:58:33,218 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 12:58:33,218 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 12:58:33,219 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:58:33,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-11-28 12:58:33,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 12:58:33,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:58:33,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:58:33,219 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:58:33,220 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:58:33,220 INFO L794 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 73#L574 assume !(main_~Alen~0 < 1); 76#L574-2 assume !(main_~Blen~0 < 1); 81#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 78#L554-2 [2018-11-28 12:58:33,220 INFO L796 eck$LassoCheckResult]: Loop: 78#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 80#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 74#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 75#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 82#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 77#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 78#L554-2 [2018-11-28 12:58:33,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:33,220 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2018-11-28 12:58:33,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:33,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:33,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:33,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:33,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:33,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:33,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2018-11-28 12:58:33,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:33,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:33,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:33,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:58:33,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:33,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:33,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:58:33,268 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:58:33,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:58:33,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:58:33,269 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 12:58:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:33,287 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-11-28 12:58:33,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:58:33,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-28 12:58:33,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 12:58:33,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-11-28 12:58:33,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 12:58:33,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 12:58:33,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-28 12:58:33,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:58:33,289 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-28 12:58:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-28 12:58:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-11-28 12:58:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 12:58:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-11-28 12:58:33,291 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-28 12:58:33,291 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-28 12:58:33,291 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:58:33,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-11-28 12:58:33,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:58:33,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:58:33,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:58:33,292 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:58:33,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:58:33,292 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 107#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 108#L574 assume !(main_~Alen~0 < 1); 112#L574-2 assume !(main_~Blen~0 < 1); 118#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 114#L554-2 [2018-11-28 12:58:33,292 INFO L796 eck$LassoCheckResult]: Loop: 114#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 116#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 109#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 110#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 117#L557-2 assume !(0 == diff_~found~0); 113#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 114#L554-2 [2018-11-28 12:58:33,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:33,293 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2018-11-28 12:58:33,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:33,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:33,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:33,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:33,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:33,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:33,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2018-11-28 12:58:33,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:33,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:33,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:33,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:58:33,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:33,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:33,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2018-11-28 12:58:33,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:33,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:33,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:33,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:33,655 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-11-28 12:58:33,771 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-28 12:58:33,779 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:58:33,780 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:58:33,780 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:58:33,780 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:58:33,780 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:58:33,780 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:58:33,780 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:58:33,780 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:58:33,780 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 12:58:33,781 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:58:33,781 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:58:33,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:33,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:34,048 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2018-11-28 12:58:34,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:34,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:34,493 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:58:34,497 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:58:34,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:34,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:34,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:34,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:34,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:34,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:34,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:34,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:34,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:34,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:34,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:34,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:34,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:34,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:34,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:34,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:34,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:34,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:34,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:34,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:34,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:34,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:34,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:34,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:34,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:34,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:34,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:34,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:34,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:34,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:34,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:34,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:34,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:34,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:34,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:34,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,551 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:58:34,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,554 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:58:34,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:34,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:34,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:34,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,587 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:58:34,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,589 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:58:34,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:34,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:34,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,622 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:58:34,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,623 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:58:34,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:34,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:34,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:34,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:34,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:34,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:34,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:34,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:34,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:34,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:34,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:34,659 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:58:34,674 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:58:34,675 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:58:34,677 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:58:34,678 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:58:34,678 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:58:34,678 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_diff_~A.base)_1, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~A.offset) = 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_1 - 4*ULTIMATE.start_diff_~i~0 - 1*ULTIMATE.start_diff_~A.offset Supporting invariants [] [2018-11-28 12:58:34,721 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-28 12:58:34,729 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:58:34,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:34,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:34,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:34,807 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 12:58:34,807 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 12:58:34,855 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 30 transitions. Complement of second has 6 states. [2018-11-28 12:58:34,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:58:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:58:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 12:58:34,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-28 12:58:34,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:34,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 12:58:34,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:34,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 12 letters. [2018-11-28 12:58:34,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:34,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2018-11-28 12:58:34,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:58:34,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2018-11-28 12:58:34,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 12:58:34,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 12:58:34,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-11-28 12:58:34,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:58:34,861 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-28 12:58:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-11-28 12:58:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-28 12:58:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 12:58:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-11-28 12:58:34,864 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-11-28 12:58:34,864 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-11-28 12:58:34,864 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:58:34,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2018-11-28 12:58:34,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:58:34,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:58:34,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:58:34,865 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:58:34,865 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:58:34,865 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 258#L574 assume !(main_~Alen~0 < 1); 259#L574-2 assume !(main_~Blen~0 < 1); 270#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 268#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 261#L558-2 [2018-11-28 12:58:34,865 INFO L796 eck$LassoCheckResult]: Loop: 261#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 260#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 261#L558-2 [2018-11-28 12:58:34,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:34,865 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2018-11-28 12:58:34,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:34,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:34,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:34,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:34,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:34,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:34,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2018-11-28 12:58:34,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:34,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:34,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:34,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:34,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:34,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2018-11-28 12:58:34,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:34,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:34,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:34,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:34,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:35,176 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2018-11-28 12:58:35,275 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:58:35,275 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:58:35,275 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:58:35,275 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:58:35,275 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:58:35,275 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:58:35,275 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:58:35,275 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:58:35,275 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-28 12:58:35,275 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:58:35,275 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:58:35,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,503 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2018-11-28 12:58:35,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:35,891 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:58:35,891 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:58:35,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:35,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:35,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:35,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:35,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:35,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:35,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:35,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:35,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:35,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:35,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:35,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:35,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:35,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:35,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:35,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:35,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:35,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-11-28 12:58:35,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:35,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:35,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:35,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:35,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:35,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:35,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:35,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:35,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:35,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:35,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:35,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:35,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:35,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:35,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:35,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:35,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:35,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:35,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:35,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:35,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:35,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:35,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:35,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:35,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:35,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:35,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:35,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:35,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:35,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:35,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:35,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:35,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:35,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:35,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:35,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:35,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:35,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:35,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:35,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:35,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:35,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:35,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:35,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:35,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:35,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:35,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:35,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:35,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:35,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:35,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:35,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:35,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:35,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:35,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:35,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:35,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:35,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:35,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:35,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:35,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:35,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:35,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:35,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:35,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:35,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:35,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:35,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:35,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:35,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:35,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:35,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:35,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:35,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:35,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:35,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:35,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:35,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:35,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:35,928 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:58:35,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:35,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:35,929 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:58:35,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:35,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:35,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:35,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:35,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:35,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:35,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:35,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:35,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:35,958 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:58:35,971 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:58:35,972 INFO L444 ModelExtractionUtils]: 69 out of 73 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:58:35,972 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:58:35,973 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:58:35,973 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:58:35,973 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-11-28 12:58:36,012 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-28 12:58:36,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:36,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:36,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:36,059 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 12:58:36,060 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 12:58:36,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2018-11-28 12:58:36,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:58:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:58:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 12:58:36,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 12:58:36,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:36,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 12:58:36,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:36,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 12:58:36,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:36,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2018-11-28 12:58:36,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:58:36,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2018-11-28 12:58:36,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 12:58:36,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 12:58:36,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2018-11-28 12:58:36,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:58:36,087 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2018-11-28 12:58:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2018-11-28 12:58:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-11-28 12:58:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 12:58:36,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-28 12:58:36,090 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-28 12:58:36,090 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-28 12:58:36,090 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:58:36,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-28 12:58:36,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:58:36,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:58:36,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:58:36,092 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:58:36,092 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:58:36,092 INFO L794 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 420#L574 assume !(main_~Alen~0 < 1); 425#L574-2 assume !(main_~Blen~0 < 1); 433#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 429#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 430#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 437#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 438#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 435#L557-2 assume !(0 == diff_~found~0); 426#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 427#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 422#L558-2 [2018-11-28 12:58:36,092 INFO L796 eck$LassoCheckResult]: Loop: 422#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 421#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 422#L558-2 [2018-11-28 12:58:36,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:36,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1811575378, now seen corresponding path program 1 times [2018-11-28 12:58:36,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:36,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:36,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:36,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:36,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:58:36,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:36,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:58:36,107 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:58:36,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:36,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2018-11-28 12:58:36,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:36,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:36,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:36,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:36,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:36,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:58:36,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:58:36,192 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 12:58:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:36,207 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2018-11-28 12:58:36,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:58:36,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2018-11-28 12:58:36,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:58:36,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 31 transitions. [2018-11-28 12:58:36,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 12:58:36,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 12:58:36,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2018-11-28 12:58:36,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:58:36,210 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-28 12:58:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2018-11-28 12:58:36,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-28 12:58:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 12:58:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-11-28 12:58:36,212 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-28 12:58:36,212 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-28 12:58:36,212 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:58:36,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2018-11-28 12:58:36,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:58:36,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:58:36,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:58:36,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:58:36,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:58:36,213 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 467#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 468#L574 assume !(main_~Alen~0 < 1); 473#L574-2 assume !(main_~Blen~0 < 1); 480#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 477#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 478#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 486#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 484#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 482#L557-2 assume !(0 == diff_~found~0); 474#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 475#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 470#L558-2 [2018-11-28 12:58:36,213 INFO L796 eck$LassoCheckResult]: Loop: 470#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 469#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 470#L558-2 [2018-11-28 12:58:36,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:36,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2018-11-28 12:58:36,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:36,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:36,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:36,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:58:36,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:36,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:36,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 3 times [2018-11-28 12:58:36,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:36,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:36,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:36,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:58:36,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:36,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:36,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2018-11-28 12:58:36,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:36,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:36,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:58:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:58:36,691 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 133 [2018-11-28 12:58:36,781 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:58:36,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:58:36,782 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:58:36,782 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:58:36,782 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:58:36,782 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:58:36,782 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:58:36,782 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:58:36,782 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-28 12:58:36,782 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:58:36,782 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:58:36,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:36,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:37,058 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2018-11-28 12:58:37,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:58:37,473 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:58:37,473 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:58:37,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:37,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:37,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:37,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:37,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:37,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:37,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:37,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:37,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:37,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:37,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:37,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:37,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:37,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:37,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:37,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:37,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:37,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:37,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:37,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:37,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:37,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:37,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:37,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:37,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:37,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:37,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:37,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:37,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:37,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:37,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:37,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:58:37,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:58:37,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:58:37,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,521 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:58:37,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,525 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:58:37,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,529 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:58:37,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,531 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:58:37,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:37,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,545 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:58:37,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,547 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 12:58:37,547 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 12:58:37,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:37,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:37,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:37,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:37,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,576 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:58:37,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,577 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:58:37,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:58:37,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:58:37,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:58:37,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:58:37,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:58:37,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:58:37,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:58:37,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:58:37,611 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:58:37,637 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:58:37,637 INFO L444 ModelExtractionUtils]: 59 out of 64 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 12:58:37,638 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:58:37,638 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:58:37,638 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:58:37,639 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-11-28 12:58:37,690 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2018-11-28 12:58:37,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:37,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:37,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:37,744 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 12:58:37,744 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-28 12:58:37,769 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 48 transitions. Complement of second has 7 states. [2018-11-28 12:58:37,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:58:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:58:37,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 12:58:37,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 12:58:37,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:37,771 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:58:37,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:37,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:37,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:37,820 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 12:58:37,820 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-28 12:58:37,835 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 48 transitions. Complement of second has 7 states. [2018-11-28 12:58:37,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:58:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:58:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 12:58:37,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 12:58:37,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:37,839 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:58:37,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:37,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:37,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:37,879 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 12:58:37,879 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-28 12:58:37,895 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 34 states and 49 transitions. Complement of second has 6 states. [2018-11-28 12:58:37,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:58:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:58:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-28 12:58:37,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 12:58:37,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:37,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-28 12:58:37,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:37,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-28 12:58:37,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:58:37,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2018-11-28 12:58:37,898 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:58:37,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2018-11-28 12:58:37,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:58:37,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:58:37,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:58:37,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:58:37,898 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:58:37,898 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:58:37,898 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:58:37,898 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 12:58:37,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:58:37,899 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:58:37,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:58:37,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:58:37 BoogieIcfgContainer [2018-11-28 12:58:37,904 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:58:37,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:58:37,904 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:58:37,904 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:58:37,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:58:32" (3/4) ... [2018-11-28 12:58:37,907 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:58:37,908 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:58:37,908 INFO L168 Benchmark]: Toolchain (without parser) took 5818.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:58:37,909 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:58:37,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:58:37,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:58:37,910 INFO L168 Benchmark]: Boogie Preprocessor took 16.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:58:37,910 INFO L168 Benchmark]: RCFGBuilder took 213.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:58:37,911 INFO L168 Benchmark]: BuchiAutomizer took 5226.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.1 MB). Peak memory consumption was 81.5 MB. Max. memory is 11.5 GB. [2018-11-28 12:58:37,911 INFO L168 Benchmark]: Witness Printer took 3.43 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:58:37,913 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 213.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5226.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.1 MB). Peak memory consumption was 81.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.43 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[A] + -4 * i + -1 * A and consists of 4 locations. One deterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 127 SDtfs, 126 SDslu, 59 SDs, 0 SdLazy, 74 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital264 mio100 ax106 hnf99 lsp84 ukn87 mio100 lsp50 div100 bol100 ite100 ukn100 eq185 hnf89 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...