./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array15_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array15_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 18:49:09,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:49:09,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:49:10,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:49:10,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:49:10,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:49:10,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:49:10,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:49:10,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:49:10,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:49:10,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:49:10,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:49:10,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:49:10,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:49:10,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:49:10,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:49:10,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:49:10,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:49:10,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:49:10,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:49:10,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:49:10,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:49:10,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:49:10,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:49:10,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:49:10,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:49:10,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:49:10,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:49:10,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:49:10,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:49:10,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:49:10,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:49:10,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:49:10,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:49:10,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:49:10,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:49:10,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:49:10,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:49:10,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:49:10,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:49:10,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:49:10,102 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-19 18:49:10,153 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:49:10,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:49:10,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:49:10,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:49:10,157 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:49:10,157 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:49:10,158 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:49:10,158 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:49:10,158 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:49:10,158 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:49:10,160 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:49:10,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:49:10,161 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:49:10,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:49:10,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:49:10,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:49:10,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:49:10,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:49:10,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:49:10,163 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:49:10,163 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:49:10,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:49:10,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:49:10,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:49:10,165 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:49:10,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:49:10,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:49:10,165 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:49:10,166 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:49:10,167 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:49:10,168 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 [2020-10-19 18:49:10,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:49:10,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:49:10,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:49:10,518 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:49:10,519 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:49:10,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array15_alloca.i [2020-10-19 18:49:10,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/076de4243/cd93fadd747c4b7e9a2364b73537fb39/FLAG41df34e1d [2020-10-19 18:49:11,153 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:49:11,154 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array15_alloca.i [2020-10-19 18:49:11,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/076de4243/cd93fadd747c4b7e9a2364b73537fb39/FLAG41df34e1d [2020-10-19 18:49:11,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/076de4243/cd93fadd747c4b7e9a2364b73537fb39 [2020-10-19 18:49:11,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:49:11,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:49:11,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:49:11,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:49:11,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:49:11,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:49:11" (1/1) ... [2020-10-19 18:49:11,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516a423c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:11, skipping insertion in model container [2020-10-19 18:49:11,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:49:11" (1/1) ... [2020-10-19 18:49:11,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:49:11,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:49:11,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:49:11,945 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:49:12,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:49:12,145 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:49:12,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:12 WrapperNode [2020-10-19 18:49:12,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:49:12,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:49:12,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:49:12,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:49:12,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:12" (1/1) ... [2020-10-19 18:49:12,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:12" (1/1) ... [2020-10-19 18:49:12,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:49:12,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:49:12,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:49:12,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:49:12,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:12" (1/1) ... [2020-10-19 18:49:12,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:12" (1/1) ... [2020-10-19 18:49:12,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:12" (1/1) ... [2020-10-19 18:49:12,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:12" (1/1) ... [2020-10-19 18:49:12,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:12" (1/1) ... [2020-10-19 18:49:12,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:12" (1/1) ... [2020-10-19 18:49:12,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:12" (1/1) ... [2020-10-19 18:49:12,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:49:12,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:49:12,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:49:12,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:49:12,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-19 18:49:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 18:49:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:49:12,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 18:49:12,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 18:49:12,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:49:12,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:49:12,550 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:49:12,551 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-19 18:49:12,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:49:12 BoogieIcfgContainer [2020-10-19 18:49:12,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:49:12,554 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:49:12,555 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:49:12,558 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:49:12,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:49:12,560 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:49:11" (1/3) ... [2020-10-19 18:49:12,561 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76aab19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:49:12, skipping insertion in model container [2020-10-19 18:49:12,561 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:49:12,561 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:12" (2/3) ... [2020-10-19 18:49:12,562 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76aab19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:49:12, skipping insertion in model container [2020-10-19 18:49:12,562 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:49:12,562 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:49:12" (3/3) ... [2020-10-19 18:49:12,564 INFO L373 chiAutomizerObserver]: Analyzing ICFG array15_alloca.i [2020-10-19 18:49:12,623 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:49:12,623 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:49:12,623 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:49:12,624 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:49:12,624 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:49:12,625 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:49:12,625 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:49:12,625 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:49:12,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-19 18:49:12,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 18:49:12,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:12,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:12,689 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:49:12,689 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:49:12,689 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:49:12,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-19 18:49:12,691 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 18:49:12,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:12,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:12,692 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:49:12,692 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:49:12,702 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2020-10-19 18:49:12,703 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume main_#t~mem209 < 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2020-10-19 18:49:12,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:12,709 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-10-19 18:49:12,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:12,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230474512] [2020-10-19 18:49:12,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:12,824 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:12,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:12,860 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:12,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:12,862 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2020-10-19 18:49:12,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:12,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824840802] [2020-10-19 18:49:12,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:12,875 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:12,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:12,888 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:12,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:12,890 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2020-10-19 18:49:12,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:12,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72507553] [2020-10-19 18:49:12,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:12,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:12,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:12,939 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:13,203 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2020-10-19 18:49:13,262 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:49:13,264 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:49:13,264 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:49:13,264 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:49:13,264 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:49:13,265 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:13,265 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:49:13,265 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:49:13,265 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration1_Lasso [2020-10-19 18:49:13,265 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:49:13,266 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:49:13,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:13,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:13,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:13,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:13,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:13,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:13,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:13,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:13,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:13,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:13,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:13,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:13,717 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:49:13,723 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:13,729 INFO L120 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 [2020-10-19 18:49:13,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:13,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:13,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:13,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:13,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:13,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:13,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:13,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:13,777 INFO L120 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 [2020-10-19 18:49:13,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:13,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:13,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:13,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:13,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:13,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:13,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:13,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:13,818 INFO L120 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 [2020-10-19 18:49:13,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:13,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:13,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:13,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:13,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:13,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:13,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:49:13,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:13,854 INFO L120 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 [2020-10-19 18:49:13,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:13,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:13,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:13,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:13,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:13,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:13,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:49:13,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:13,889 INFO L120 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 [2020-10-19 18:49:13,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:13,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:13,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:13,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:13,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:13,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:49:13,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:13,931 INFO L120 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 [2020-10-19 18:49:13,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:13,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:13,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:13,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:13,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:13,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:13,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:49:13,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:13,963 INFO L120 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 [2020-10-19 18:49:13,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:13,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:13,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:13,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:13,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:13,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:49:13,993 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:49:14,028 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-19 18:49:14,028 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:14,036 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:14,040 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:49:14,040 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:49:14,041 INFO L512 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 [] [2020-10-19 18:49:14,093 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-19 18:49:14,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:14,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:49:14,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:14,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:49:14,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:14,222 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 [2020-10-19 18:49:14,224 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2020-10-19 18:49:14,311 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2020-10-19 18:49:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:49:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:49:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-10-19 18:49:14,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-19 18:49:14,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:14,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2020-10-19 18:49:14,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:14,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-19 18:49:14,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:14,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2020-10-19 18:49:14,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:14,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2020-10-19 18:49:14,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-19 18:49:14,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-19 18:49:14,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2020-10-19 18:49:14,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:49:14,340 INFO L691 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-10-19 18:49:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2020-10-19 18:49:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-10-19 18:49:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-19 18:49:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-10-19 18:49:14,375 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-10-19 18:49:14,375 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-10-19 18:49:14,375 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:49:14,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2020-10-19 18:49:14,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:14,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:14,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:14,380 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:49:14,380 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:49:14,381 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2020-10-19 18:49:14,381 INFO L796 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 118#L378-2 [2020-10-19 18:49:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:14,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2020-10-19 18:49:14,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:14,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038587862] [2020-10-19 18:49:14,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:14,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038587862] [2020-10-19 18:49:14,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:49:14,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 18:49:14,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5404521] [2020-10-19 18:49:14,502 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:49:14,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:14,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2020-10-19 18:49:14,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:14,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455340746] [2020-10-19 18:49:14,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:14,510 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:14,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:14,518 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:14,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:49:14,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 18:49:14,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-19 18:49:14,582 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-10-19 18:49:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:49:14,625 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-10-19 18:49:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 18:49:14,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2020-10-19 18:49:14,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:14,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2020-10-19 18:49:14,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-19 18:49:14,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-19 18:49:14,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-10-19 18:49:14,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:49:14,629 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-19 18:49:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-10-19 18:49:14,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-10-19 18:49:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-19 18:49:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-10-19 18:49:14,631 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-10-19 18:49:14,632 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-10-19 18:49:14,632 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:49:14,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-10-19 18:49:14,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:14,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:14,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:14,633 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:49:14,634 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:49:14,634 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2020-10-19 18:49:14,634 INFO L796 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 151#L378-2 [2020-10-19 18:49:14,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2020-10-19 18:49:14,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:14,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904936773] [2020-10-19 18:49:14,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:14,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:14,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:14,665 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:14,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:14,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2020-10-19 18:49:14,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:14,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035639004] [2020-10-19 18:49:14,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:14,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:14,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:14,681 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:14,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:14,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2020-10-19 18:49:14,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:14,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286447376] [2020-10-19 18:49:14,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:14,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:14,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:14,756 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:14,944 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2020-10-19 18:49:15,015 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:49:15,015 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:49:15,015 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:49:15,015 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:49:15,016 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:49:15,016 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:15,016 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:49:15,016 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:49:15,017 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration3_Lasso [2020-10-19 18:49:15,017 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:49:15,017 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:49:15,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:15,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:15,161 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2020-10-19 18:49:15,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:15,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:15,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:15,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:15,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:15,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:15,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:15,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:15,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:15,502 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:49:15,502 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:15,516 INFO L120 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 [2020-10-19 18:49:15,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:15,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:15,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:15,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:15,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:15,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:15,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:49:15,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:15,558 INFO L120 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 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:15,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:15,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:15,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:15,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:15,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:15,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:49:15,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:15,610 INFO L120 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 [2020-10-19 18:49:15,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:15,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:15,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:15,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:15,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:15,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:49:15,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:49:15,662 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-19 18:49:15,662 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:15,668 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:49:15,673 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:49:15,673 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:49:15,674 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2020-10-19 18:49:15,720 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-19 18:49:15,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:15,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:49:15,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:15,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:49:15,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:15,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 [2020-10-19 18:49:15,768 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-10-19 18:49:15,782 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2020-10-19 18:49:15,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 18:49:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:49:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2020-10-19 18:49:15,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2020-10-19 18:49:15,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:15,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2020-10-19 18:49:15,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:15,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2020-10-19 18:49:15,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:15,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2020-10-19 18:49:15,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:15,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2020-10-19 18:49:15,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 18:49:15,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 18:49:15,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-10-19 18:49:15,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:49:15,788 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-19 18:49:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-10-19 18:49:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-10-19 18:49:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-19 18:49:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-10-19 18:49:15,791 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-19 18:49:15,791 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-19 18:49:15,791 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:49:15,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-10-19 18:49:15,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:15,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:15,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:15,793 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:49:15,793 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:49:15,794 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 245#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 246#L367 assume !(main_~length~0 < 1); 255#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 243#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 254#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 250#L378-2 [2020-10-19 18:49:15,794 INFO L796 eck$LassoCheckResult]: Loop: 250#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 251#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 250#L378-2 [2020-10-19 18:49:15,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2020-10-19 18:49:15,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:15,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953083887] [2020-10-19 18:49:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:15,812 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:15,824 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:15,831 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:15,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2020-10-19 18:49:15,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:15,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856926543] [2020-10-19 18:49:15,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:15,841 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:15,844 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:15,848 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:15,848 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2020-10-19 18:49:15,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:15,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715252923] [2020-10-19 18:49:15,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:15,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715252923] [2020-10-19 18:49:15,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239167844] [2020-10-19 18:49:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:49:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:15,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:49:15,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:16,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:49:16,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-10-19 18:49:16,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967846186] [2020-10-19 18:49:16,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:49:16,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 18:49:16,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-19 18:49:16,064 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 10 states. [2020-10-19 18:49:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:49:16,235 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-10-19 18:49:16,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 18:49:16,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. [2020-10-19 18:49:16,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:16,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 28 transitions. [2020-10-19 18:49:16,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 18:49:16,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 18:49:16,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2020-10-19 18:49:16,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:49:16,239 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-10-19 18:49:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2020-10-19 18:49:16,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-10-19 18:49:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-19 18:49:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-10-19 18:49:16,242 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-19 18:49:16,242 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-19 18:49:16,242 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:49:16,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-10-19 18:49:16,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:16,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:16,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:16,244 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:49:16,245 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:49:16,245 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 360#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 361#L367 assume !(main_~length~0 < 1); 370#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 371#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 372#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 375#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 373#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 374#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 358#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 359#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 376#L370-3 assume !(main_~i~0 < main_~length~0); 362#L370-4 main_~j~0 := 0; 363#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 369#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 365#L378-2 [2020-10-19 18:49:16,245 INFO L796 eck$LassoCheckResult]: Loop: 365#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 366#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 365#L378-2 [2020-10-19 18:49:16,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:16,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2020-10-19 18:49:16,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:16,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281889101] [2020-10-19 18:49:16,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:16,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:16,274 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:16,277 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:16,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:16,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2020-10-19 18:49:16,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:16,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530959206] [2020-10-19 18:49:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:16,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:16,286 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:16,287 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:16,288 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2020-10-19 18:49:16,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:16,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895955915] [2020-10-19 18:49:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:16,303 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:16,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:16,330 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:16,646 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2020-10-19 18:49:16,749 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:49:16,750 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:49:16,750 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:49:16,750 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:49:16,750 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:49:16,750 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:16,751 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:49:16,751 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:49:16,751 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration5_Lasso [2020-10-19 18:49:16,751 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:49:16,752 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:49:16,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:16,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:16,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:16,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:16,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:16,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:16,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:16,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:16,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:16,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:16,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:17,219 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:49:17,219 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:17,228 INFO L120 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 [2020-10-19 18:49:17,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:17,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:17,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:17,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:17,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:17,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:17,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:49:17,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:17,264 INFO L120 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 [2020-10-19 18:49:17,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:17,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:17,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:17,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:17,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:17,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:49:17,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:17,306 INFO L120 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 [2020-10-19 18:49:17,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:17,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:17,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:17,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:17,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:17,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:17,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:49:17,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:17,345 INFO L120 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 [2020-10-19 18:49:17,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:17,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:17,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:17,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:17,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:17,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:17,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:49:17,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:17,378 INFO L120 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 [2020-10-19 18:49:17,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:17,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:17,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:17,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:17,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:17,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:17,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:49:17,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:17,408 INFO L120 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 [2020-10-19 18:49:17,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:17,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:17,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:17,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:17,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:17,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:17,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:49:17,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:17,438 INFO L120 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 [2020-10-19 18:49:17,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:17,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:17,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:17,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:17,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:17,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:49:17,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:17,484 INFO L120 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 [2020-10-19 18:49:17,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:17,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:17,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:17,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:17,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:17,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:49:17,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:17,541 INFO L120 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 [2020-10-19 18:49:17,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:17,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:17,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:17,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:17,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:17,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:17,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:17,592 INFO L120 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 [2020-10-19 18:49:17,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:17,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:17,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:17,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:17,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:17,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:17,617 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:49:17,656 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2020-10-19 18:49:17,656 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:17,660 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:17,664 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:49:17,665 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:49:17,665 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = 2*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-10-19 18:49:17,722 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-19 18:49:17,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:17,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:49:17,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:17,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:49:17,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:17,779 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 [2020-10-19 18:49:17,779 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-19 18:49:17,792 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 31 transitions. Complement of second has 5 states. [2020-10-19 18:49:17,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 18:49:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:49:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-10-19 18:49:17,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2020-10-19 18:49:17,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:17,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2020-10-19 18:49:17,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:17,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2020-10-19 18:49:17,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:17,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2020-10-19 18:49:17,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:17,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2020-10-19 18:49:17,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-19 18:49:17,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 18:49:17,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2020-10-19 18:49:17,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:49:17,799 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-10-19 18:49:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2020-10-19 18:49:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-10-19 18:49:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-19 18:49:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2020-10-19 18:49:17,802 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-10-19 18:49:17,802 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-10-19 18:49:17,802 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:49:17,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2020-10-19 18:49:17,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:17,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:17,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:17,804 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:49:17,805 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:49:17,805 INFO L794 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 488#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 489#L367 assume !(main_~length~0 < 1); 500#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 501#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 502#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 506#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 503#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 504#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 490#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 491#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 507#L370-3 assume !(main_~i~0 < main_~length~0); 492#L370-4 main_~j~0 := 0; 493#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 499#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 505#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 508#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 495#L378-2 [2020-10-19 18:49:17,805 INFO L796 eck$LassoCheckResult]: Loop: 495#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 496#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 495#L378-2 [2020-10-19 18:49:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2020-10-19 18:49:17,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:17,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296290964] [2020-10-19 18:49:17,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:17,821 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:17,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:17,839 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:17,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:17,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2020-10-19 18:49:17,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:17,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584360175] [2020-10-19 18:49:17,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:17,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:17,848 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:17,850 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:17,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:17,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2020-10-19 18:49:17,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:17,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135520678] [2020-10-19 18:49:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:17,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135520678] [2020-10-19 18:49:17,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669094225] [2020-10-19 18:49:17,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:49:17,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-19 18:49:17,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:49:17,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:49:17,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:18,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:49:18,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-10-19 18:49:18,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162689884] [2020-10-19 18:49:18,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:49:18,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 18:49:18,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-19 18:49:18,099 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 13 states. [2020-10-19 18:49:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:49:18,279 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2020-10-19 18:49:18,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 18:49:18,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 65 transitions. [2020-10-19 18:49:18,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 18:49:18,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 46 states and 62 transitions. [2020-10-19 18:49:18,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-19 18:49:18,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-19 18:49:18,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 62 transitions. [2020-10-19 18:49:18,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:49:18,285 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2020-10-19 18:49:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 62 transitions. [2020-10-19 18:49:18,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-10-19 18:49:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-19 18:49:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-10-19 18:49:18,289 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-10-19 18:49:18,289 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-10-19 18:49:18,289 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:49:18,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2020-10-19 18:49:18,290 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 18:49:18,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:18,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:18,291 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:49:18,291 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-10-19 18:49:18,291 INFO L794 eck$LassoCheckResult]: Stem: 647#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 641#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 642#L367 assume !(main_~length~0 < 1); 653#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 654#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 655#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 660#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 664#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 661#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 662#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 679#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 663#L370-3 assume !(main_~i~0 < main_~length~0); 645#L370-4 main_~j~0 := 0; 646#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 652#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 657#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 658#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 659#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 669#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 668#L378-2 [2020-10-19 18:49:18,291 INFO L796 eck$LassoCheckResult]: Loop: 668#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 665#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 666#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 670#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 668#L378-2 [2020-10-19 18:49:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:18,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2020-10-19 18:49:18,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:18,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428864425] [2020-10-19 18:49:18,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:18,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:18,322 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:18,326 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:18,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:18,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2020-10-19 18:49:18,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:18,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811991445] [2020-10-19 18:49:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:18,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:18,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:18,337 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:18,337 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2020-10-19 18:49:18,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:18,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892447301] [2020-10-19 18:49:18,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:18,354 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:18,370 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:18,374 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:18,517 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2020-10-19 18:49:18,965 WARN L193 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 101 [2020-10-19 18:49:19,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:49:19 BoogieIcfgContainer [2020-10-19 18:49:19,067 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:49:19,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:49:19,067 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:49:19,068 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:49:19,068 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:49:12" (3/4) ... [2020-10-19 18:49:19,072 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-19 18:49:19,124 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-19 18:49:19,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:49:19,127 INFO L168 Benchmark]: Toolchain (without parser) took 7686.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.5 MB). Free memory was 960.0 MB in the beginning and 1.2 GB in the end (delta: -255.9 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2020-10-19 18:49:19,127 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:49:19,128 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -142.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2020-10-19 18:49:19,129 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.81 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. [2020-10-19 18:49:19,129 INFO L168 Benchmark]: Boogie Preprocessor took 28.38 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. [2020-10-19 18:49:19,130 INFO L168 Benchmark]: RCFGBuilder took 330.38 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.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2020-10-19 18:49:19,130 INFO L168 Benchmark]: BuchiAutomizer took 6512.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -138.1 MB). Peak memory consumption was 375.3 MB. Max. memory is 11.5 GB. [2020-10-19 18:49:19,131 INFO L168 Benchmark]: Witness Printer took 57.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:49:19,134 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 698.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -142.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.81 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 28.38 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 330.38 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.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6512.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -138.1 MB). Peak memory consumption was 375.3 MB. Max. memory is 11.5 GB. * Witness Printer took 57.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * j + length and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 5.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 65 SDtfs, 107 SDslu, 83 SDs, 0 SdLazy, 210 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital134 mio100 ax100 hnf97 lsp94 ukn80 mio100 lsp62 div100 bol100 ite100 ukn100 eq162 hnf89 smp88 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40d01749=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@247a38ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12658e15=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@ebd31e9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12658e15=2, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@13ed4f4c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@5383c9b4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@2907551b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5d91e0c=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L381] j++ [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ Loop: [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...