./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_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_a558273d-f1a2-48ea-addc-58a4ff31f2b9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a558273d-f1a2-48ea-addc-58a4ff31f2b9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a558273d-f1a2-48ea-addc-58a4ff31f2b9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a558273d-f1a2-48ea-addc-58a4ff31f2b9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a558273d-f1a2-48ea-addc-58a4ff31f2b9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a558273d-f1a2-48ea-addc-58a4ff31f2b9/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 f25230c4e3ada1aa4514132cfb87afb0e539c23b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 08:47:01,055 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 08:47:01,056 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 08:47:01,064 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 08:47:01,064 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 08:47:01,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 08:47:01,065 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 08:47:01,066 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 08:47:01,068 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 08:47:01,068 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 08:47:01,069 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 08:47:01,069 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 08:47:01,070 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 08:47:01,070 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 08:47:01,071 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 08:47:01,071 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 08:47:01,072 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 08:47:01,073 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 08:47:01,074 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 08:47:01,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 08:47:01,076 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 08:47:01,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 08:47:01,078 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 08:47:01,078 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 08:47:01,078 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 08:47:01,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 08:47:01,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 08:47:01,079 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 08:47:01,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 08:47:01,080 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 08:47:01,080 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 08:47:01,081 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 08:47:01,081 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 08:47:01,081 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 08:47:01,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 08:47:01,082 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 08:47:01,083 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a558273d-f1a2-48ea-addc-58a4ff31f2b9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 08:47:01,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 08:47:01,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 08:47:01,093 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 08:47:01,093 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 08:47:01,093 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 08:47:01,093 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 08:47:01,093 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 08:47:01,094 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 08:47:01,094 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 08:47:01,094 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 08:47:01,094 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 08:47:01,094 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 08:47:01,094 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 08:47:01,095 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 08:47:01,095 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 08:47:01,095 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 08:47:01,095 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 08:47:01,095 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 08:47:01,095 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 08:47:01,095 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 08:47:01,096 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 08:47:01,096 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 08:47:01,096 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 08:47:01,096 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 08:47:01,096 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 08:47:01,096 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 08:47:01,097 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 08:47:01,097 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 08:47:01,097 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 08:47:01,097 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 08:47:01,097 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 08:47:01,098 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 08:47:01,098 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_a558273d-f1a2-48ea-addc-58a4ff31f2b9/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 -> f25230c4e3ada1aa4514132cfb87afb0e539c23b [2018-12-08 08:47:01,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 08:47:01,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 08:47:01,130 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 08:47:01,131 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 08:47:01,131 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 08:47:01,132 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a558273d-f1a2-48ea-addc-58a4ff31f2b9/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-12-08 08:47:01,167 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a558273d-f1a2-48ea-addc-58a4ff31f2b9/bin-2019/uautomizer/data/628f92f43/fff3ddd93c8646138599cc034d1395ac/FLAGff258a3ac [2018-12-08 08:47:01,619 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 08:47:01,619 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a558273d-f1a2-48ea-addc-58a4ff31f2b9/sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-12-08 08:47:01,625 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a558273d-f1a2-48ea-addc-58a4ff31f2b9/bin-2019/uautomizer/data/628f92f43/fff3ddd93c8646138599cc034d1395ac/FLAGff258a3ac [2018-12-08 08:47:01,634 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a558273d-f1a2-48ea-addc-58a4ff31f2b9/bin-2019/uautomizer/data/628f92f43/fff3ddd93c8646138599cc034d1395ac [2018-12-08 08:47:01,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 08:47:01,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 08:47:01,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 08:47:01,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 08:47:01,639 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 08:47:01,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:47:01" (1/1) ... [2018-12-08 08:47:01,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4834854b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:47:01, skipping insertion in model container [2018-12-08 08:47:01,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:47:01" (1/1) ... [2018-12-08 08:47:01,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 08:47:01,663 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 08:47:01,800 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:47:01,806 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 08:47:01,867 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:47:01,892 INFO L195 MainTranslator]: Completed translation [2018-12-08 08:47:01,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:47:01 WrapperNode [2018-12-08 08:47:01,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 08:47:01,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 08:47:01,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 08:47:01,893 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 08:47:01,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:47:01" (1/1) ... [2018-12-08 08:47:01,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:47:01" (1/1) ... [2018-12-08 08:47:01,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 08:47:01,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 08:47:01,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 08:47:01,918 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 08:47:01,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:47:01" (1/1) ... [2018-12-08 08:47:01,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:47:01" (1/1) ... [2018-12-08 08:47:01,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:47:01" (1/1) ... [2018-12-08 08:47:01,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:47:01" (1/1) ... [2018-12-08 08:47:01,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:47:01" (1/1) ... [2018-12-08 08:47:01,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:47:01" (1/1) ... [2018-12-08 08:47:01,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:47:01" (1/1) ... [2018-12-08 08:47:01,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 08:47:01,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 08:47:01,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 08:47:01,931 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 08:47:01,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:47:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a558273d-f1a2-48ea-addc-58a4ff31f2b9/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-08 08:47:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 08:47:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 08:47:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 08:47:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 08:47:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 08:47:01,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 08:47:02,086 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 08:47:02,086 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-08 08:47:02,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:47:02 BoogieIcfgContainer [2018-12-08 08:47:02,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 08:47:02,087 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 08:47:02,088 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 08:47:02,091 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 08:47:02,091 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:47:02,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 08:47:01" (1/3) ... [2018-12-08 08:47:02,092 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b51b665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:47:02, skipping insertion in model container [2018-12-08 08:47:02,092 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:47:02,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:47:01" (2/3) ... [2018-12-08 08:47:02,092 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b51b665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:47:02, skipping insertion in model container [2018-12-08 08:47:02,093 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:47:02,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:47:02" (3/3) ... [2018-12-08 08:47:02,094 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-12-08 08:47:02,127 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 08:47:02,127 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 08:47:02,127 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 08:47:02,127 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 08:47:02,127 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 08:47:02,127 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 08:47:02,127 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 08:47:02,128 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 08:47:02,128 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 08:47:02,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 08:47:02,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 08:47:02,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:47:02,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:47:02,152 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 08:47:02,152 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 08:47:02,152 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 08:47:02,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 08:47:02,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 08:47:02,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:47:02,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:47:02,154 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 08:47:02,154 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 08:47:02,158 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 6#L544true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 11#L544-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 4#L546true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 7#L547-3true [2018-12-08 08:47:02,159 INFO L796 eck$LassoCheckResult]: Loop: 7#L547-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 19#L549true assume main_~val~0 < 0;main_~val~0 := 0; 3#L549-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 5#L547-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 7#L547-3true [2018-12-08 08:47:02,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:02,162 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-12-08 08:47:02,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:02,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:02,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:47:02,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:02,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:02,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2018-12-08 08:47:02,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:02,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:02,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:47:02,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:02,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2018-12-08 08:47:02,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:02,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:02,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:47:02,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:02,378 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:47:02,379 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:47:02,379 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:47:02,379 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:47:02,379 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:47:02,379 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:47:02,379 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:47:02,379 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:47:02,379 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-12-08 08:47:02,379 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:47:02,379 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:47:02,394 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-08 08:47:02,398 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-08 08:47:02,400 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-08 08:47:02,401 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-08 08:47:02,403 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-08 08:47:02,407 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-08 08:47:02,409 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-08 08:47:02,410 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-08 08:47:02,412 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-08 08:47:02,476 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-08 08:47:02,478 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-08 08:47:02,479 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-08 08:47:02,600 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:47:02,603 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:47:02,605 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-08 08:47:02,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:02,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:02,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:02,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:02,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:02,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:02,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:02,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:02,610 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-08 08:47:02,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:02,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:02,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:02,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:02,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:02,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:02,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:02,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:02,612 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-08 08:47:02,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:02,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:02,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:02,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:02,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:02,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:02,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:02,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:02,614 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-08 08:47:02,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:02,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:02,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:02,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:02,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:02,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:02,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:02,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:02,616 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-08 08:47:02,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:02,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:02,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:02,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:02,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:02,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:02,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:02,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:47:02,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:02,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:02,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:02,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:02,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:02,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:02,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:02,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:02,625 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-08 08:47:02,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:02,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:02,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:02,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:02,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:02,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:02,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:02,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:02,627 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-08 08:47:02,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:02,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:02,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:02,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:02,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:02,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:02,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:02,631 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-08 08:47:02,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:02,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:02,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:02,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:02,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:02,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:02,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:02,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:47:02,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:02,643 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:47:02,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:02,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:02,645 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:47:02,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:02,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:02,652 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-08 08:47:02,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:02,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:02,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:02,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:02,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:02,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:02,678 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:47:02,701 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 08:47:02,701 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 08:47:02,702 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:47:02,703 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:47:02,704 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:47:02,704 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-12-08 08:47:02,712 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 08:47:02,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:02,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:02,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:02,758 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-08 08:47:02,768 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-08 08:47:02,769 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2018-12-08 08:47:02,801 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2018-12-08 08:47:02,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 08:47:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:47:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-12-08 08:47:02,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-08 08:47:02,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:02,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-08 08:47:02,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:02,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-08 08:47:02,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:02,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2018-12-08 08:47:02,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 08:47:02,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-12-08 08:47:02,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 08:47:02,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 08:47:02,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-12-08 08:47:02,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:47:02,811 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-08 08:47:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-12-08 08:47:02,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-08 08:47:02,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-08 08:47:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-12-08 08:47:02,827 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-08 08:47:02,827 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-08 08:47:02,827 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 08:47:02,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-12-08 08:47:02,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 08:47:02,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:47:02,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:47:02,828 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:47:02,828 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 08:47:02,829 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 132#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 133#L544-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 129#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 130#L547-3 assume !(main_~i~0 < main_~length~0); 134#L547-4 main_~j~0 := 0; 139#L554-3 [2018-12-08 08:47:02,829 INFO L796 eck$LassoCheckResult]: Loop: 139#L554-3 assume !!(main_~j~0 < main_~length~0); 138#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 136#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 137#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 139#L554-3 [2018-12-08 08:47:02,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:02,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2018-12-08 08:47:02,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:02,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:02,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:47:02,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:02,857 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-08 08:47:02,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:47:02,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 08:47:02,860 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:47:02,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:02,860 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2018-12-08 08:47:02,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:02,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:47:02,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:02,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:47:02,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:47:02,900 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-12-08 08:47:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:47:02,917 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-08 08:47:02,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:47:02,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-08 08:47:02,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 08:47:02,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2018-12-08 08:47:02,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 08:47:02,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 08:47:02,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-12-08 08:47:02,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:47:02,919 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-12-08 08:47:02,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-12-08 08:47:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-12-08 08:47:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-08 08:47:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-08 08:47:02,920 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-08 08:47:02,920 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-08 08:47:02,920 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 08:47:02,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-08 08:47:02,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 08:47:02,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:47:02,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:47:02,921 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:47:02,921 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 08:47:02,922 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 180#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 172#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 173#L544-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 169#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 170#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 174#L549 assume !(main_~val~0 < 0); 167#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 168#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 171#L547-3 assume !(main_~i~0 < main_~length~0); 175#L547-4 main_~j~0 := 0; 179#L554-3 [2018-12-08 08:47:02,922 INFO L796 eck$LassoCheckResult]: Loop: 179#L554-3 assume !!(main_~j~0 < main_~length~0); 178#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 176#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 177#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 179#L554-3 [2018-12-08 08:47:02,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:02,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2018-12-08 08:47:02,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:02,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:02,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:47:02,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:02,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:02,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2018-12-08 08:47:02,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:02,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:47:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:02,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2018-12-08 08:47:02,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:02,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:02,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:47:02,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:03,080 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:47:03,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:47:03,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:47:03,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:47:03,080 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:47:03,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:47:03,080 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:47:03,080 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:47:03,080 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-08 08:47:03,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:47:03,081 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:47:03,082 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-08 08:47:03,084 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-08 08:47:03,085 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-08 08:47:03,086 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-08 08:47:03,087 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-08 08:47:03,160 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-08 08:47:03,161 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-08 08:47:03,162 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-08 08:47:03,163 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-08 08:47:03,165 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-08 08:47:03,166 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-08 08:47:03,277 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:47:03,277 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:47:03,277 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-08 08:47:03,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:03,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:03,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:03,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:03,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:03,279 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-08 08:47:03,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:03,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:03,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:03,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:03,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:03,281 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-08 08:47:03,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:03,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:03,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:03,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:03,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:03,282 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-08 08:47:03,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:03,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:03,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:03,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:03,286 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-08 08:47:03,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,286 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:47:03,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,288 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:47:03,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:03,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:03,294 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-08 08:47:03,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:03,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:03,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:03,313 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:47:03,329 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 08:47:03,329 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-08 08:47:03,330 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:47:03,331 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:47:03,331 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:47:03,331 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-12-08 08:47:03,339 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 08:47:03,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:03,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:03,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:03,372 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-08 08:47:03,373 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-08 08:47:03,373 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-08 08:47:03,386 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 4 states. [2018-12-08 08:47:03,386 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-08 08:47:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:47:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-08 08:47:03,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-08 08:47:03,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:03,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-08 08:47:03,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:03,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 8 letters. [2018-12-08 08:47:03,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:03,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-12-08 08:47:03,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:47:03,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 25 transitions. [2018-12-08 08:47:03,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 08:47:03,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 08:47:03,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2018-12-08 08:47:03,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:47:03,389 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-08 08:47:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2018-12-08 08:47:03,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-08 08:47:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-08 08:47:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-12-08 08:47:03,391 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-08 08:47:03,391 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-08 08:47:03,391 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 08:47:03,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-12-08 08:47:03,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:47:03,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:47:03,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:47:03,392 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:47:03,392 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:47:03,392 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 294#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 286#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 287#L544-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 281#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 282#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 284#L549 assume !(main_~val~0 < 0); 279#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 280#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 283#L547-3 assume !(main_~i~0 < main_~length~0); 285#L547-4 main_~j~0 := 0; 293#L554-3 assume !!(main_~j~0 < main_~length~0); 289#L555-3 [2018-12-08 08:47:03,392 INFO L796 eck$LassoCheckResult]: Loop: 289#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 288#L555-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 289#L555-3 [2018-12-08 08:47:03,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:03,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2018-12-08 08:47:03,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:03,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:03,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:03,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:47:03,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:03,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:03,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2018-12-08 08:47:03,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:03,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:03,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:03,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:47:03,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:03,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:03,410 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2018-12-08 08:47:03,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:03,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:03,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:03,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:47:03,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:03,564 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:47:03,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:47:03,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:47:03,565 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:47:03,565 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:47:03,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:47:03,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:47:03,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:47:03,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-08 08:47:03,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:47:03,565 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:47:03,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:47:03,567 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-08 08:47:03,568 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-08 08:47:03,570 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-08 08:47:03,570 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-08 08:47:03,571 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-08 08:47:03,641 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-08 08:47:03,642 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-08 08:47:03,643 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-08 08:47:03,645 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-08 08:47:03,646 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-08 08:47:03,776 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:47:03,777 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:47:03,777 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-08 08:47:03,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:03,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:03,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:03,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:03,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:03,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:47:03,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:03,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:03,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:03,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:03,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:03,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:47:03,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:03,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:03,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:03,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:03,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:47:03,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:03,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:03,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:03,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:03,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:03,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:47:03,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:03,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:03,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:03,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:03,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:03,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:47:03,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:03,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:03,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:03,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:03,796 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-08 08:47:03,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:03,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:03,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:03,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:03,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:47:03,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,802 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:47:03,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,804 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:47:03,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:03,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:03,807 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-08 08:47:03,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:03,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:03,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:03,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:03,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:03,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:03,815 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:47:03,818 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 08:47:03,819 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 08:47:03,819 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:47:03,820 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:47:03,820 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:47:03,820 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2018-12-08 08:47:03,826 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 08:47:03,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 08:47:03,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:03,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:03,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:03,857 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-08 08:47:03,857 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-08 08:47:03,857 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-08 08:47:03,871 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 27 states and 35 transitions. Complement of second has 7 states. [2018-12-08 08:47:03,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 08:47:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:47:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-08 08:47:03,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-08 08:47:03,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:03,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-08 08:47:03,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:03,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2018-12-08 08:47:03,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:03,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-12-08 08:47:03,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:47:03,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2018-12-08 08:47:03,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 08:47:03,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 08:47:03,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2018-12-08 08:47:03,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:47:03,874 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-12-08 08:47:03,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2018-12-08 08:47:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-08 08:47:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-08 08:47:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-12-08 08:47:03,875 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-08 08:47:03,875 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-08 08:47:03,875 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 08:47:03,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2018-12-08 08:47:03,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:47:03,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:47:03,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:47:03,876 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:47:03,876 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:47:03,876 INFO L794 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 420#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 411#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 412#L544-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 408#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 409#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 413#L549 assume !(main_~val~0 < 0); 406#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 407#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 410#L547-3 assume !(main_~i~0 < main_~length~0); 414#L547-4 main_~j~0 := 0; 419#L554-3 assume !!(main_~j~0 < main_~length~0); 425#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 417#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 418#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 424#L554-3 assume !!(main_~j~0 < main_~length~0); 416#L555-3 [2018-12-08 08:47:03,876 INFO L796 eck$LassoCheckResult]: Loop: 416#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 415#L555-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 416#L555-3 [2018-12-08 08:47:03,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:03,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2018-12-08 08:47:03,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:03,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:03,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:03,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:47:03,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:47:03,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:47:03,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a558273d-f1a2-48ea-addc-58a4ff31f2b9/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:47:03,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 08:47:03,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 08:47:03,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:47:03,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:47:04,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:47:04,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-12-08 08:47:04,018 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:47:04,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:04,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2018-12-08 08:47:04,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:04,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:04,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:04,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:47:04,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:04,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 08:47:04,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-08 08:47:04,039 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2018-12-08 08:47:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:47:04,193 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-12-08 08:47:04,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 08:47:04,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2018-12-08 08:47:04,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:47:04,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2018-12-08 08:47:04,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 08:47:04,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 08:47:04,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-12-08 08:47:04,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:47:04,194 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-08 08:47:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-12-08 08:47:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-12-08 08:47:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-08 08:47:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-12-08 08:47:04,196 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-08 08:47:04,196 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-08 08:47:04,196 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 08:47:04,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2018-12-08 08:47:04,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:47:04,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:47:04,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:47:04,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:47:04,197 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:47:04,197 INFO L794 eck$LassoCheckResult]: Stem: 566#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 565#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 557#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 558#L544-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 551#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 552#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 555#L549 assume !(main_~val~0 < 0); 573#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 553#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 554#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 556#L549 assume !(main_~val~0 < 0); 549#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 550#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 571#L547-3 assume !(main_~i~0 < main_~length~0); 563#L547-4 main_~j~0 := 0; 564#L554-3 assume !!(main_~j~0 < main_~length~0); 562#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 572#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 569#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 570#L554-3 assume !!(main_~j~0 < main_~length~0); 560#L555-3 [2018-12-08 08:47:04,197 INFO L796 eck$LassoCheckResult]: Loop: 560#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 559#L555-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 560#L555-3 [2018-12-08 08:47:04,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:04,197 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2018-12-08 08:47:04,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:04,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:04,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:04,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:47:04,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:04,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2018-12-08 08:47:04,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:04,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:04,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:04,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:47:04,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:04,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:04,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2018-12-08 08:47:04,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:47:04,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:47:04,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:04,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:47:04,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:47:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:47:04,367 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2018-12-08 08:47:04,400 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:47:04,400 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:47:04,400 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:47:04,400 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:47:04,401 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:47:04,401 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:47:04,401 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:47:04,401 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:47:04,401 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-08 08:47:04,401 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:47:04,401 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:47:04,402 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-08 08:47:04,403 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-08 08:47:04,405 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-08 08:47:04,406 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-08 08:47:04,455 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-08 08:47:04,457 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-08 08:47:04,457 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-08 08:47:04,458 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-08 08:47:04,460 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-08 08:47:04,461 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-08 08:47:04,461 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-08 08:47:04,462 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-08 08:47:04,560 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:47:04,560 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:47:04,560 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-08 08:47:04,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:04,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:04,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:04,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:04,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:04,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:04,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:04,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:04,562 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-08 08:47:04,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:04,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:04,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:04,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:04,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:04,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:04,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:04,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:47:04,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:04,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:04,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:04,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:04,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:04,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:04,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:04,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:47:04,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:04,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:04,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:04,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:04,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:04,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:04,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:04,566 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-08 08:47:04,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:04,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:04,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:04,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:04,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:04,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:04,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:04,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:47:04,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:04,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:04,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:04,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:04,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:04,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:04,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:04,570 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-08 08:47:04,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:04,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:04,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:04,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:04,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:04,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:04,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:04,573 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-08 08:47:04,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:04,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:04,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:04,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:04,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:47:04,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:47:04,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:47:04,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:47:04,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:47:04,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:47:04,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:47:04,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:47:04,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:47:04,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:47:04,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:47:04,578 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:47:04,579 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 08:47:04,579 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 08:47:04,579 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:47:04,579 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 08:47:04,579 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:47:04,579 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3 Supporting invariants [] [2018-12-08 08:47:04,584 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 08:47:04,585 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 08:47:04,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:04,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:04,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:04,615 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-08 08:47:04,615 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-08 08:47:04,615 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-08 08:47:04,626 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-12-08 08:47:04,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 08:47:04,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:47:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-08 08:47:04,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-12-08 08:47:04,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:04,627 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 08:47:04,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:04,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:04,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:04,652 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-08 08:47:04,652 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 08:47:04,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-08 08:47:04,659 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-12-08 08:47:04,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 08:47:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:47:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-08 08:47:04,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-12-08 08:47:04,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:04,660 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 08:47:04,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:04,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:47:04,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:04,695 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-08 08:47:04,695 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 08:47:04,696 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-08 08:47:04,707 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2018-12-08 08:47:04,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 08:47:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:47:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-12-08 08:47:04,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2018-12-08 08:47:04,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:04,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2018-12-08 08:47:04,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:04,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2018-12-08 08:47:04,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:47:04,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2018-12-08 08:47:04,709 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:47:04,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-12-08 08:47:04,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 08:47:04,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 08:47:04,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 08:47:04,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:47:04,710 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:47:04,710 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:47:04,710 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:47:04,710 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 08:47:04,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 08:47:04,710 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:47:04,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 08:47:04,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 08:47:04 BoogieIcfgContainer [2018-12-08 08:47:04,714 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 08:47:04,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 08:47:04,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 08:47:04,714 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 08:47:04,715 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:47:02" (3/4) ... [2018-12-08 08:47:04,717 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 08:47:04,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 08:47:04,717 INFO L168 Benchmark]: Toolchain (without parser) took 3081.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.3 MB). Free memory was 950.6 MB in the beginning and 872.7 MB in the end (delta: 77.9 MB). Peak memory consumption was 311.2 MB. Max. memory is 11.5 GB. [2018-12-08 08:47:04,718 INFO L168 Benchmark]: CDTParser took 0.12 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-08 08:47:04,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:47:04,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.52 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-08 08:47:04,719 INFO L168 Benchmark]: Boogie Preprocessor took 13.54 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-08 08:47:04,720 INFO L168 Benchmark]: RCFGBuilder took 155.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-12-08 08:47:04,720 INFO L168 Benchmark]: BuchiAutomizer took 2626.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 872.7 MB in the end (delta: 239.5 MB). Peak memory consumption was 327.0 MB. Max. memory is 11.5 GB. [2018-12-08 08:47:04,720 INFO L168 Benchmark]: Witness Printer took 2.61 ms. Allocated memory is still 1.3 GB. Free memory is still 872.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:47:04,722 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.12 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 255.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.52 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. * Boogie Preprocessor took 13.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 155.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2626.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 872.7 MB in the end (delta: 239.5 MB). Peak memory consumption was 327.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.61 ms. Allocated memory is still 1.3 GB. Free memory is still 872.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 206 SDslu, 76 SDs, 0 SdLazy, 174 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital127 mio100 ax100 hnf98 lsp93 ukn80 mio100 lsp57 div100 bol100 ite100 ukn100 eq161 hnf90 smp93 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 2 VariablesLoop: 2 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...