./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/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 12e277c835ccbb2e237f5234b2aa8358e814750b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 13:17:37,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 13:17:37,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 13:17:37,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 13:17:37,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 13:17:37,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 13:17:37,342 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 13:17:37,343 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 13:17:37,343 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 13:17:37,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 13:17:37,344 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 13:17:37,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 13:17:37,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 13:17:37,345 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 13:17:37,346 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 13:17:37,346 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 13:17:37,347 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 13:17:37,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 13:17:37,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 13:17:37,349 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 13:17:37,350 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 13:17:37,350 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 13:17:37,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 13:17:37,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 13:17:37,351 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 13:17:37,352 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 13:17:37,352 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 13:17:37,353 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 13:17:37,353 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 13:17:37,354 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 13:17:37,354 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 13:17:37,354 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 13:17:37,354 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 13:17:37,354 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 13:17:37,355 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 13:17:37,355 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 13:17:37,355 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 13:17:37,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 13:17:37,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 13:17:37,364 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 13:17:37,364 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 13:17:37,364 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 13:17:37,364 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 13:17:37,364 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 13:17:37,364 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 13:17:37,365 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 13:17:37,365 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 13:17:37,365 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 13:17:37,365 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 13:17:37,365 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 13:17:37,365 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 13:17:37,365 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 13:17:37,365 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 13:17:37,365 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 13:17:37,365 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 13:17:37,365 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 13:17:37,366 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 13:17:37,366 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 13:17:37,366 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 13:17:37,366 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 13:17:37,366 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 13:17:37,366 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 13:17:37,366 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 13:17:37,366 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 13:17:37,366 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 13:17:37,366 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 13:17:37,367 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 13:17:37,367 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 13:17:37,367 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 13:17:37,367 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_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/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 -> 12e277c835ccbb2e237f5234b2aa8358e814750b [2018-12-01 13:17:37,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 13:17:37,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 13:17:37,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 13:17:37,398 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 13:17:37,398 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 13:17:37,398 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-12-01 13:17:37,445 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/bin-2019/uautomizer/data/be37082c6/7a1be7b93fe04492bb05d1e7ab680eea/FLAGb3ce1c84f [2018-12-01 13:17:37,954 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 13:17:37,955 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-12-01 13:17:37,962 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/bin-2019/uautomizer/data/be37082c6/7a1be7b93fe04492bb05d1e7ab680eea/FLAGb3ce1c84f [2018-12-01 13:17:38,478 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/bin-2019/uautomizer/data/be37082c6/7a1be7b93fe04492bb05d1e7ab680eea [2018-12-01 13:17:38,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 13:17:38,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 13:17:38,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 13:17:38,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 13:17:38,484 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 13:17:38,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:17:38" (1/1) ... [2018-12-01 13:17:38,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142c46d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:17:38, skipping insertion in model container [2018-12-01 13:17:38,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:17:38" (1/1) ... [2018-12-01 13:17:38,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 13:17:38,518 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 13:17:38,762 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:17:38,774 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 13:17:38,811 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:17:38,846 INFO L195 MainTranslator]: Completed translation [2018-12-01 13:17:38,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:17:38 WrapperNode [2018-12-01 13:17:38,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 13:17:38,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 13:17:38,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 13:17:38,847 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 13:17:38,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:17:38" (1/1) ... [2018-12-01 13:17:38,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:17:38" (1/1) ... [2018-12-01 13:17:38,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 13:17:38,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 13:17:38,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 13:17:38,876 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 13:17:38,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:17:38" (1/1) ... [2018-12-01 13:17:38,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:17:38" (1/1) ... [2018-12-01 13:17:38,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:17:38" (1/1) ... [2018-12-01 13:17:38,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:17:38" (1/1) ... [2018-12-01 13:17:38,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:17:38" (1/1) ... [2018-12-01 13:17:38,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:17:38" (1/1) ... [2018-12-01 13:17:38,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:17:38" (1/1) ... [2018-12-01 13:17:38,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 13:17:38,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 13:17:38,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 13:17:38,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 13:17:38,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:17:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a2ed2a3-4578-47ae-bebc-542afe8fdae7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:17:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 13:17:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 13:17:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 13:17:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 13:17:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-01 13:17:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 13:17:38,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 13:17:39,054 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 13:17:39,054 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-12-01 13:17:39,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:17:39 BoogieIcfgContainer [2018-12-01 13:17:39,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 13:17:39,055 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 13:17:39,055 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 13:17:39,057 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 13:17:39,058 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 13:17:39,058 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 01:17:38" (1/3) ... [2018-12-01 13:17:39,059 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@591d13b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 01:17:39, skipping insertion in model container [2018-12-01 13:17:39,059 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 13:17:39,059 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:17:38" (2/3) ... [2018-12-01 13:17:39,060 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@591d13b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 01:17:39, skipping insertion in model container [2018-12-01 13:17:39,060 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 13:17:39,060 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:17:39" (3/3) ... [2018-12-01 13:17:39,061 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-12-01 13:17:39,092 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 13:17:39,092 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 13:17:39,092 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 13:17:39,092 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 13:17:39,093 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 13:17:39,093 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 13:17:39,093 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 13:17:39,093 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 13:17:39,093 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 13:17:39,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-01 13:17:39,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-01 13:17:39,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:17:39,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:17:39,121 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 13:17:39,122 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 13:17:39,122 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 13:17:39,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-01 13:17:39,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-01 13:17:39,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:17:39,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:17:39,123 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 13:17:39,124 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 13:17:39,128 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 8#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 14#L1073true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 10#L1076true entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 3#L1444true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 5#L1445-3true [2018-12-01 13:17:39,128 INFO L796 eck$LassoCheckResult]: Loop: 5#L1445-3true assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 18#L1073-1true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 11#L1076-1true entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 13#L1447true assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 4#L1445-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 5#L1445-3true [2018-12-01 13:17:39,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-12-01 13:17:39,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:17:39,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:17:39,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:39,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:17:39,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:17:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:17:39,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:17:39,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 13:17:39,238 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 13:17:39,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2018-12-01 13:17:39,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:17:39,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:17:39,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:39,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:17:39,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:39,369 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-12-01 13:17:39,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 13:17:39,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:17:39,427 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2018-12-01 13:17:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:17:39,465 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-12-01 13:17:39,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 13:17:39,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-12-01 13:17:39,468 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-01 13:17:39,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 23 transitions. [2018-12-01 13:17:39,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-01 13:17:39,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-01 13:17:39,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-12-01 13:17:39,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 13:17:39,473 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-01 13:17:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-12-01 13:17:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-12-01 13:17:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-01 13:17:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-01 13:17:39,489 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-01 13:17:39,489 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-01 13:17:39,489 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 13:17:39,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-12-01 13:17:39,490 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-01 13:17:39,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:17:39,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:17:39,490 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 13:17:39,490 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 13:17:39,491 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 66#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 67#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 68#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 60#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 61#L1445-3 [2018-12-01 13:17:39,491 INFO L796 eck$LassoCheckResult]: Loop: 61#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 63#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 69#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 70#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 62#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 61#L1445-3 [2018-12-01 13:17:39,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:39,491 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2018-12-01 13:17:39,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:17:39,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:17:39,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:39,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:17:39,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:39,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:39,508 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2018-12-01 13:17:39,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:17:39,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:17:39,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:39,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:17:39,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:39,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:39,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2018-12-01 13:17:39,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:17:39,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:17:39,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:39,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:17:39,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:39,656 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-12-01 13:17:39,854 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 13:17:39,855 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 13:17:39,855 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 13:17:39,855 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 13:17:39,855 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 13:17:39,855 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:17:39,855 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 13:17:39,855 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 13:17:39,855 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2_false-valid-memtrack_true-termination.i_Iteration2_Lasso [2018-12-01 13:17:39,856 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 13:17:39,856 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 13:17:39,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:39,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:39,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:39,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:39,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:39,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:39,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:39,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:39,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:39,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:39,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:39,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:39,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:39,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:40,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:40,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:40,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:40,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:40,318 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 13:17:40,321 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 13:17:40,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:40,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:40,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:40,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:40,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:40,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:40,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:40,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:40,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:40,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:40,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:40,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:40,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:40,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:40,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:40,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:40,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:40,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:40,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:40,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:40,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:40,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:40,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:40,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:40,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:40,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:40,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:40,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:40,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:40,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:40,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:40,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:40,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:40,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:40,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:40,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:40,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:40,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:40,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:40,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,383 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 13:17:40,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,385 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 13:17:40,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:40,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:40,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:40,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:40,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:40,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:40,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:40,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:40,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:40,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:40,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:40,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:40,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:40,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:40,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:40,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:40,439 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 13:17:40,456 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 13:17:40,456 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-01 13:17:40,457 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 13:17:40,458 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 13:17:40,459 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 13:17:40,459 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~0) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~0 Supporting invariants [] [2018-12-01 13:17:40,470 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-12-01 13:17:40,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:17:40,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:17:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:17:40,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:17:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:17:40,537 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-12-01 13:17:40,538 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-01 13:17:40,560 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 21 states and 26 transitions. Complement of second has 4 states. [2018-12-01 13:17:40,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 13:17:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 13:17:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-01 13:17:40,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 5 letters. [2018-12-01 13:17:40,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:17:40,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 5 letters. [2018-12-01 13:17:40,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:17:40,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-01 13:17:40,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:17:40,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-12-01 13:17:40,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:17:40,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2018-12-01 13:17:40,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-01 13:17:40,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-01 13:17:40,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2018-12-01 13:17:40,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 13:17:40,565 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-01 13:17:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2018-12-01 13:17:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-01 13:17:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-01 13:17:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-01 13:17:40,566 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-01 13:17:40,566 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-01 13:17:40,566 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 13:17:40,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-12-01 13:17:40,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:17:40,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:17:40,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:17:40,567 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:17:40,567 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 13:17:40,567 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 172#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 173#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 174#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 164#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 165#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 169#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 175#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 176#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 180#L1447-1 entry_point_~j~0 := entry_point_~i~0 - 1; 171#L1453-3 [2018-12-01 13:17:40,567 INFO L796 eck$LassoCheckResult]: Loop: 171#L1453-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 170#L1453-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 171#L1453-3 [2018-12-01 13:17:40,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:40,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218534, now seen corresponding path program 1 times [2018-12-01 13:17:40,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:17:40,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:17:40,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:17:40,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:40,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:40,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 1 times [2018-12-01 13:17:40,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:17:40,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:17:40,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:17:40,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:40,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:40,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2113389244, now seen corresponding path program 1 times [2018-12-01 13:17:40,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:17:40,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:17:40,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:17:40,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:17:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:17:40,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:17:40,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:17:40,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 13:17:40,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:17:40,637 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-01 13:17:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:17:40,652 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-12-01 13:17:40,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 13:17:40,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-12-01 13:17:40,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:17:40,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 25 transitions. [2018-12-01 13:17:40,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-01 13:17:40,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-01 13:17:40,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2018-12-01 13:17:40,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 13:17:40,653 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-01 13:17:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2018-12-01 13:17:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-12-01 13:17:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-01 13:17:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-12-01 13:17:40,654 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-01 13:17:40,654 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-01 13:17:40,654 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 13:17:40,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-12-01 13:17:40,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:17:40,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:17:40,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:17:40,655 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:17:40,655 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 13:17:40,655 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 226#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 227#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 228#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 218#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 219#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 222#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 231#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 232#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 220#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 221#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 223#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 229#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 230#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 234#L1447-1 entry_point_~j~0 := entry_point_~i~0 - 1; 225#L1453-3 [2018-12-01 13:17:40,655 INFO L796 eck$LassoCheckResult]: Loop: 225#L1453-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 224#L1453-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 225#L1453-3 [2018-12-01 13:17:40,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:40,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1659616398, now seen corresponding path program 1 times [2018-12-01 13:17:40,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:17:40,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:17:40,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:17:40,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:17:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:17:40,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:17:40,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:17:40,678 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 13:17:40,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:40,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 2 times [2018-12-01 13:17:40,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:17:40,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:17:40,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:17:40,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:40,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 13:17:40,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:17:40,704 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-12-01 13:17:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:17:40,722 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-12-01 13:17:40,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 13:17:40,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2018-12-01 13:17:40,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-01 13:17:40,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 24 transitions. [2018-12-01 13:17:40,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-01 13:17:40,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-01 13:17:40,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-12-01 13:17:40,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 13:17:40,724 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-01 13:17:40,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-12-01 13:17:40,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-12-01 13:17:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-01 13:17:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-01 13:17:40,725 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-01 13:17:40,725 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-01 13:17:40,725 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 13:17:40,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-12-01 13:17:40,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:17:40,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:17:40,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:17:40,726 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:17:40,726 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 13:17:40,726 INFO L794 eck$LassoCheckResult]: Stem: 283#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 276#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 277#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 278#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 268#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 269#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 272#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 281#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 282#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 270#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 271#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 273#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 279#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 280#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 284#L1447-1 entry_point_~j~0 := entry_point_~i~0 - 1; 275#L1453-3 [2018-12-01 13:17:40,726 INFO L796 eck$LassoCheckResult]: Loop: 275#L1453-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 274#L1453-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 275#L1453-3 [2018-12-01 13:17:40,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:40,727 INFO L82 PathProgramCache]: Analyzing trace with hash 979558028, now seen corresponding path program 1 times [2018-12-01 13:17:40,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:17:40,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:17:40,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:17:40,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:40,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:40,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 3 times [2018-12-01 13:17:40,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:17:40,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:17:40,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:17:40,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:40,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:40,743 INFO L82 PathProgramCache]: Analyzing trace with hash 757428654, now seen corresponding path program 1 times [2018-12-01 13:17:40,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:17:40,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:17:40,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:17:40,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:17:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:17:41,055 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 141 [2018-12-01 13:17:41,124 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 13:17:41,124 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 13:17:41,124 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 13:17:41,124 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 13:17:41,124 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 13:17:41,125 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:17:41,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 13:17:41,125 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 13:17:41,125 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2_false-valid-memtrack_true-termination.i_Iteration5_Lasso [2018-12-01 13:17:41,125 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 13:17:41,125 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 13:17:41,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:17:41,420 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 13:17:41,420 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 13:17:41,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:41,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:41,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:41,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:41,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:41,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:41,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:41,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:41,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:41,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:41,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:41,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:41,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:41,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:41,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:41,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:41,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:41,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:41,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:41,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:41,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:41,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:41,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:41,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:41,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:41,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:41,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:41,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:41,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:41,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:41,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:41,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:41,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:41,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:41,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:41,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:41,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:41,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:41,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:41,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:41,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:41,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:41,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:41,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:41,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:41,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:41,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:41,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:41,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:41,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:41,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:41,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:41,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:41,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:41,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:41,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:41,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:41,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:41,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:41,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:41,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:41,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:17:41,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:41,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:41,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:41,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:17:41,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:17:41,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:17:41,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:17:41,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:17:41,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:17:41,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:17:41,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:17:41,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:17:41,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:17:41,440 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 13:17:41,445 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 13:17:41,446 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-01 13:17:41,446 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 13:17:41,447 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 13:17:41,447 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 13:17:41,447 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0) = 2*ULTIMATE.start_entry_point_~j~0 + 1 Supporting invariants [] [2018-12-01 13:17:41,456 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-12-01 13:17:41,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:17:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:17:41,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:17:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:17:41,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:17:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:17:41,489 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-12-01 13:17:41,489 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-01 13:17:41,495 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 22 transitions. Complement of second has 4 states. [2018-12-01 13:17:41,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 13:17:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 13:17:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-01 13:17:41,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 2 letters. [2018-12-01 13:17:41,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:17:41,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 17 letters. Loop has 2 letters. [2018-12-01 13:17:41,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:17:41,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-01 13:17:41,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:17:41,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2018-12-01 13:17:41,497 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 13:17:41,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-12-01 13:17:41,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 13:17:41,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 13:17:41,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 13:17:41,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 13:17:41,498 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 13:17:41,498 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 13:17:41,498 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 13:17:41,498 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 13:17:41,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 13:17:41,498 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 13:17:41,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 13:17:41,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 01:17:41 BoogieIcfgContainer [2018-12-01 13:17:41,504 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 13:17:41,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 13:17:41,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 13:17:41,504 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 13:17:41,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:17:39" (3/4) ... [2018-12-01 13:17:41,507 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 13:17:41,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 13:17:41,508 INFO L168 Benchmark]: Toolchain (without parser) took 3027.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -100.6 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. [2018-12-01 13:17:41,509 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 13:17:41,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -136.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-01 13:17:41,510 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 13:17:41,510 INFO L168 Benchmark]: Boogie Preprocessor took 16.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 13:17:41,510 INFO L168 Benchmark]: RCFGBuilder took 162.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-01 13:17:41,511 INFO L168 Benchmark]: BuchiAutomizer took 2449.00 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 68.3 MB. Max. memory is 11.5 GB. [2018-12-01 13:17:41,511 INFO L168 Benchmark]: Witness Printer took 3.44 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-12-01 13:17:41,514 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -136.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 162.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2449.00 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 68.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.44 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 59 SDslu, 71 SDs, 0 SdLazy, 59 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital237 mio100 ax112 hnf101 lsp81 ukn53 mio100 lsp57 div100 bol100 ite100 ukn100 eq187 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...