./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4809622f-b93b-4273-bb8a-78459cf59d93/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4809622f-b93b-4273-bb8a-78459cf59d93/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4809622f-b93b-4273-bb8a-78459cf59d93/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4809622f-b93b-4273-bb8a-78459cf59d93/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_4809622f-b93b-4273-bb8a-78459cf59d93/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4809622f-b93b-4273-bb8a-78459cf59d93/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-aa41828 [2018-11-23 02:24:37,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:24:37,019 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:24:37,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:24:37,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:24:37,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:24:37,028 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:24:37,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:24:37,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:24:37,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:24:37,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:24:37,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:24:37,032 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:24:37,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:24:37,033 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:24:37,034 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:24:37,034 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:24:37,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:24:37,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:24:37,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:24:37,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:24:37,039 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:24:37,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:24:37,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:24:37,041 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:24:37,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:24:37,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:24:37,043 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:24:37,044 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:24:37,044 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:24:37,044 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:24:37,045 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:24:37,045 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:24:37,045 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:24:37,046 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:24:37,046 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:24:37,047 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4809622f-b93b-4273-bb8a-78459cf59d93/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 02:24:37,057 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:24:37,057 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:24:37,058 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:24:37,059 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:24:37,059 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:24:37,059 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 02:24:37,059 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 02:24:37,059 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 02:24:37,060 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 02:24:37,060 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 02:24:37,060 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 02:24:37,060 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:24:37,060 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 02:24:37,060 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:24:37,060 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:24:37,061 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 02:24:37,061 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 02:24:37,061 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 02:24:37,061 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:24:37,061 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 02:24:37,061 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:24:37,062 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 02:24:37,062 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:24:37,062 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:24:37,062 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 02:24:37,062 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:24:37,062 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:24:37,063 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 02:24:37,063 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 02:24:37,064 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_4809622f-b93b-4273-bb8a-78459cf59d93/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-23 02:24:37,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:24:37,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:24:37,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:24:37,102 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:24:37,103 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:24:37,103 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4809622f-b93b-4273-bb8a-78459cf59d93/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2018-11-23 02:24:37,140 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4809622f-b93b-4273-bb8a-78459cf59d93/bin-2019/uautomizer/data/4d5bac498/4850d38cfdfd470f821029c01a1f50fe/FLAGf6ab84933 [2018-11-23 02:24:37,575 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:24:37,575 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4809622f-b93b-4273-bb8a-78459cf59d93/sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2018-11-23 02:24:37,584 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4809622f-b93b-4273-bb8a-78459cf59d93/bin-2019/uautomizer/data/4d5bac498/4850d38cfdfd470f821029c01a1f50fe/FLAGf6ab84933 [2018-11-23 02:24:37,594 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4809622f-b93b-4273-bb8a-78459cf59d93/bin-2019/uautomizer/data/4d5bac498/4850d38cfdfd470f821029c01a1f50fe [2018-11-23 02:24:37,597 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:24:37,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:24:37,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:24:37,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:24:37,602 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:24:37,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:24:37" (1/1) ... [2018-11-23 02:24:37,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ab206d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:37, skipping insertion in model container [2018-11-23 02:24:37,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:24:37" (1/1) ... [2018-11-23 02:24:37,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:24:37,647 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:24:37,827 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:24:37,835 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:24:37,903 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:24:37,925 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:24:37,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:37 WrapperNode [2018-11-23 02:24:37,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:24:37,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:24:37,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:24:37,926 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:24:37,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:37" (1/1) ... [2018-11-23 02:24:37,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:37" (1/1) ... [2018-11-23 02:24:37,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:24:37,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:24:37,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:24:37,955 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:24:37,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:37" (1/1) ... [2018-11-23 02:24:37,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:37" (1/1) ... [2018-11-23 02:24:37,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:37" (1/1) ... [2018-11-23 02:24:37,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:37" (1/1) ... [2018-11-23 02:24:37,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:37" (1/1) ... [2018-11-23 02:24:37,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:37" (1/1) ... [2018-11-23 02:24:37,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:37" (1/1) ... [2018-11-23 02:24:37,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:24:37,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:24:37,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:24:37,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:24:37,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4809622f-b93b-4273-bb8a-78459cf59d93/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-23 02:24:38,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:24:38,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:24:38,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:24:38,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:24:38,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:24:38,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:24:38,204 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:24:38,204 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 02:24:38,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:24:38 BoogieIcfgContainer [2018-11-23 02:24:38,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:24:38,205 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 02:24:38,205 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 02:24:38,208 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 02:24:38,209 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:24:38,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:24:37" (1/3) ... [2018-11-23 02:24:38,210 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11b6635c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:24:38, skipping insertion in model container [2018-11-23 02:24:38,210 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:24:38,210 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:37" (2/3) ... [2018-11-23 02:24:38,210 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11b6635c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:24:38, skipping insertion in model container [2018-11-23 02:24:38,210 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:24:38,211 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:24:38" (3/3) ... [2018-11-23 02:24:38,212 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-termination.c.i [2018-11-23 02:24:38,260 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:24:38,261 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 02:24:38,261 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 02:24:38,261 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 02:24:38,261 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:24:38,261 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:24:38,261 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 02:24:38,261 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:24:38,261 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 02:24:38,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 02:24:38,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:24:38,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:24:38,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:24:38,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:24:38,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:24:38,297 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 02:24:38,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 02:24:38,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:24:38,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:24:38,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:24:38,299 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:24:38,299 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:24:38,305 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-23 02:24:38,306 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-23 02:24:38,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:38,310 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 02:24:38,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:38,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:38,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:24:38,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:38,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:38,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2018-11-23 02:24:38,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:38,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:38,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:24:38,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:38,439 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-23 02:24:38,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:24:38,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:24:38,444 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:24:38,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:24:38,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:24:38,456 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-23 02:24:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:24:38,461 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-11-23 02:24:38,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:24:38,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-11-23 02:24:38,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:24:38,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2018-11-23 02:24:38,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:24:38,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:24:38,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2018-11-23 02:24:38,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:24:38,467 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-23 02:24:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2018-11-23 02:24:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 02:24:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 02:24:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-11-23 02:24:38,493 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-23 02:24:38,493 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-23 02:24:38,493 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 02:24:38,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2018-11-23 02:24:38,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:24:38,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:24:38,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:24:38,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:24:38,495 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:24:38,495 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-23 02:24:38,495 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-23 02:24:38,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:38,495 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 02:24:38,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:38,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:38,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:24:38,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:38,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:38,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2018-11-23 02:24:38,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:38,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:38,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:24:38,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:38,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:38,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2018-11-23 02:24:38,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:38,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:38,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:24:38,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:38,622 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-23 02:24:38,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:24:38,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:24:38,731 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-11-23 02:24:38,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:24:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:24:38,766 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-23 02:24:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:24:38,816 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2018-11-23 02:24:38,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:24:38,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2018-11-23 02:24:38,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 02:24:38,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2018-11-23 02:24:38,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 02:24:38,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 02:24:38,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2018-11-23 02:24:38,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:24:38,819 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-23 02:24:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2018-11-23 02:24:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-23 02:24:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 02:24:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-11-23 02:24:38,821 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-23 02:24:38,821 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-23 02:24:38,821 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 02:24:38,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-11-23 02:24:38,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 02:24:38,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:24:38,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:24:38,822 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:24:38,822 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 02:24:38,822 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-23 02:24:38,822 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~mem2;havoc diff_#t~mem3;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-23 02:24:38,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:38,822 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2018-11-23 02:24:38,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:38,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:38,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:24:38,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:38,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2018-11-23 02:24:38,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:38,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:38,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:24:38,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:38,858 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-23 02:24:38,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:24:38,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:24:38,858 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:24:38,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:24:38,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:24:38,859 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-23 02:24:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:24:38,872 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-11-23 02:24:38,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:24:38,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-23 02:24:38,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 02:24:38,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-11-23 02:24:38,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 02:24:38,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 02:24:38,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-23 02:24:38,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:24:38,874 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-23 02:24:38,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-23 02:24:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-11-23 02:24:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 02:24:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-11-23 02:24:38,875 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-23 02:24:38,875 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-23 02:24:38,876 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 02:24:38,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-11-23 02:24:38,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 02:24:38,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:24:38,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:24:38,876 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:24:38,877 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 02:24:38,877 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-23 02:24:38,877 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~mem2;havoc diff_#t~mem3;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-23 02:24:38,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:38,877 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2018-11-23 02:24:38,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:38,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:38,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:24:38,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:38,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:38,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2018-11-23 02:24:38,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:38,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:38,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:24:38,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:38,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:38,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2018-11-23 02:24:38,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:38,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:38,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:24:38,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:39,041 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-23 02:24:39,163 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-11-23 02:24:39,269 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-23 02:24:39,277 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:24:39,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:24:39,278 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:24:39,278 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:24:39,278 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:24:39,278 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:24:39,279 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:24:39,279 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:24:39,279 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 02:24:39,279 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:24:39,279 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:24:39,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-23 02:24:39,300 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-23 02:24:39,302 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-23 02:24:39,305 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-23 02:24:39,307 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-23 02:24:39,309 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-23 02:24:39,310 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-23 02:24:39,312 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-23 02:24:39,314 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-23 02:24:39,315 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-23 02:24:39,316 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-23 02:24:39,324 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-23 02:24:39,326 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-23 02:24:39,328 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-23 02:24:39,330 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-23 02:24:39,331 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-23 02:24:39,332 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-23 02:24:39,531 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2018-11-23 02:24:39,566 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-23 02:24:39,961 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:24:39,964 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:24:39,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:39,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:39,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:39,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:39,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:39,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:39,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:39,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:39,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:39,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:39,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:39,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:39,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:39,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:39,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:39,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:39,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:39,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:39,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:39,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:39,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:39,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:39,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:39,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:39,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:39,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:39,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:39,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:39,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:39,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:39,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:39,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:39,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:39,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:39,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:39,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:39,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:39,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:39,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:39,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:39,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:39,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:39,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:39,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:39,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:39,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:39,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:39,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:39,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:39,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:39,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:39,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:39,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:39,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:39,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:39,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:39,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:39,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:39,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:39,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:39,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:39,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:39,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:39,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:39,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:39,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:39,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:40,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:40,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:40,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:40,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:40,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:40,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:40,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:40,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:40,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:40,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:40,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:40,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:40,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:40,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:40,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:40,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:40,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:40,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:40,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:40,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:40,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:40,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:40,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,021 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:24:40,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,023 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:24:40,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:40,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:40,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:40,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:40,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:40,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:40,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:40,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,049 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:24:40,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,050 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:24:40,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:40,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:40,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:40,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:40,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:40,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,078 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:24:40,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,079 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:24:40,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:40,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:40,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:40,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:40,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:40,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:40,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:40,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:40,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:40,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:40,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:40,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:40,109 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:24:40,127 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:24:40,127 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 02:24:40,129 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:24:40,130 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:24:40,131 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:24:40,131 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2018-11-23 02:24:40,171 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 02:24:40,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:40,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:24:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:40,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:24:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:24:40,244 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-23 02:24:40,245 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 02:24:40,273 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 30 transitions. Complement of second has 4 states. [2018-11-23 02:24:40,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 02:24:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:24:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-23 02:24:40,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-23 02:24:40,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:24:40,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-23 02:24:40,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:24:40,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 12 letters. [2018-11-23 02:24:40,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:24:40,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2018-11-23 02:24:40,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 02:24:40,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2018-11-23 02:24:40,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 02:24:40,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 02:24:40,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-11-23 02:24:40,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:24:40,278 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-23 02:24:40,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-11-23 02:24:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-23 02:24:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 02:24:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-11-23 02:24:40,279 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-11-23 02:24:40,279 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-11-23 02:24:40,280 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 02:24:40,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2018-11-23 02:24:40,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 02:24:40,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:24:40,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:24:40,280 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 02:24:40,281 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:24:40,281 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#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; 255#L574 assume !(main_~Alen~0 < 1); 256#L574-2 assume !(main_~Blen~0 < 1); 267#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; 265#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 258#L558-2 [2018-11-23 02:24:40,281 INFO L796 eck$LassoCheckResult]: Loop: 258#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); 257#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 258#L558-2 [2018-11-23 02:24:40,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:40,281 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2018-11-23 02:24:40,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:40,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:40,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:40,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:24:40,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:40,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:40,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2018-11-23 02:24:40,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:40,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:40,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:40,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:24:40,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:40,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:40,297 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2018-11-23 02:24:40,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:40,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:40,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:40,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:24:40,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:40,567 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 108 [2018-11-23 02:24:40,703 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-23 02:24:40,705 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:24:40,705 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:24:40,705 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:24:40,705 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:24:40,705 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:24:40,705 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:24:40,705 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:24:40,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:24:40,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 02:24:40,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:24:40,706 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:24:40,709 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-23 02:24:40,712 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-23 02:24:40,714 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-23 02:24:40,717 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-23 02:24:40,718 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-23 02:24:40,721 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-23 02:24:40,723 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-23 02:24:40,725 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-23 02:24:40,727 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-23 02:24:40,729 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-23 02:24:40,730 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-23 02:24:40,732 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-23 02:24:40,960 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2018-11-23 02:24:40,982 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-23 02:24:40,983 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-23 02:24:40,985 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-23 02:24:40,989 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-23 02:24:40,990 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-23 02:24:40,992 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-23 02:24:41,331 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:24:41,331 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:24:41,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:41,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:41,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:41,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:41,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:41,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:41,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:41,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:41,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:41,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:41,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:41,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:41,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:41,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:41,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:41,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:41,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:41,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:41,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:41,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:41,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:41,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:41,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:41,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:41,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:41,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:41,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:41,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:41,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:41,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,365 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:24:41,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,366 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:24:41,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:41,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:41,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:41,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,373 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:24:41,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,374 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:24:41,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:41,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:41,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:41,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:41,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:41,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:41,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,387 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:24:41,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,388 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 02:24:41,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:41,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:41,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:41,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:41,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:41,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:41,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:41,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:41,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:41,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:41,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:41,413 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:24:41,432 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 02:24:41,432 INFO L444 ModelExtractionUtils]: 66 out of 73 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 02:24:41,433 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:24:41,433 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:24:41,434 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:24:41,434 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~j~0, v_rep(select #length ULTIMATE.start_diff_~B.base)_2) = -1*ULTIMATE.start_diff_~B.offset - 4*ULTIMATE.start_diff_~j~0 + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_2 Supporting invariants [] [2018-11-23 02:24:41,471 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 02:24:41,476 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 02:24:41,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:41,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:24:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:41,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:24:41,520 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-23 02:24:41,520 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-23 02:24:41,521 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 02:24:41,547 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-23 02:24:41,548 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-23 02:24:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:24:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 02:24:41,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-23 02:24:41,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:24:41,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 02:24:41,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:24:41,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 02:24:41,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:24:41,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2018-11-23 02:24:41,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 02:24:41,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2018-11-23 02:24:41,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 02:24:41,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 02:24:41,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2018-11-23 02:24:41,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:24:41,552 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2018-11-23 02:24:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2018-11-23 02:24:41,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-11-23 02:24:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 02:24:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-23 02:24:41,553 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 02:24:41,554 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 02:24:41,554 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 02:24:41,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-23 02:24:41,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 02:24:41,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:24:41,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:24:41,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:24:41,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:24:41,555 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 416#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; 417#L574 assume !(main_~Alen~0 < 1); 422#L574-2 assume !(main_~Blen~0 < 1); 430#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; 426#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 427#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); 434#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 435#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 432#L557-2 assume !(0 == diff_~found~0); 423#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 424#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 419#L558-2 [2018-11-23 02:24:41,555 INFO L796 eck$LassoCheckResult]: Loop: 419#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); 418#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 419#L558-2 [2018-11-23 02:24:41,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:41,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1811575378, now seen corresponding path program 1 times [2018-11-23 02:24:41,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:41,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:41,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:41,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:24:41,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:41,577 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-23 02:24:41,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:24:41,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:24:41,577 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:24:41,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:41,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2018-11-23 02:24:41,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:41,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:41,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:41,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:24:41,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:41,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:24:41,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:24:41,620 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 02:24:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:24:41,629 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2018-11-23 02:24:41,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:24:41,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2018-11-23 02:24:41,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 02:24:41,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 31 transitions. [2018-11-23 02:24:41,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 02:24:41,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 02:24:41,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2018-11-23 02:24:41,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:24:41,631 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-23 02:24:41,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2018-11-23 02:24:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 02:24:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 02:24:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-11-23 02:24:41,633 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-23 02:24:41,633 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-23 02:24:41,633 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 02:24:41,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2018-11-23 02:24:41,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 02:24:41,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:24:41,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:24:41,634 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:24:41,634 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:24:41,634 INFO L794 eck$LassoCheckResult]: Stem: 473#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 464#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; 465#L574 assume !(main_~Alen~0 < 1); 470#L574-2 assume !(main_~Blen~0 < 1); 478#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; 474#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 475#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); 483#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 481#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 479#L557-2 assume !(0 == diff_~found~0); 471#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 472#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 467#L558-2 [2018-11-23 02:24:41,634 INFO L796 eck$LassoCheckResult]: Loop: 467#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); 466#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 467#L558-2 [2018-11-23 02:24:41,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2018-11-23 02:24:41,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:41,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:41,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:41,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:24:41,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:41,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:41,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 3 times [2018-11-23 02:24:41,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:41,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:41,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:41,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:24:41,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:41,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2018-11-23 02:24:41,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:24:41,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:24:41,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:41,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:24:41,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:24:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:24:42,014 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 129 [2018-11-23 02:24:42,119 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:24:42,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:24:42,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:24:42,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:24:42,120 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:24:42,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:24:42,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:24:42,120 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:24:42,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-23 02:24:42,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:24:42,120 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:24:42,123 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-23 02:24:42,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:24:42,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:24:42,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:24:42,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:24:42,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:24:42,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:24:42,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:24:42,140 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-23 02:24:42,141 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-23 02:24:42,142 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-23 02:24:42,146 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-23 02:24:42,148 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-23 02:24:42,149 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-23 02:24:42,151 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-23 02:24:42,152 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-23 02:24:42,153 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-23 02:24:42,349 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2018-11-23 02:24:42,373 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-23 02:24:42,758 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:24:42,759 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:24:42,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:24:42,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:42,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:42,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:42,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:42,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:42,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:42,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:42,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:42,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:24:42,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:42,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:42,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:42,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:42,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:42,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:42,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:42,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:24:42,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:42,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:42,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:42,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:24:42,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:42,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:42,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:42,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:24:42,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:42,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:42,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:42,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:42,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:42,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:42,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:42,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:24:42,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:42,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:42,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:24:42,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:42,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:24:42,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:24:42,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:24:42,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:24:42,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,792 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:24:42,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,793 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:24:42,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,797 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:24:42,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,798 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:24:42,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:42,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,805 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:24:42,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,807 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 02:24:42,807 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 02:24:42,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:42,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:42,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:42,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,824 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:24:42,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,824 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:24:42,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:24:42,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:42,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:24:42,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 02:24:42,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:24:42,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:24:42,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:24:42,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:24:42,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:24:42,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:24:42,856 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:24:42,867 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:24:42,868 INFO L444 ModelExtractionUtils]: 60 out of 64 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:24:42,868 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:24:42,868 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:24:42,869 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:24:42,869 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-23 02:24:42,913 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2018-11-23 02:24:42,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:42,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:24:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:42,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:24:42,948 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-23 02:24:42,948 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-23 02:24:42,948 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 02:24:42,964 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-23 02:24:42,965 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-23 02:24:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:24:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-23 02:24:42,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-23 02:24:42,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:24:42,966 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:24:42,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:42,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:24:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:43,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:24:43,005 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-23 02:24:43,006 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-23 02:24:43,006 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 02:24:43,016 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-23 02:24:43,017 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-23 02:24:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:24:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-23 02:24:43,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-23 02:24:43,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:24:43,018 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:24:43,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:24:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:43,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:24:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:24:43,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:24:43,054 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-23 02:24:43,054 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-23 02:24:43,054 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 02:24:43,067 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-23 02:24:43,068 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-23 02:24:43,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:24:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-23 02:24:43,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-23 02:24:43,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:24:43,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-23 02:24:43,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:24:43,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-23 02:24:43,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:24:43,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2018-11-23 02:24:43,070 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:24:43,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2018-11-23 02:24:43,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 02:24:43,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 02:24:43,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 02:24:43,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:24:43,071 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:24:43,071 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:24:43,071 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:24:43,071 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 02:24:43,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:24:43,071 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:24:43,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 02:24:43,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:24:43 BoogieIcfgContainer [2018-11-23 02:24:43,076 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 02:24:43,077 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:24:43,077 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:24:43,077 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:24:43,077 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:24:38" (3/4) ... [2018-11-23 02:24:43,080 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:24:43,080 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:24:43,081 INFO L168 Benchmark]: Toolchain (without parser) took 5483.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.7 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:24:43,081 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:24:43,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:24:43,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.98 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-23 02:24:43,083 INFO L168 Benchmark]: Boogie Preprocessor took 15.15 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-23 02:24:43,083 INFO L168 Benchmark]: RCFGBuilder took 234.66 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:24:43,083 INFO L168 Benchmark]: BuchiAutomizer took 4871.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.3 MB). Peak memory consumption was 81.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:24:43,084 INFO L168 Benchmark]: Witness Printer took 3.60 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-23 02:24:43,086 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.98 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 15.15 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 234.66 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4871.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.3 MB). Peak memory consumption was 81.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.60 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 -1 * i + l1 and consists of 3 locations. One deterministic module has affine ranking function -1 * B + -4 * j + unknown-#length-unknown[B] 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 4.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.2s. Construction of modules took 0.0s. 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: 126 SDtfs, 117 SDslu, 57 SDs, 0 SdLazy, 76 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital264 mio100 ax106 hnf99 lsp84 ukn88 mio100 lsp50 div100 bol100 ite100 ukn100 eq185 hnf90 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms 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...