./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/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 32bit --witnessprinter.graph.data.programhash 986c31897144a5b76f321e97eaa1d3383cce25ed ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:36:40,944 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:36:40,945 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:36:40,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:36:40,951 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:36:40,951 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:36:40,952 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:36:40,953 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:36:40,954 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:36:40,954 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:36:40,954 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:36:40,955 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:36:40,955 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:36:40,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:36:40,956 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:36:40,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:36:40,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:36:40,958 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:36:40,960 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:36:40,961 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:36:40,961 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:36:40,962 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:36:40,964 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:36:40,964 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:36:40,964 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:36:40,964 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:36:40,965 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:36:40,965 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:36:40,966 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:36:40,967 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:36:40,967 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:36:40,967 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:36:40,967 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:36:40,968 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:36:40,968 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:36:40,969 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:36:40,969 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 02:36:40,978 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:36:40,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:36:40,979 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:36:40,979 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:36:40,979 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:36:40,979 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 02:36:40,980 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 02:36:40,980 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 02:36:40,980 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 02:36:40,980 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 02:36:40,980 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 02:36:40,980 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:36:40,980 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:36:40,981 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 02:36:40,981 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:36:40,981 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:36:40,981 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:36:40,981 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 02:36:40,981 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 02:36:40,981 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 02:36:40,981 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:36:40,982 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:36:40,982 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 02:36:40,982 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:36:40,982 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 02:36:40,982 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:36:40,982 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:36:40,982 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 02:36:40,982 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:36:40,983 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:36:40,983 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 02:36:40,983 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 02:36:40,984 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_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 986c31897144a5b76f321e97eaa1d3383cce25ed [2018-11-23 02:36:41,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:36:41,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:36:41,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:36:41,020 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:36:41,020 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:36:41,020 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-11-23 02:36:41,066 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/bin-2019/uautomizer/data/1ec3b2cbb/a708d2a579dc489dbcf82663ee668d8b/FLAGae0d12ac2 [2018-11-23 02:36:41,505 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:36:41,505 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-11-23 02:36:41,514 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/bin-2019/uautomizer/data/1ec3b2cbb/a708d2a579dc489dbcf82663ee668d8b/FLAGae0d12ac2 [2018-11-23 02:36:41,523 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/bin-2019/uautomizer/data/1ec3b2cbb/a708d2a579dc489dbcf82663ee668d8b [2018-11-23 02:36:41,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:36:41,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:36:41,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:36:41,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:36:41,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:36:41,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:41" (1/1) ... [2018-11-23 02:36:41,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c056607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:41, skipping insertion in model container [2018-11-23 02:36:41,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:41" (1/1) ... [2018-11-23 02:36:41,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:36:41,565 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:36:41,759 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:36:41,766 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:36:41,838 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:36:41,868 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:36:41,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:41 WrapperNode [2018-11-23 02:36:41,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:36:41,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:36:41,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:36:41,869 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:36:41,874 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:36:41" (1/1) ... [2018-11-23 02:36:41,882 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:36:41" (1/1) ... [2018-11-23 02:36:41,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:36:41,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:36:41,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:36:41,895 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:36:41,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:41" (1/1) ... [2018-11-23 02:36:41,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:41" (1/1) ... [2018-11-23 02:36:41,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:41" (1/1) ... [2018-11-23 02:36:41,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:41" (1/1) ... [2018-11-23 02:36:41,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:41" (1/1) ... [2018-11-23 02:36:41,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:41" (1/1) ... [2018-11-23 02:36:41,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:41" (1/1) ... [2018-11-23 02:36:41,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:36:41,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:36:41,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:36:41,912 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:36:41,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c4fb8e7-c014-4211-8a81-b3a15a52e14e/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:36:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:36:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:36:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:36:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:36:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:36:41,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:36:42,106 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:36:42,106 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 02:36:42,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:42 BoogieIcfgContainer [2018-11-23 02:36:42,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:36:42,107 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 02:36:42,107 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 02:36:42,110 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 02:36:42,111 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:36:42,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:36:41" (1/3) ... [2018-11-23 02:36:42,112 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a4d5e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:36:42, skipping insertion in model container [2018-11-23 02:36:42,112 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:36:42,112 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:41" (2/3) ... [2018-11-23 02:36:42,112 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a4d5e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:36:42, skipping insertion in model container [2018-11-23 02:36:42,112 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:36:42,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:42" (3/3) ... [2018-11-23 02:36:42,114 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-11-23 02:36:42,151 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:36:42,152 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 02:36:42,152 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 02:36:42,152 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 02:36:42,152 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:36:42,152 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:36:42,153 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 02:36:42,153 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:36:42,153 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 02:36:42,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 02:36:42,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:36:42,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:36:42,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:36:42,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:36:42,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:36:42,183 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 02:36:42,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 02:36:42,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:36:42,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:36:42,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:36:42,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:36:42,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:36:42,192 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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; 5#L567true assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 9#L567-2true assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 4#L570-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; 7#L547-2true [2018-11-23 02:36:42,192 INFO L796 eck$LassoCheckResult]: Loop: 7#L547-2true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 16#L551-2true assume !true; 3#L550-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; 6#L557-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 7#L547-2true [2018-11-23 02:36:42,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 02:36:42,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:42,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:42,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:42,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:42,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:42,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2018-11-23 02:36:42,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:42,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:42,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:42,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:42,318 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:36:42,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:36:42,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:36:42,322 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:36:42,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:36:42,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:36:42,333 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-23 02:36:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:36:42,337 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-11-23 02:36:42,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:36:42,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-11-23 02:36:42,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:36:42,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2018-11-23 02:36:42,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:36:42,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:36:42,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2018-11-23 02:36:42,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:36:42,344 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-23 02:36:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2018-11-23 02:36:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 02:36:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 02:36:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-11-23 02:36:42,363 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-23 02:36:42,363 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-23 02:36:42,363 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 02:36:42,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2018-11-23 02:36:42,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:36:42,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:36:42,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:36:42,364 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:36:42,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:36:42,364 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#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; 39#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 43#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 40#L570-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; 41#L547-2 [2018-11-23 02:36:42,364 INFO L796 eck$LassoCheckResult]: Loop: 41#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 45#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 36#L550-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; 37#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 41#L547-2 [2018-11-23 02:36:42,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 02:36:42,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:42,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:42,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:42,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:42,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:42,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2018-11-23 02:36:42,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:42,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:42,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:36:42,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:42,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:42,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2018-11-23 02:36:42,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:42,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:42,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:42,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:42,475 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:36:42,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:36:42,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:36:42,581 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-11-23 02:36:42,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:36:42,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:36:42,618 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-23 02:36:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:36:42,656 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2018-11-23 02:36:42,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:36:42,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2018-11-23 02:36:42,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 02:36:42,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2018-11-23 02:36:42,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 02:36:42,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 02:36:42,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2018-11-23 02:36:42,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:36:42,659 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-23 02:36:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2018-11-23 02:36:42,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-23 02:36:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 02:36:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-11-23 02:36:42,660 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-23 02:36:42,660 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-23 02:36:42,661 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 02:36:42,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-11-23 02:36:42,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 02:36:42,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:36:42,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:36:42,663 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:36:42,663 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 02:36:42,663 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#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; 75#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 81#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 76#L570-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; 77#L547-2 [2018-11-23 02:36:42,663 INFO L796 eck$LassoCheckResult]: Loop: 77#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 82#L551-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); 79#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 80#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 72#L550-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; 73#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 77#L547-2 [2018-11-23 02:36:42,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:42,663 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2018-11-23 02:36:42,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:42,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:42,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:42,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:42,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:42,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2018-11-23 02:36:42,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:42,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:42,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:36:42,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:42,695 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:36:42,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:36:42,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:36:42,695 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:36:42,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:36:42,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:36:42,696 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-23 02:36:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:36:42,720 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-11-23 02:36:42,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:36:42,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-23 02:36:42,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 02:36:42,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-11-23 02:36:42,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 02:36:42,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 02:36:42,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-23 02:36:42,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:36:42,722 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-23 02:36:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-23 02:36:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-11-23 02:36:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 02:36:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-11-23 02:36:42,723 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-23 02:36:42,724 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-23 02:36:42,724 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 02:36:42,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-11-23 02:36:42,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 02:36:42,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:36:42,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:36:42,725 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:36:42,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 02:36:42,725 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 109#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; 110#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 117#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 111#L570-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; 112#L547-2 [2018-11-23 02:36:42,725 INFO L796 eck$LassoCheckResult]: Loop: 112#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 118#L551-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); 114#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 115#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 107#L550-2 assume !(0 == diff_~found~0); 108#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 112#L547-2 [2018-11-23 02:36:42,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2018-11-23 02:36:42,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:42,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:42,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:42,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:42,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:42,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2018-11-23 02:36:42,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:42,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:42,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:36:42,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:42,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2018-11-23 02:36:42,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:42,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:42,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:42,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:43,053 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-23 02:36:43,157 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-11-23 02:36:43,166 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:36:43,167 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:36:43,167 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:36:43,167 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:36:43,167 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:36:43,167 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:36:43,167 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:36:43,167 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:36:43,167 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-23 02:36:43,167 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:36:43,168 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:36:43,183 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:36:43,187 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:36:43,188 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:36:43,190 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:36:43,192 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:36:43,193 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:36:43,195 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:36:43,196 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:36:43,198 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:36:43,199 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:36:43,200 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:36:43,202 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:36:43,203 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:36:43,204 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:36:43,438 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2018-11-23 02:36:43,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:43,865 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:36:43,869 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:36:43,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:36:43,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:43,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:43,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:43,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:43,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:43,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:43,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:43,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:36:43,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:43,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:43,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:36:43,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:43,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:43,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:43,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:43,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:43,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:43,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:36:43,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:43,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:43,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:36:43,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:43,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:43,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:43,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:36:43,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:43,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:43,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:43,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:36:43,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:43,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:43,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:43,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:43,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:43,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:43,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:43,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:43,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:43,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:43,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:43,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:43,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:43,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:43,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:43,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:36:43,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:43,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:43,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:43,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:36:43,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,918 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:36:43,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,920 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:36:43,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:43,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:36:43,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:43,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:43,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:36:43,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:43,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:43,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:43,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:43,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:43,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:43,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,951 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:36:43,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,952 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:36:43,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:43,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:43,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:43,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:43,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,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:36:43,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:43,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:43,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:43,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,980 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:36:43,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,981 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:36:43,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:43,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:43,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:43,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:43,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:43,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:43,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:43,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:43,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:43,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:43,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:43,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:43,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:44,017 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:36:44,046 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-23 02:36:44,046 INFO L444 ModelExtractionUtils]: 29 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-23 02:36:44,047 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:36:44,048 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:36:44,048 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:36:44,049 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_diff_~A.base)_1, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~A.offset) = 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_1 - 4*ULTIMATE.start_diff_~i~0 - 1*ULTIMATE.start_diff_~A.offset Supporting invariants [] [2018-11-23 02:36:44,096 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 02:36:44,100 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 02:36:44,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:44,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:36:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:44,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:36:44,154 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:36:44,156 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:36:44,157 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-23 02:36:44,190 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 30 transitions. Complement of second has 6 states. [2018-11-23 02:36:44,190 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:36:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 02:36:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 02:36:44,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-23 02:36:44,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:36:44,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-23 02:36:44,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:36:44,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 12 letters. [2018-11-23 02:36:44,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:36:44,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2018-11-23 02:36:44,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 02:36:44,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2018-11-23 02:36:44,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 02:36:44,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 02:36:44,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-11-23 02:36:44,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:36:44,197 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-23 02:36:44,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-11-23 02:36:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-23 02:36:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 02:36:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-11-23 02:36:44,200 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-11-23 02:36:44,200 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-11-23 02:36:44,200 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 02:36:44,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2018-11-23 02:36:44,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 02:36:44,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:36:44,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:36:44,201 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 02:36:44,201 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:36:44,201 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 258#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 264#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 261#L570-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; 262#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 266#L551-2 [2018-11-23 02:36:44,201 INFO L796 eck$LassoCheckResult]: Loop: 266#L551-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); 265#L551 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; 266#L551-2 [2018-11-23 02:36:44,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:44,202 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2018-11-23 02:36:44,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:44,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:44,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:44,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:44,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:44,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:44,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2018-11-23 02:36:44,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:44,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:44,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:44,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:44,220 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2018-11-23 02:36:44,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:44,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:44,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:44,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:44,494 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 113 [2018-11-23 02:36:44,608 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-11-23 02:36:44,609 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:36:44,609 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:36:44,609 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:36:44,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:36:44,609 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:36:44,610 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:36:44,610 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:36:44,610 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:36:44,610 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-23 02:36:44,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:36:44,610 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:36:44,613 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:36:44,616 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:36:44,617 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:36:44,619 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:36:44,621 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:36:44,622 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:36:44,623 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:36:44,625 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:36:44,626 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:36:44,628 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:36:44,629 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:36:44,826 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2018-11-23 02:36:44,847 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:36:44,848 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:36:44,852 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:36:44,853 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:36:45,198 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:36:45,198 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:36:45,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:45,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:45,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:45,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:45,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:45,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:45,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:45,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:45,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:45,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:45,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:45,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:45,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:45,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:45,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:45,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:45,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:45,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:45,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:45,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:45,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:45,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:45,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:45,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:45,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:45,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:45,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:45,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,220 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:36:45,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,221 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:36:45,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:45,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:45,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:45,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,229 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:36:45,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,230 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:36:45,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:45,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:45,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:45,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:45,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:45,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:45,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,243 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:36:45,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,244 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 02:36:45,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:45,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:45,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:45,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:45,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:45,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:45,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:45,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:45,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:45,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:45,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:45,275 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:36:45,307 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 02:36:45,307 INFO L444 ModelExtractionUtils]: 64 out of 73 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 02:36:45,307 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:36:45,308 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:36:45,308 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:36:45,309 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:36:45,353 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 02:36:45,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:45,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:36:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:45,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:36:45,403 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:36:45,404 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:36:45,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 02:36:45,427 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:36:45,428 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:36:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:36:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 02:36:45,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-23 02:36:45,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:36:45,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 02:36:45,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:36:45,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 02:36:45,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:36:45,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2018-11-23 02:36:45,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 02:36:45,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2018-11-23 02:36:45,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 02:36:45,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 02:36:45,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2018-11-23 02:36:45,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:36:45,432 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2018-11-23 02:36:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2018-11-23 02:36:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-11-23 02:36:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 02:36:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-23 02:36:45,436 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 02:36:45,436 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 02:36:45,436 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 02:36:45,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-23 02:36:45,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 02:36:45,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:36:45,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:36:45,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:36:45,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:36:45,437 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 421#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; 422#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 430#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 423#L570-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; 424#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 432#L551-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 437#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 434#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 419#L550-2 assume !(0 == diff_~found~0); 420#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 431#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 427#L551-2 [2018-11-23 02:36:45,437 INFO L796 eck$LassoCheckResult]: Loop: 427#L551-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); 426#L551 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; 427#L551-2 [2018-11-23 02:36:45,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:45,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2018-11-23 02:36:45,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:45,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:45,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:45,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:45,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:45,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:45,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2018-11-23 02:36:45,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:45,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:45,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:45,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:36:45,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:45,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2018-11-23 02:36:45,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:36:45,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:36:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:45,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:36:45,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:45,951 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 136 [2018-11-23 02:36:46,045 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:36:46,045 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:36:46,046 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:36:46,046 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:36:46,046 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:36:46,046 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:36:46,046 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:36:46,046 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:36:46,046 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-23 02:36:46,046 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:36:46,046 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:36:46,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:46,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:46,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:46,263 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2018-11-23 02:36:46,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:46,290 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:36:46,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:46,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:46,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:46,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:46,298 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:36:46,299 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:36:46,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:36:46,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:36:46,303 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:36:46,304 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:36:46,640 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:36:46,640 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:36:46,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:46,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:46,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:36:46,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:46,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:46,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:46,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:36:46,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:36:46,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:46,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:46,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:46,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:46,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:46,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:46,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:46,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:46,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:46,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:46,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:46,645 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:36:46,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:46,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:46,650 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:36:46,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:46,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:46,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:46,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:46,654 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:36:46,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:46,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:46,656 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:36:46,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:46,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:46,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:46,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:46,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:46,660 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:36:46,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:46,662 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 02:36:46,662 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 02:36:46,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:36:46,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:36:46,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:36:46,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:36:46,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:36:46,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:36:46,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:36:46,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:36:46,710 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:36:46,733 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 02:36:46,733 INFO L444 ModelExtractionUtils]: 64 out of 73 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 02:36:46,734 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:36:46,734 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:36:46,734 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:36:46,735 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~B.offset, v_rep(select #length ULTIMATE.start_diff_~B.base)_3, ULTIMATE.start_diff_~j~0) = -1*ULTIMATE.start_diff_~B.offset + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_3 - 4*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-11-23 02:36:46,777 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2018-11-23 02:36:46,782 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 02:36:46,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:46,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:36:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:46,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:36:46,816 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:36:46,816 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:36:46,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 02:36:46,832 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 36 states and 51 transitions. Complement of second has 7 states. [2018-11-23 02:36:46,833 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:36:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:36:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 02:36:46,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-23 02:36:46,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:36:46,833 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:36:46,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:46,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:36:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:46,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:36:46,870 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:36:46,870 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:36:46,870 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 02:36:46,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 36 states and 51 transitions. Complement of second has 7 states. [2018-11-23 02:36:46,883 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:36:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:36:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 02:36:46,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-23 02:36:46,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:36:46,883 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:36:46,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:46,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:36:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:46,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:36:46,922 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:36:46,923 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:36:46,923 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 02:36:46,942 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 34 states and 51 transitions. Complement of second has 6 states. [2018-11-23 02:36:46,942 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:36:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:36:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-23 02:36:46,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-23 02:36:46,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:36:46,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-23 02:36:46,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:36:46,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-23 02:36:46,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:36:46,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 51 transitions. [2018-11-23 02:36:46,945 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:36:46,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2018-11-23 02:36:46,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 02:36:46,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 02:36:46,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 02:36:46,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:36:46,945 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:36:46,945 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:36:46,946 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:36:46,946 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 02:36:46,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:36:46,946 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:36:46,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 02:36:46,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:36:46 BoogieIcfgContainer [2018-11-23 02:36:46,951 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 02:36:46,951 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:36:46,952 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:36:46,952 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:36:46,952 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:42" (3/4) ... [2018-11-23 02:36:46,955 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:36:46,955 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:36:46,956 INFO L168 Benchmark]: Toolchain (without parser) took 5429.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -128.0 MB). Peak memory consumption was 102.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:36:46,956 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:36:46,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:36:46,957 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.31 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:36:46,957 INFO L168 Benchmark]: Boogie Preprocessor took 16.22 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:36:46,957 INFO L168 Benchmark]: RCFGBuilder took 195.20 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:36:46,958 INFO L168 Benchmark]: BuchiAutomizer took 4843.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.5 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:36:46,958 INFO L168 Benchmark]: Witness Printer took 3.64 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:36:46,962 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.31 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.22 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 195.20 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 4843.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.5 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.64 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 - 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[A] + -4 * i + -1 * A and consists of 4 locations. One deterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function -1 * B + unknown-#length-unknown[B] + -4 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 7 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 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 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: 111 SDtfs, 127 SDslu, 50 SDs, 0 SdLazy, 75 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital274 mio100 ax100 hnf98 lsp90 ukn87 mio100 lsp52 div100 bol100 ite100 ukn100 eq182 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...