./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 30f4e4ab 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.24-30f4e4a [2019-11-28 03:03:17,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:03:17,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:03:17,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:03:17,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:03:17,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:03:17,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:03:17,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:03:17,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:03:17,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:03:17,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:03:17,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:03:17,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:03:17,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:03:17,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:03:17,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:03:17,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:03:17,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:03:17,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:03:17,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:03:17,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:03:17,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:03:17,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:03:17,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:03:17,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:03:17,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:03:17,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:03:17,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:03:17,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:03:17,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:03:17,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:03:17,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:03:17,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:03:17,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:03:17,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:03:17,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:03:17,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:03:17,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:03:17,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:03:17,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:03:17,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:03:17,333 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:03:17,349 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:03:17,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:03:17,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:03:17,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:03:17,351 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:03:17,351 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:03:17,351 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:03:17,351 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:03:17,352 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:03:17,352 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:03:17,352 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:03:17,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:03:17,352 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:03:17,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:03:17,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:03:17,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:03:17,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:03:17,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:03:17,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:03:17,354 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:03:17,354 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:03:17,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:03:17,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:03:17,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:03:17,355 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:03:17,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:03:17,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:03:17,356 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:03:17,357 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:03:17,357 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 [2019-11-28 03:03:17,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:03:17,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:03:17,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:03:17,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:03:17,670 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:03:17,671 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array15_alloca.i [2019-11-28 03:03:17,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917ed1109/07b854ef8c66442da6684de4ba77c4d5/FLAG49c4f1a42 [2019-11-28 03:03:18,235 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:03:18,235 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array15_alloca.i [2019-11-28 03:03:18,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917ed1109/07b854ef8c66442da6684de4ba77c4d5/FLAG49c4f1a42 [2019-11-28 03:03:18,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917ed1109/07b854ef8c66442da6684de4ba77c4d5 [2019-11-28 03:03:18,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:03:18,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:03:18,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:03:18,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:03:18,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:03:18,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:18" (1/1) ... [2019-11-28 03:03:18,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64120b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:18, skipping insertion in model container [2019-11-28 03:03:18,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:18" (1/1) ... [2019-11-28 03:03:18,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:03:18,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:03:19,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:03:19,101 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:03:19,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:03:19,250 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:03:19,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:19 WrapperNode [2019-11-28 03:03:19,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:03:19,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:03:19,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:03:19,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:03:19,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:19" (1/1) ... [2019-11-28 03:03:19,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:19" (1/1) ... [2019-11-28 03:03:19,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:03:19,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:03:19,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:03:19,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:03:19,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:19" (1/1) ... [2019-11-28 03:03:19,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:19" (1/1) ... [2019-11-28 03:03:19,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:19" (1/1) ... [2019-11-28 03:03:19,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:19" (1/1) ... [2019-11-28 03:03:19,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:19" (1/1) ... [2019-11-28 03:03:19,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:19" (1/1) ... [2019-11-28 03:03:19,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:19" (1/1) ... [2019-11-28 03:03:19,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:03:19,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:03:19,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:03:19,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:03:19,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:19" (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 [2019-11-28 03:03:19,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:03:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:03:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:03:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:03:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:03:19,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:03:19,635 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:03:19,635 INFO L297 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 03:03:19,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:19 BoogieIcfgContainer [2019-11-28 03:03:19,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:03:19,647 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:03:19,650 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:03:19,661 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:03:19,663 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:03:19,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:03:18" (1/3) ... [2019-11-28 03:03:19,664 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe14397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:03:19, skipping insertion in model container [2019-11-28 03:03:19,668 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:03:19,668 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:19" (2/3) ... [2019-11-28 03:03:19,669 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe14397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:03:19, skipping insertion in model container [2019-11-28 03:03:19,669 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:03:19,669 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:19" (3/3) ... [2019-11-28 03:03:19,674 INFO L371 chiAutomizerObserver]: Analyzing ICFG array15_alloca.i [2019-11-28 03:03:19,741 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:03:19,741 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:03:19,741 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:03:19,741 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:03:19,742 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:03:19,742 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:03:19,742 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:03:19,742 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:03:19,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:03:19,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 03:03:19,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:19,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:19,783 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:03:19,783 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:03:19,783 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:03:19,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:03:19,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 03:03:19,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:19,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:19,785 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:03:19,785 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:03:19,792 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 [2019-11-28 03:03:19,793 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 [2019-11-28 03:03:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-28 03:03:19,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:19,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791247881] [2019-11-28 03:03:19,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:19,921 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:19,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:19,923 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-11-28 03:03:19,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:19,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850286207] [2019-11-28 03:03:19,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:19,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:19,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:19,948 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-11-28 03:03:19,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:19,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735736131] [2019-11-28 03:03:19,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:20,018 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:20,243 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-11-28 03:03:20,290 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:03:20,290 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:03:20,291 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:03:20,291 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:03:20,291 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:03:20,291 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:20,291 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:03:20,291 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:03:20,292 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration1_Lasso [2019-11-28 03:03:20,292 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:03:20,292 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:03:20,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:20,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:20,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:20,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:20,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:20,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:20,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:20,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:20,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:20,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:20,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:20,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:20,765 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:03:20,771 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) [2019-11-28 03:03:20,783 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 [2019-11-28 03:03:20,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:20,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:20,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:20,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:20,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:20,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:20,790 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 [2019-11-28 03:03:20,794 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) [2019-11-28 03:03:20,807 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 [2019-11-28 03:03:20,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:20,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:20,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:20,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:20,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:20,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:20,811 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 [2019-11-28 03:03:20,827 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) [2019-11-28 03:03:20,847 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:20,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:20,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:20,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:20,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:20,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:20,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:20,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:20,857 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 [2019-11-28 03:03:20,865 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 [2019-11-28 03:03:20,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:20,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:20,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:20,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:20,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:20,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:20,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:20,872 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) [2019-11-28 03:03:20,893 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:20,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:20,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:20,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:20,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:20,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:20,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:03:20,906 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 [2019-11-28 03:03:20,917 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 [2019-11-28 03:03:20,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:20,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:20,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:20,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:20,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:20,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:20,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:20,925 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 [2019-11-28 03:03:20,945 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 [2019-11-28 03:03:20,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:20,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:20,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:20,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:20,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:20,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:20,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:20,950 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 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:20,957 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 [2019-11-28 03:03:20,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:20,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:20,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:20,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:20,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:20,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:20,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:20,962 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 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 [2019-11-28 03:03:20,975 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 [2019-11-28 03:03:20,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:20,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:20,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:20,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:20,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:20,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:03:20,987 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:20,993 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 [2019-11-28 03:03:20,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:20,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:20,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:20,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:21,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:21,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:03:21,021 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:03:21,054 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 03:03:21,055 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. 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) [2019-11-28 03:03:21,063 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:21,068 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:03:21,068 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:03:21,069 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~length~0 >= 0] [2019-11-28 03:03:21,094 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:03:21,118 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:03:21,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:21,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:03:21,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:21,252 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 03:03:21,253 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:03:21,261 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:03:21,261 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:03:21,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 03:03:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:21,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:03:21,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:21,358 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 03:03:21,360 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-11-28 03:03:21,476 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 32 states and 47 transitions. Complement of second has 9 states. [2019-11-28 03:03:21,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:03:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:03:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2019-11-28 03:03:21,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-28 03:03:21,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:21,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-28 03:03:21,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:21,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-28 03:03:21,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:21,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2019-11-28 03:03:21,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:21,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 17 transitions. [2019-11-28 03:03:21,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 03:03:21,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 03:03:21,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-11-28 03:03:21,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:03:21,497 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-28 03:03:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-11-28 03:03:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-28 03:03:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 03:03:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-28 03:03:21,528 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-28 03:03:21,529 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-28 03:03:21,529 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:03:21,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-28 03:03:21,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:21,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:21,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:21,530 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:03:21,531 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:03:21,531 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 125#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; 126#L367 assume !(main_~length~0 < 1); 131#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; 132#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 133#L370-3 assume !(main_~i~0 < main_~length~0); 127#L370-4 main_~j~0 := 0; 128#L378-2 [2019-11-28 03:03:21,531 INFO L796 eck$LassoCheckResult]: Loop: 128#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); 130#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; 128#L378-2 [2019-11-28 03:03:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:21,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-11-28 03:03:21,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:21,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800794695] [2019-11-28 03:03:21,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:21,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800794695] [2019-11-28 03:03:21,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:03:21,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:03:21,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948808294] [2019-11-28 03:03:21,593 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:03:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:21,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-11-28 03:03:21,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:21,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146355453] [2019-11-28 03:03:21,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:21,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:21,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:03:21,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:03:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:03:21,659 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 03:03:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:03:21,701 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-28 03:03:21,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:03:21,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-28 03:03:21,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:21,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-28 03:03:21,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 03:03:21,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 03:03:21,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-28 03:03:21,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:03:21,705 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 03:03:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-28 03:03:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-28 03:03:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 03:03:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-28 03:03:21,707 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 03:03:21,707 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 03:03:21,707 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:03:21,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-28 03:03:21,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:21,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:21,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:21,708 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:03:21,709 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:03:21,709 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#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; 157#L367 assume !(main_~length~0 < 1); 164#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; 165#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 166#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); 158#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 159#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 167#L370-3 assume !(main_~i~0 < main_~length~0); 160#L370-4 main_~j~0 := 0; 161#L378-2 [2019-11-28 03:03:21,709 INFO L796 eck$LassoCheckResult]: Loop: 161#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); 163#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; 161#L378-2 [2019-11-28 03:03:21,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-11-28 03:03:21,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:21,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160715991] [2019-11-28 03:03:21,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:21,736 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:21,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-11-28 03:03:21,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:21,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959903978] [2019-11-28 03:03:21,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:21,751 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:21,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:21,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-11-28 03:03:21,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:21,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812866945] [2019-11-28 03:03:21,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:21,821 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:22,105 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-11-28 03:03:22,170 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:03:22,170 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:03:22,170 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:03:22,170 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:03:22,170 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:03:22,171 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:22,171 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:03:22,171 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:03:22,171 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration3_Lasso [2019-11-28 03:03:22,171 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:03:22,171 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:03:22,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:22,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:22,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:22,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:22,332 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-11-28 03:03:22,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:22,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:22,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:22,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:22,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:22,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:22,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:22,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:22,646 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:03:22,647 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2019-11-28 03:03:22,652 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 [2019-11-28 03:03:22,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:22,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:22,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:22,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:22,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:22,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:22,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:22,659 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 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:22,668 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 [2019-11-28 03:03:22,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:22,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:22,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:22,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:22,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:22,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:22,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:22,673 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 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:22,684 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 [2019-11-28 03:03:22,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:22,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:22,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:22,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:22,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:22,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:03:22,693 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 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 [2019-11-28 03:03:22,708 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 [2019-11-28 03:03:22,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:22,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:22,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:22,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:22,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:22,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:03:22,720 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 [2019-11-28 03:03:22,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 [2019-11-28 03:03:22,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:22,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:22,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:22,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:22,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:22,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:03:22,738 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) [2019-11-28 03:03:22,749 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:22,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:22,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:22,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:22,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:22,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:22,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:03:22,771 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:03:22,813 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 03:03:22,813 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. 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) [2019-11-28 03:03:22,825 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:22,828 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:03:22,828 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:03:22,828 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2) = 8*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2 Supporting invariants [] [2019-11-28 03:03:22,839 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 03:03:22,842 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:03:22,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:22,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:03:22,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:22,892 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:03:22,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:22,912 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 03:03:22,913 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-28 03:03:22,955 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 16 states and 22 transitions. Complement of second has 6 states. [2019-11-28 03:03:22,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:03:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:03:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 03:03:22,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 03:03:22,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:22,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-28 03:03:22,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:22,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 03:03:22,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:22,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-28 03:03:22,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:22,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-11-28 03:03:22,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 03:03:22,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:03:22,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-28 03:03:22,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:03:22,960 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 03:03:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-28 03:03:22,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 03:03:22,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 03:03:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-28 03:03:22,963 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 03:03:22,963 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 03:03:22,963 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:03:22,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-28 03:03:22,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:22,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:22,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:22,964 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:03:22,965 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:03:22,965 INFO L794 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 260#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; 261#L367 assume !(main_~length~0 < 1); 272#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; 273#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 274#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); 262#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 263#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 275#L370-3 assume !(main_~i~0 < main_~length~0); 264#L370-4 main_~j~0 := 0; 265#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); 271#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; 267#L378-2 [2019-11-28 03:03:22,965 INFO L796 eck$LassoCheckResult]: Loop: 267#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); 268#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; 267#L378-2 [2019-11-28 03:03:22,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:22,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-11-28 03:03:22,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:22,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629338599] [2019-11-28 03:03:22,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:22,990 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:22,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:22,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-11-28 03:03:22,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:22,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263854510] [2019-11-28 03:03:22,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:23,000 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:23,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:23,001 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-11-28 03:03:23,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:23,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199819032] [2019-11-28 03:03:23,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:23,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199819032] [2019-11-28 03:03:23,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015117644] [2019-11-28 03:03:23,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:03:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:23,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:03:23,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:23,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:03:23,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-28 03:03:23,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725952968] [2019-11-28 03:03:23,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:03:23,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 03:03:23,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-28 03:03:23,393 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-11-28 03:03:23,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:03:23,651 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-11-28 03:03:23,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 03:03:23,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2019-11-28 03:03:23,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:23,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 28 transitions. [2019-11-28 03:03:23,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:03:23,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:03:23,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-11-28 03:03:23,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:03:23,659 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 03:03:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-11-28 03:03:23,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-28 03:03:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 03:03:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-28 03:03:23,665 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-28 03:03:23,665 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-28 03:03:23,665 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:03:23,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-28 03:03:23,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:23,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:23,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:23,671 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:03:23,671 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:03:23,671 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 376#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; 377#L367 assume !(main_~length~0 < 1); 386#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; 387#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 388#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); 391#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 389#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 390#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); 374#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 375#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 392#L370-3 assume !(main_~i~0 < main_~length~0); 378#L370-4 main_~j~0 := 0; 379#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); 385#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; 381#L378-2 [2019-11-28 03:03:23,672 INFO L796 eck$LassoCheckResult]: Loop: 381#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); 382#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; 381#L378-2 [2019-11-28 03:03:23,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:23,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2019-11-28 03:03:23,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:23,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138776358] [2019-11-28 03:03:23,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:23,732 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:23,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:23,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-11-28 03:03:23,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:23,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596034420] [2019-11-28 03:03:23,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:23,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:23,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:23,749 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2019-11-28 03:03:23,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:23,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176577352] [2019-11-28 03:03:23,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:23,807 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:24,129 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 91 [2019-11-28 03:03:24,199 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:03:24,199 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:03:24,199 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:03:24,199 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:03:24,199 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:03:24,200 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:24,200 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:03:24,200 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:03:24,201 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration5_Lasso [2019-11-28 03:03:24,201 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:03:24,201 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:03:24,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:24,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:24,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:24,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:24,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:24,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:24,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:24,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:24,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:24,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:24,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:24,641 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:03:24,641 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2019-11-28 03:03:24,656 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 [2019-11-28 03:03:24,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:24,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:24,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:24,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:24,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:24,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:24,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:24,659 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 [2019-11-28 03:03:24,671 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 [2019-11-28 03:03:24,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:24,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:24,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:24,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:24,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:24,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:03:24,685 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) [2019-11-28 03:03:24,699 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:24,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:24,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:24,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:24,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:24,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:24,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:03:24,725 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:03:24,783 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2019-11-28 03:03:24,784 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:24,792 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:24,795 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:03:24,796 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:03:24,796 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_3) = 8*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_3 Supporting invariants [] [2019-11-28 03:03:24,812 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:03:24,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:03:24,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:24,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:03:24,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:24,878 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:03:24,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:24,897 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 03:03:24,897 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 03:03:24,942 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 23 states and 31 transitions. Complement of second has 6 states. [2019-11-28 03:03:24,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:03:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:03:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-28 03:03:24,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-28 03:03:24,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:24,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-28 03:03:24,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:24,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 03:03:24,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:24,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2019-11-28 03:03:24,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:24,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2019-11-28 03:03:24,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:03:24,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:03:24,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2019-11-28 03:03:24,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:03:24,950 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-28 03:03:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2019-11-28 03:03:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 03:03:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:03:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-28 03:03:24,953 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-28 03:03:24,953 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-28 03:03:24,953 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:03:24,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-11-28 03:03:24,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:24,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:24,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:24,955 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:03:24,956 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:03:24,956 INFO L794 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 513#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; 514#L367 assume !(main_~length~0 < 1); 523#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; 524#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 525#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); 529#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 526#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 527#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); 511#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 512#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 530#L370-3 assume !(main_~i~0 < main_~length~0); 515#L370-4 main_~j~0 := 0; 516#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); 522#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; 528#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); 531#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; 518#L378-2 [2019-11-28 03:03:24,956 INFO L796 eck$LassoCheckResult]: Loop: 518#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); 519#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; 518#L378-2 [2019-11-28 03:03:24,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2019-11-28 03:03:24,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:24,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175980062] [2019-11-28 03:03:24,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:24,984 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:24,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:24,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-11-28 03:03:24,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:24,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045909063] [2019-11-28 03:03:24,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:24,993 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:24,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2019-11-28 03:03:24,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:24,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055179657] [2019-11-28 03:03:24,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:25,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055179657] [2019-11-28 03:03:25,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88608734] [2019-11-28 03:03:25,127 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:03:25,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 03:03:25,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:03:25,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:03:25,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:25,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:03:25,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-28 03:03:25,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692876550] [2019-11-28 03:03:25,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:03:25,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 03:03:25,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-28 03:03:25,325 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 17 states. [2019-11-28 03:03:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:03:25,569 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-11-28 03:03:25,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 03:03:25,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-11-28 03:03:25,571 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:03:25,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2019-11-28 03:03:25,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-28 03:03:25,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-28 03:03:25,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2019-11-28 03:03:25,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:03:25,572 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2019-11-28 03:03:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2019-11-28 03:03:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-11-28 03:03:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 03:03:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-11-28 03:03:25,576 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-28 03:03:25,577 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-28 03:03:25,577 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:03:25,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2019-11-28 03:03:25,578 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:03:25,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:25,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:25,579 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:03:25,581 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-28 03:03:25,582 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 664#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; 665#L367 assume !(main_~length~0 < 1); 676#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; 677#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 678#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); 684#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 687#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 685#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); 686#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; 680#L370-3 assume !(main_~i~0 < main_~length~0); 668#L370-4 main_~j~0 := 0; 669#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); 689#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; 688#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); 682#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; 683#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); 697#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; 695#L378-2 [2019-11-28 03:03:25,582 INFO L796 eck$LassoCheckResult]: Loop: 695#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); 692#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; 671#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); 672#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; 695#L378-2 [2019-11-28 03:03:25,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:25,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2019-11-28 03:03:25,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:25,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209222261] [2019-11-28 03:03:25,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:25,641 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:25,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-11-28 03:03:25,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:25,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615606622] [2019-11-28 03:03:25,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:25,664 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:25,666 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2019-11-28 03:03:25,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:25,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588978662] [2019-11-28 03:03:25,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:25,744 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:26,334 WARN L192 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 105 [2019-11-28 03:03:26,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:03:26 BoogieIcfgContainer [2019-11-28 03:03:26,467 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:03:26,467 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:03:26,467 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:03:26,468 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:03:26,468 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:19" (3/4) ... [2019-11-28 03:03:26,472 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:03:26,523 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:03:26,524 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:03:26,525 INFO L168 Benchmark]: Toolchain (without parser) took 7947.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 127.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:03:26,526 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:03:26,527 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:03:26,527 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.93 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. [2019-11-28 03:03:26,528 INFO L168 Benchmark]: Boogie Preprocessor took 27.14 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:03:26,528 INFO L168 Benchmark]: RCFGBuilder took 312.84 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:03:26,529 INFO L168 Benchmark]: BuchiAutomizer took 6819.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 160.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.7 MB). Peak memory consumption was 111.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:03:26,530 INFO L168 Benchmark]: Witness Printer took 56.73 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:03:26,532 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 671.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.93 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 27.14 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 312.84 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6819.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 160.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.7 MB). Peak memory consumption was 111.7 MB. Max. memory is 11.5 GB. * Witness Printer took 56.73 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -4 * i and consists of 6 locations. One deterministic module has affine ranking function 8 * j + unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 4 locations. One deterministic module has affine ranking function 8 * j + unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 5.3s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 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: 51 SDtfs, 161 SDslu, 76 SDs, 0 SdLazy, 230 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital130 mio100 ax100 hnf99 lsp93 ukn82 mio100 lsp63 div100 bol100 ite100 ukn100 eq159 hnf90 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms 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@24b6b8c4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5884a8f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b55f890=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@3886f37a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b55f890=2, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1e3a1aeb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@6129addc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@6483ca2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@7c2a8e40=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...