./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array15_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:42:11,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:42:11,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:42:11,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:42:11,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:42:11,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:42:11,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:42:11,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:42:11,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:42:11,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:42:11,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:42:11,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:42:11,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:42:11,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:42:11,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:42:11,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:42:11,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:42:11,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:42:11,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:42:11,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:42:11,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:42:11,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:42:11,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:42:11,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:42:11,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:42:11,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:42:11,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:42:11,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:42:11,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:42:11,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:42:11,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:42:11,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:42:11,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:42:11,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:42:11,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:42:11,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:42:11,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:42:11,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:42:11,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:42:11,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:42:11,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:42:11,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:42:11,689 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:42:11,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:42:11,691 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:42:11,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:42:11,693 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:42:11,693 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:42:11,694 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:42:11,694 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:42:11,694 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:42:11,694 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:42:11,696 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:42:11,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:42:11,696 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:42:11,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:42:11,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:42:11,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:42:11,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:42:11,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:42:11,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:42:11,699 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:42:11,700 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:42:11,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:42:11,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:42:11,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:42:11,701 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:42:11,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:42:11,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:42:11,702 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:42:11,702 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:42:11,703 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:42:11,704 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 [2020-10-20 06:42:11,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:42:11,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:42:11,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:42:11,933 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:42:11,933 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:42:11,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array15_alloca.i [2020-10-20 06:42:12,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fc99b1dc/5735c6b4a07e40628d39f6c07b3c341e/FLAGf5ea54978 [2020-10-20 06:42:12,601 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:42:12,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array15_alloca.i [2020-10-20 06:42:12,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fc99b1dc/5735c6b4a07e40628d39f6c07b3c341e/FLAGf5ea54978 [2020-10-20 06:42:12,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fc99b1dc/5735c6b4a07e40628d39f6c07b3c341e [2020-10-20 06:42:12,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:42:12,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:42:12,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:42:12,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:42:12,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:42:12,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:42:12" (1/1) ... [2020-10-20 06:42:12,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ccb791e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:12, skipping insertion in model container [2020-10-20 06:42:12,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:42:12" (1/1) ... [2020-10-20 06:42:12,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:42:12,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:42:13,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:42:13,422 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:42:13,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:42:13,549 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:42:13,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:13 WrapperNode [2020-10-20 06:42:13,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:42:13,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:42:13,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:42:13,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:42:13,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:13" (1/1) ... [2020-10-20 06:42:13,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:13" (1/1) ... [2020-10-20 06:42:13,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:42:13,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:42:13,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:42:13,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:42:13,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:13" (1/1) ... [2020-10-20 06:42:13,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:13" (1/1) ... [2020-10-20 06:42:13,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:13" (1/1) ... [2020-10-20 06:42:13,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:13" (1/1) ... [2020-10-20 06:42:13,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:13" (1/1) ... [2020-10-20 06:42:13,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:13" (1/1) ... [2020-10-20 06:42:13,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:13" (1/1) ... [2020-10-20 06:42:13,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:42:13,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:42:13,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:42:13,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:42:13,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:42:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:42:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:42:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:42:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:42:13,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:42:13,948 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:42:13,948 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-20 06:42:13,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:42:13 BoogieIcfgContainer [2020-10-20 06:42:13,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:42:13,951 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:42:13,951 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:42:13,957 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:42:13,958 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:42:13,959 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:42:12" (1/3) ... [2020-10-20 06:42:13,961 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1899a674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:42:13, skipping insertion in model container [2020-10-20 06:42:13,961 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:42:13,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:13" (2/3) ... [2020-10-20 06:42:13,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1899a674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:42:13, skipping insertion in model container [2020-10-20 06:42:13,962 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:42:13,963 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:42:13" (3/3) ... [2020-10-20 06:42:13,964 INFO L373 chiAutomizerObserver]: Analyzing ICFG array15_alloca.i [2020-10-20 06:42:14,043 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:42:14,043 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:42:14,044 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:42:14,044 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:42:14,044 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:42:14,044 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:42:14,045 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:42:14,045 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:42:14,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-20 06:42:14,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 06:42:14,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:14,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:14,099 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:42:14,099 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:42:14,100 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:42:14,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-20 06:42:14,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 06:42:14,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:14,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:14,103 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:42:14,103 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:42:14,110 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2020-10-20 06:42:14,111 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume main_#t~mem209 < 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2020-10-20 06:42:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:14,118 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-10-20 06:42:14,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:14,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425345360] [2020-10-20 06:42:14,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:14,246 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:14,258 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:14,283 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:14,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:14,285 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2020-10-20 06:42:14,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:14,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821248097] [2020-10-20 06:42:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:14,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:14,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:14,318 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2020-10-20 06:42:14,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:14,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511155838] [2020-10-20 06:42:14,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:14,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:14,361 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:14,367 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:14,641 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2020-10-20 06:42:14,703 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:42:14,705 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:42:14,705 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:42:14,706 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:42:14,706 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:42:14,706 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:14,706 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:42:14,707 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:42:14,707 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration1_Lasso [2020-10-20 06:42:14,707 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:42:14,708 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:42:14,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:14,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:14,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:14,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:14,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:14,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:14,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:14,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:14,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:14,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:14,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:14,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:15,163 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:42:15,168 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:15,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:15,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:15,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:15,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:15,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:15,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:15,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:15,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:15,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:15,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:15,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:15,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:15,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:15,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:15,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:15,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:15,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:15,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:15,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:15,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:15,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:15,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:15,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:15,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:15,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:15,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:15,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:15,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:15,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:15,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:15,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:15,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:15,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:15,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:15,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:15,307 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) [2020-10-20 06:42:15,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:15,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:15,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:15,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:15,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:15,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:15,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:15,368 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) [2020-10-20 06:42:15,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:15,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:15,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:15,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:15,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:15,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:15,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:15,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:15,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:15,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:15,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:15,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:15,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:15,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:15,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:15,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:15,466 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:42:15,489 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-20 06:42:15,489 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:15,500 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:42:15,503 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:42:15,503 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:42:15,504 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-10-20 06:42:15,543 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-20 06:42:15,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:15,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:42:15,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:15,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:42:15,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:15,705 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:42:15,707 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2020-10-20 06:42:15,792 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2020-10-20 06:42:15,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:42:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:42:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-10-20 06:42:15,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-20 06:42:15,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:15,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2020-10-20 06:42:15,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:15,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-20 06:42:15,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:15,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2020-10-20 06:42:15,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:15,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2020-10-20 06:42:15,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-20 06:42:15,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:42:15,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2020-10-20 06:42:15,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:42:15,824 INFO L691 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-10-20 06:42:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2020-10-20 06:42:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-10-20 06:42:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-20 06:42:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-10-20 06:42:15,858 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-10-20 06:42:15,858 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-10-20 06:42:15,859 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:42:15,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2020-10-20 06:42:15,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:15,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:15,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:15,862 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:15,862 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:15,862 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2020-10-20 06:42:15,863 INFO L796 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 118#L378-2 [2020-10-20 06:42:15,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:15,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2020-10-20 06:42:15,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:15,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005113620] [2020-10-20 06:42:15,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:15,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005113620] [2020-10-20 06:42:15,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:42:15,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 06:42:15,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835027771] [2020-10-20 06:42:15,956 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:42:15,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:15,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2020-10-20 06:42:15,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:15,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939917025] [2020-10-20 06:42:15,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:15,980 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:15,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:15,993 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:16,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:42:16,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:42:16,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:42:16,042 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-10-20 06:42:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:42:16,094 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-10-20 06:42:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:42:16,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2020-10-20 06:42:16,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:16,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2020-10-20 06:42:16,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 06:42:16,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:42:16,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-10-20 06:42:16,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:42:16,099 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-20 06:42:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-10-20 06:42:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-10-20 06:42:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-20 06:42:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-10-20 06:42:16,102 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-10-20 06:42:16,102 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-10-20 06:42:16,102 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:42:16,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-10-20 06:42:16,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:16,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:16,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:16,106 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:16,106 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:16,106 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2020-10-20 06:42:16,107 INFO L796 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 151#L378-2 [2020-10-20 06:42:16,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:16,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2020-10-20 06:42:16,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:16,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428615859] [2020-10-20 06:42:16,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:16,137 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:16,162 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:16,167 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:16,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2020-10-20 06:42:16,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:16,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749575467] [2020-10-20 06:42:16,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:16,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:16,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:16,190 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:16,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2020-10-20 06:42:16,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:16,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147329899] [2020-10-20 06:42:16,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:16,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:16,223 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:16,227 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:16,425 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2020-10-20 06:42:16,496 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:42:16,496 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:42:16,496 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:42:16,496 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:42:16,496 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:42:16,497 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:16,497 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:42:16,497 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:42:16,497 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration3_Lasso [2020-10-20 06:42:16,497 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:42:16,497 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:42:16,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:16,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:16,636 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2020-10-20 06:42:16,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:16,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:16,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:16,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:16,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:16,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:16,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:16,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:16,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:16,933 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:42:16,933 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:16,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:16,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:16,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:16,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:16,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:16,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:16,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:16,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:16,947 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 [2020-10-20 06:42:16,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:16,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:16,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:16,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:16,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:16,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:16,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:17,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:17,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:17,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:17,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:17,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:17,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:17,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:17,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:17,068 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:42:17,091 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-20 06:42:17,091 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:17,118 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:42:17,123 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:42:17,123 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:42:17,123 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2020-10-20 06:42:17,164 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-20 06:42:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:17,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:42:17,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:17,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:42:17,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:17,217 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:42:17,217 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-10-20 06:42:17,241 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2020-10-20 06:42:17,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:42:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:42:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2020-10-20 06:42:17,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2020-10-20 06:42:17,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:17,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2020-10-20 06:42:17,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:17,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2020-10-20 06:42:17,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:17,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2020-10-20 06:42:17,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:17,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2020-10-20 06:42:17,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 06:42:17,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:42:17,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-10-20 06:42:17,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:42:17,246 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-20 06:42:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-10-20 06:42:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-10-20 06:42:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-20 06:42:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-10-20 06:42:17,254 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-20 06:42:17,254 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-20 06:42:17,255 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:42:17,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-10-20 06:42:17,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:17,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:17,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:17,259 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:17,261 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:17,261 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 245#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 246#L367 assume !(main_~length~0 < 1); 255#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 243#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 254#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 250#L378-2 [2020-10-20 06:42:17,261 INFO L796 eck$LassoCheckResult]: Loop: 250#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 251#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 250#L378-2 [2020-10-20 06:42:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2020-10-20 06:42:17,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:17,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577338953] [2020-10-20 06:42:17,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:17,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:17,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:17,316 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:17,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:17,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2020-10-20 06:42:17,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:17,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720458774] [2020-10-20 06:42:17,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:17,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:17,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:17,343 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:17,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:17,347 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2020-10-20 06:42:17,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:17,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929691400] [2020-10-20 06:42:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:17,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929691400] [2020-10-20 06:42:17,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257468690] [2020-10-20 06:42:17,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:42:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:17,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:42:17,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:17,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:42:17,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-10-20 06:42:17,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733308964] [2020-10-20 06:42:17,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:42:17,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:42:17,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:42:17,688 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 10 states. [2020-10-20 06:42:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:42:17,879 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-10-20 06:42:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:42:17,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. [2020-10-20 06:42:17,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:17,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 28 transitions. [2020-10-20 06:42:17,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:42:17,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:42:17,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2020-10-20 06:42:17,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:42:17,885 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-10-20 06:42:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2020-10-20 06:42:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-10-20 06:42:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-20 06:42:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-10-20 06:42:17,888 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-20 06:42:17,888 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-20 06:42:17,888 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:42:17,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-10-20 06:42:17,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:17,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:17,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:17,891 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:17,891 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:17,892 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 360#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 361#L367 assume !(main_~length~0 < 1); 370#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 371#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 372#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 375#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 373#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 374#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 358#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 359#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 376#L370-3 assume !(main_~i~0 < main_~length~0); 362#L370-4 main_~j~0 := 0; 363#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 369#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 365#L378-2 [2020-10-20 06:42:17,892 INFO L796 eck$LassoCheckResult]: Loop: 365#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 366#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 365#L378-2 [2020-10-20 06:42:17,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:17,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2020-10-20 06:42:17,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:17,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865001949] [2020-10-20 06:42:17,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:17,917 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:17,929 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:17,933 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:17,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:17,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2020-10-20 06:42:17,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:17,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571279007] [2020-10-20 06:42:17,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:17,939 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:17,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:17,943 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:17,944 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2020-10-20 06:42:17,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:17,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973005294] [2020-10-20 06:42:17,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:17,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:17,973 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:17,977 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:18,334 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2020-10-20 06:42:18,427 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:42:18,427 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:42:18,427 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:42:18,427 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:42:18,427 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:42:18,427 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:18,427 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:42:18,427 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:42:18,427 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration5_Lasso [2020-10-20 06:42:18,428 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:42:18,428 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:42:18,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:18,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:18,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:18,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:18,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:18,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:18,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:18,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:18,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:18,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:18,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:18,948 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:42:18,949 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:18,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:18,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:18,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:18,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:18,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:18,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:18,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:18,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:18,983 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 [2020-10-20 06:42:19,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:19,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:19,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:19,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:19,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:19,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:19,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:19,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:19,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:19,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:19,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:19,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:19,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:19,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:19,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:19,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:19,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:19,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:19,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:19,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:19,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:19,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:19,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:19,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:19,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:19,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:19,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:19,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:19,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:19,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:19,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:19,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:19,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:19,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:19,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:19,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:19,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:19,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:19,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:19,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:19,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:19,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:19,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:19,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:19,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:19,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:19,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:19,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:19,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:19,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:19,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:19,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:19,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:19,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:19,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:19,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:19,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:19,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:19,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:19,206 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:19,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:19,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:19,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:19,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:19,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:19,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:19,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:19,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:19,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:42:19,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:19,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:19,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:19,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:19,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:19,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:19,290 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:42:19,326 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2020-10-20 06:42:19,326 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:19,328 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:42:19,330 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:42:19,330 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:42:19,330 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = 2*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-10-20 06:42:19,359 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-20 06:42:19,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:19,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:42:19,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:19,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:42:19,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:19,416 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:42:19,416 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-20 06:42:19,432 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 31 transitions. Complement of second has 5 states. [2020-10-20 06:42:19,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:42:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:42:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-10-20 06:42:19,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2020-10-20 06:42:19,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:19,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2020-10-20 06:42:19,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:19,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2020-10-20 06:42:19,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:19,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2020-10-20 06:42:19,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:19,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2020-10-20 06:42:19,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-20 06:42:19,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 06:42:19,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2020-10-20 06:42:19,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:42:19,440 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-10-20 06:42:19,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2020-10-20 06:42:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-10-20 06:42:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-20 06:42:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2020-10-20 06:42:19,443 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-10-20 06:42:19,443 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-10-20 06:42:19,443 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:42:19,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2020-10-20 06:42:19,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:19,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:19,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:19,445 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:19,445 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:19,445 INFO L794 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 488#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 489#L367 assume !(main_~length~0 < 1); 500#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 501#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 502#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 506#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 503#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 504#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 490#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 491#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 507#L370-3 assume !(main_~i~0 < main_~length~0); 492#L370-4 main_~j~0 := 0; 493#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 499#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 505#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 508#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 495#L378-2 [2020-10-20 06:42:19,445 INFO L796 eck$LassoCheckResult]: Loop: 495#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 496#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 495#L378-2 [2020-10-20 06:42:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:19,445 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2020-10-20 06:42:19,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:19,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338191764] [2020-10-20 06:42:19,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:19,461 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:19,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:19,502 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2020-10-20 06:42:19,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:19,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209515544] [2020-10-20 06:42:19,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:19,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:19,533 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:19,537 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:19,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:19,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2020-10-20 06:42:19,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:19,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322395066] [2020-10-20 06:42:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:19,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322395066] [2020-10-20 06:42:19,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912896420] [2020-10-20 06:42:19,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:42:19,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-20 06:42:19,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:42:19,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:42:19,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:19,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:42:19,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-10-20 06:42:19,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132031512] [2020-10-20 06:42:19,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:42:19,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 06:42:19,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:42:19,778 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 13 states. [2020-10-20 06:42:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:42:19,964 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2020-10-20 06:42:19,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:42:19,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 65 transitions. [2020-10-20 06:42:19,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 06:42:19,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 46 states and 62 transitions. [2020-10-20 06:42:19,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-20 06:42:19,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-20 06:42:19,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 62 transitions. [2020-10-20 06:42:19,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:42:19,968 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2020-10-20 06:42:19,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 62 transitions. [2020-10-20 06:42:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-10-20 06:42:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-20 06:42:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-10-20 06:42:19,973 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-10-20 06:42:19,973 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-10-20 06:42:19,974 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:42:19,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2020-10-20 06:42:19,975 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 06:42:19,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:19,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:19,976 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:19,976 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-10-20 06:42:19,976 INFO L794 eck$LassoCheckResult]: Stem: 647#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 641#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 642#L367 assume !(main_~length~0 < 1); 653#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 654#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 655#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 660#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 664#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 661#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 662#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 679#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 663#L370-3 assume !(main_~i~0 < main_~length~0); 645#L370-4 main_~j~0 := 0; 646#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 652#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 657#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 658#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 659#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 669#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 668#L378-2 [2020-10-20 06:42:19,977 INFO L796 eck$LassoCheckResult]: Loop: 668#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 665#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 666#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 670#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 668#L378-2 [2020-10-20 06:42:19,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:19,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2020-10-20 06:42:19,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:19,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386201730] [2020-10-20 06:42:19,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:19,993 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:20,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:20,011 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2020-10-20 06:42:20,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:20,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290966167] [2020-10-20 06:42:20,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:20,017 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:20,020 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:20,022 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:20,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:20,023 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2020-10-20 06:42:20,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:20,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917417615] [2020-10-20 06:42:20,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:20,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:20,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:20,066 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:20,597 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 101 [2020-10-20 06:42:20,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:42:20 BoogieIcfgContainer [2020-10-20 06:42:20,720 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:42:20,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:42:20,720 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:42:20,720 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:42:20,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:42:13" (3/4) ... [2020-10-20 06:42:20,725 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:42:20,777 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:42:20,777 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:42:20,788 INFO L168 Benchmark]: Toolchain (without parser) took 7892.46 ms. Allocated memory was 37.2 MB in the beginning and 83.4 MB in the end (delta: 46.1 MB). Free memory was 17.8 MB in the beginning and 7.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 56.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:20,789 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 34.6 MB. Free memory was 11.5 MB in the beginning and 11.5 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. [2020-10-20 06:42:20,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.53 ms. Allocated memory was 37.2 MB in the beginning and 46.7 MB in the end (delta: 9.4 MB). Free memory was 16.9 MB in the beginning and 24.9 MB in the end (delta: -7.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:20,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.20 ms. Allocated memory is still 46.7 MB. Free memory was 24.6 MB in the beginning and 22.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:20,799 INFO L168 Benchmark]: Boogie Preprocessor took 29.22 ms. Allocated memory is still 46.7 MB. Free memory was 22.8 MB in the beginning and 21.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:20,800 INFO L168 Benchmark]: RCFGBuilder took 322.18 ms. Allocated memory was 46.7 MB in the beginning and 47.2 MB in the end (delta: 524.3 kB). Free memory was 21.2 MB in the beginning and 23.0 MB in the end (delta: -1.8 MB). Peak memory consumption was 10.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:20,801 INFO L168 Benchmark]: BuchiAutomizer took 6768.48 ms. Allocated memory was 47.2 MB in the beginning and 83.4 MB in the end (delta: 36.2 MB). Free memory was 22.7 MB in the beginning and 9.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 49.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:20,803 INFO L168 Benchmark]: Witness Printer took 57.51 ms. Allocated memory is still 83.4 MB. Free memory was 9.8 MB in the beginning and 7.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:20,810 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 34.6 MB. Free memory was 11.5 MB in the beginning and 11.5 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 656.53 ms. Allocated memory was 37.2 MB in the beginning and 46.7 MB in the end (delta: 9.4 MB). Free memory was 16.9 MB in the beginning and 24.9 MB in the end (delta: -7.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 48.20 ms. Allocated memory is still 46.7 MB. Free memory was 24.6 MB in the beginning and 22.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 29.22 ms. Allocated memory is still 46.7 MB. Free memory was 22.8 MB in the beginning and 21.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 322.18 ms. Allocated memory was 46.7 MB in the beginning and 47.2 MB in the end (delta: 524.3 kB). Free memory was 21.2 MB in the beginning and 23.0 MB in the end (delta: -1.8 MB). Peak memory consumption was 10.7 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 6768.48 ms. Allocated memory was 47.2 MB in the beginning and 83.4 MB in the end (delta: 36.2 MB). Free memory was 22.7 MB in the beginning and 9.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 49.1 MB. Max. memory is 14.3 GB. * Witness Printer took 57.51 ms. Allocated memory is still 83.4 MB. Free memory was 9.8 MB in the beginning and 7.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * j + length and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 5.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 65 SDtfs, 107 SDslu, 83 SDs, 0 SdLazy, 210 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital134 mio100 ax100 hnf97 lsp94 ukn80 mio100 lsp62 div100 bol100 ite100 ukn100 eq162 hnf89 smp88 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms 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@5852bfe7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f43f6cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a335972=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@396dceb3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a335972=2, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@6a1f4fb1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@5fbbee65=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@61e84a92=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3d0a57b=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...