./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array06_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/array06_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 f1115824e83a2d445d70fc62014a99239a945a9c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:37:55,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:37:55,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:37:55,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:37:55,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:37:55,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:37:55,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:37:55,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:37:55,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:37:55,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:37:55,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:37:55,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:37:55,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:37:55,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:37:55,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:37:55,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:37:55,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:37:55,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:37:55,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:37:55,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:37:55,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:37:55,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:37:55,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:37:55,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:37:55,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:37:55,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:37:55,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:37:55,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:37:55,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:37:55,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:37:55,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:37:55,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:37:55,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:37:55,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:37:55,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:37:55,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:37:55,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:37:55,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:37:55,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:37:55,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:37:55,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:37:55,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:37:55,423 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:37:55,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:37:55,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:37:55,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:37:55,430 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:37:55,431 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:37:55,431 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:37:55,431 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:37:55,432 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:37:55,432 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:37:55,432 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:37:55,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:37:55,434 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:37:55,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:37:55,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:37:55,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:37:55,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:37:55,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:37:55,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:37:55,437 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:37:55,438 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:37:55,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:37:55,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:37:55,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:37:55,439 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:37:55,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:37:55,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:37:55,440 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:37:55,441 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:37:55,442 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:37:55,443 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 -> f1115824e83a2d445d70fc62014a99239a945a9c [2020-07-29 01:37:55,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:37:55,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:37:55,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:37:55,827 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:37:55,828 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:37:55,829 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array06_alloca.i [2020-07-29 01:37:55,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1ab0706d/556d3b0a68ed4dc6aae65e22c8bfeacd/FLAG197c7c83c [2020-07-29 01:37:56,433 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:37:56,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array06_alloca.i [2020-07-29 01:37:56,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1ab0706d/556d3b0a68ed4dc6aae65e22c8bfeacd/FLAG197c7c83c [2020-07-29 01:37:56,774 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1ab0706d/556d3b0a68ed4dc6aae65e22c8bfeacd [2020-07-29 01:37:56,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:37:56,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:37:56,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:56,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:37:56,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:37:56,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:56" (1/1) ... [2020-07-29 01:37:56,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a37da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:56, skipping insertion in model container [2020-07-29 01:37:56,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:56" (1/1) ... [2020-07-29 01:37:56,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:37:56,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:37:57,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:57,460 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:37:57,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:57,643 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:37:57,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:57 WrapperNode [2020-07-29 01:37:57,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:57,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:57,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:37:57,647 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:37:57,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:57" (1/1) ... [2020-07-29 01:37:57,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:57" (1/1) ... [2020-07-29 01:37:57,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:57,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:37:57,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:37:57,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:37:57,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:57" (1/1) ... [2020-07-29 01:37:57,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:57" (1/1) ... [2020-07-29 01:37:57,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:57" (1/1) ... [2020-07-29 01:37:57,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:57" (1/1) ... [2020-07-29 01:37:57,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:57" (1/1) ... [2020-07-29 01:37:57,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:57" (1/1) ... [2020-07-29 01:37:57,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:57" (1/1) ... [2020-07-29 01:37:57,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:37:57,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:37:57,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:37:57,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:37:57,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:57" (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-07-29 01:37:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:37:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:37:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:37:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:37:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:37:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:37:58,237 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:37:58,238 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:37:58,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:58 BoogieIcfgContainer [2020-07-29 01:37:58,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:37:58,242 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:37:58,242 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:37:58,246 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:37:58,247 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:58,247 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:37:56" (1/3) ... [2020-07-29 01:37:58,249 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60363f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:58, skipping insertion in model container [2020-07-29 01:37:58,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:58,249 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:57" (2/3) ... [2020-07-29 01:37:58,250 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60363f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:58, skipping insertion in model container [2020-07-29 01:37:58,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:58,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:58" (3/3) ... [2020-07-29 01:37:58,252 INFO L371 chiAutomizerObserver]: Analyzing ICFG array06_alloca.i [2020-07-29 01:37:58,307 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:37:58,308 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:37:58,311 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:37:58,312 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:37:58,312 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:37:58,312 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:37:58,312 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:37:58,312 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:37:58,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:37:58,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:37:58,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:58,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:58,357 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:58,357 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:37:58,357 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:37:58,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:37:58,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:37:58,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:58,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:58,361 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:58,361 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:37:58,368 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, 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; 14#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; 11#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 15#L370-3true [2020-07-29 01:37:58,369 INFO L796 eck$LassoCheckResult]: Loop: 15#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; 13#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L370-3true [2020-07-29 01:37:58,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:58,375 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-07-29 01:37:58,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:58,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549691771] [2020-07-29 01:37:58,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:58,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:58,492 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:58,513 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:58,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:58,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2020-07-29 01:37:58,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:58,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190504825] [2020-07-29 01:37:58,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:58,525 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:58,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:58,536 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:58,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:58,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2020-07-29 01:37:58,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:58,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041301484] [2020-07-29 01:37:58,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:58,567 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:58,587 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:58,592 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:58,856 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:58,857 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:58,857 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:58,857 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:58,858 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:58,858 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:58,858 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:58,858 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:58,858 INFO L133 ssoRankerPreferences]: Filename of dumped script: array06_alloca.i_Iteration1_Lasso [2020-07-29 01:37:58,859 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:58,859 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:58,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:59,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:59,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:59,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:59,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:59,737 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:59,742 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-07-29 01:37:59,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:59,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:59,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:59,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:59,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:59,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:59,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:59,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:59,762 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:59,800 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-07-29 01:37:59,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:59,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:59,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:59,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:59,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:59,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:59,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:59,806 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-07-29 01:37:59,842 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-07-29 01:37:59,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:59,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:59,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:59,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:59,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:59,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:59,862 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-07-29 01:37:59,904 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-07-29 01:37:59,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:59,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:59,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:59,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:59,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:59,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:59,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:59,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:59,933 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-07-29 01:37:59,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:59,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:59,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:59,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:59,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:59,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:59,988 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:00,048 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 01:38:00,048 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,065 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:00,071 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:38:00,072 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:00,073 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset) = 2*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1 - 4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset Supporting invariants [] [2020-07-29 01:38:00,137 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:38:00,143 INFO L393 LassoCheck]: Loop: "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;" "main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207;" [2020-07-29 01:38:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:00,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:38:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:00,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:38:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:00,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:00,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {23#unseeded} is VALID [2020-07-29 01:38:00,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, 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; {23#unseeded} is VALID [2020-07-29 01:38:00,273 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#unseeded} assume !(main_~length~0 < 1); {23#unseeded} is VALID [2020-07-29 01:38:00,274 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#unseeded} 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; {52#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:00,275 INFO L280 TraceCheckUtils]: 4: Hoare triple {52#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {52#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:00,284 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:38:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:00,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:00,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {53#(and (>= oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc206.base|)) (* (- 4) ULTIMATE.start_main_~i~0) (* (- 1) ULTIMATE.start_main_~arr~0.offset))) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|))} 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; {73#(and (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc206.base|)) (+ ULTIMATE.start_main_~arr~0.offset oldRank0 (* 4 ULTIMATE.start_main_~i~0))) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (<= (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0) 4) (select |#length| ULTIMATE.start_main_~arr~0.base)) (<= 0 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0))))} is VALID [2020-07-29 01:38:00,335 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#(and (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc206.base|)) (+ ULTIMATE.start_main_~arr~0.offset oldRank0 (* 4 ULTIMATE.start_main_~i~0))) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (<= (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0) 4) (select |#length| ULTIMATE.start_main_~arr~0.base)) (<= 0 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0))))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {55#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc206.base|)) (* (- 4) ULTIMATE.start_main_~i~0) (* (- 1) ULTIMATE.start_main_~arr~0.offset)))) unseeded))} is VALID [2020-07-29 01:38:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:00,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:38:00,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:00,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:00,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,372 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:38:00,374 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2020-07-29 01:38:00,524 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 27 states and 37 transitions. Complement of second has 9 states. [2020-07-29 01:38:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:38:00,525 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:00,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:38:00,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:00,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:00,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:00,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:38:00,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:00,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:00,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:00,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2020-07-29 01:38:00,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:00,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:00,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:00,539 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states. [2020-07-29 01:38:00,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:00,542 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:38:00,543 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:38:00,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:00,546 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:00,546 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 37 transitions. cyclomatic complexity: 14 [2020-07-29 01:38:00,547 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:00,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:00,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:00,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:00,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:00,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:00,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:00,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:00,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:00,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:00,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:38:00,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:38:00,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:38:00,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:38:00,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:38:00,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:38:00,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:38:00,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:38:00,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:38:00,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:00,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:00,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:00,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:38:00,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:38:00,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:38:00,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:00,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:00,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:00,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:38:00,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:38:00,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:38:00,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:00,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:00,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:00,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:00,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:00,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:00,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,568 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:38:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-07-29 01:38:00,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:00,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:00,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:38:00,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:00,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. cyclomatic complexity: 14 [2020-07-29 01:38:00,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:00,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 10 states and 13 transitions. [2020-07-29 01:38:00,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:38:00,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:38:00,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2020-07-29 01:38:00,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:00,587 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:38:00,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2020-07-29 01:38:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-29 01:38:00,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:00,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:38:00,618 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:38:00,620 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:38:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:00,625 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:38:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:38:00,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:00,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:00,628 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:38:00,628 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:38:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:00,629 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:38:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:38:00,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:00,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:00,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:00,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:38:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-29 01:38:00,633 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:38:00,634 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:38:00,634 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:38:00,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:38:00,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:00,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:00,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:00,636 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:00,636 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:38:00,636 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 119#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, 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; 120#L367 assume !(main_~length~0 < 1); 123#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; 124#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 125#L370-3 assume !(main_~i~0 < main_~length~0); 121#L370-4 main_~j~0 := 0; 118#L374-2 [2020-07-29 01:38:00,637 INFO L796 eck$LassoCheckResult]: Loop: 118#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; 118#L374-2 [2020-07-29 01:38:00,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:00,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2020-07-29 01:38:00,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:00,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652767656] [2020-07-29 01:38:00,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:00,714 INFO L280 TraceCheckUtils]: 0: Hoare triple {151#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {151#true} is VALID [2020-07-29 01:38:00,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, 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; {151#true} is VALID [2020-07-29 01:38:00,716 INFO L280 TraceCheckUtils]: 2: Hoare triple {151#true} assume !(main_~length~0 < 1); {153#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:38:00,717 INFO L280 TraceCheckUtils]: 3: Hoare triple {153#(<= 1 ULTIMATE.start_main_~length~0)} 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; {153#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:38:00,718 INFO L280 TraceCheckUtils]: 4: Hoare triple {153#(<= 1 ULTIMATE.start_main_~length~0)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {154#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:38:00,720 INFO L280 TraceCheckUtils]: 5: Hoare triple {154#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} assume !(main_~i~0 < main_~length~0); {152#false} is VALID [2020-07-29 01:38:00,720 INFO L280 TraceCheckUtils]: 6: Hoare triple {152#false} main_~j~0 := 0; {152#false} is VALID [2020-07-29 01:38:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:00,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652767656] [2020-07-29 01:38:00,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:38:00,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:38:00,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627115243] [2020-07-29 01:38:00,727 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:38:00,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:00,728 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2020-07-29 01:38:00,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:00,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027660403] [2020-07-29 01:38:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:00,736 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:00,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:00,744 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:00,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:00,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:38:00,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:38:00,805 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-29 01:38:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:00,860 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:38:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:38:00,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:38:00,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:00,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2020-07-29 01:38:00,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:00,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2020-07-29 01:38:00,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:38:00,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:38:00,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-07-29 01:38:00,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:00,876 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 01:38:00,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-07-29 01:38:00,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-29 01:38:00,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:00,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:38:00,878 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:38:00,878 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:38:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:00,879 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:38:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:38:00,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:00,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:00,897 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states and 13 transitions. [2020-07-29 01:38:00,897 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states and 13 transitions. [2020-07-29 01:38:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:00,899 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:38:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:38:00,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:00,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:00,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:00,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:38:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-07-29 01:38:00,915 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-29 01:38:00,915 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-29 01:38:00,916 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:38:00,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-07-29 01:38:00,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:00,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:00,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:00,917 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:00,919 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:38:00,920 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 169#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, 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; 170#L367 assume !(main_~length~0 < 1); 173#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; 174#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 175#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; 176#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 177#L370-3 assume !(main_~i~0 < main_~length~0); 171#L370-4 main_~j~0 := 0; 168#L374-2 [2020-07-29 01:38:00,920 INFO L796 eck$LassoCheckResult]: Loop: 168#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; 168#L374-2 [2020-07-29 01:38:00,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:00,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2020-07-29 01:38:00,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:00,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022839802] [2020-07-29 01:38:00,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:00,962 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:00,987 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:00,997 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:00,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:00,997 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2020-07-29 01:38:00,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:00,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722988148] [2020-07-29 01:38:00,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:01,009 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:01,016 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:01,020 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:01,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:01,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2020-07-29 01:38:01,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:01,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103917681] [2020-07-29 01:38:01,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:01,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:01,051 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:01,055 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:01,230 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2020-07-29 01:38:01,332 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:01,332 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:01,332 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:01,332 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:01,333 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:01,333 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:01,333 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:01,333 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:01,334 INFO L133 ssoRankerPreferences]: Filename of dumped script: array06_alloca.i_Iteration3_Lasso [2020-07-29 01:38:01,334 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:01,334 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:01,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:01,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:01,542 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:38:01,542 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:38:01,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:01,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:01,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:01,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:01,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:01,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:01,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:02,073 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:02,073 INFO L489 LassoAnalysis]: Using template 'affine'. 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-07-29 01:38:02,077 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-07-29 01:38:02,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:02,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:02,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:02,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:02,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:02,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-07-29 01:38:02,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:02,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:02,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:02,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:02,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-07-29 01:38:02,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:02,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:02,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:02,241 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-07-29 01:38:02,268 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-07-29 01:38:02,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:02,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:02,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:02,280 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-07-29 01:38:02,305 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-07-29 01:38:02,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:02,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:02,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:02,321 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 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-07-29 01:38:02,343 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-07-29 01:38:02,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:02,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:02,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:02,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:02,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:02,388 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-07-29 01:38:02,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:02,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:02,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:02,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:02,449 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-07-29 01:38:02,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:02,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:02,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:02,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:02,454 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-07-29 01:38:02,496 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-07-29 01:38:02,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:02,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:02,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:02,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:02,503 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-07-29 01:38:02,527 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-07-29 01:38:02,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:02,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:02,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:02,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:02,531 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) [2020-07-29 01:38:02,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:02,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:02,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:02,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:02,563 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) [2020-07-29 01:38:02,600 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-07-29 01:38:02,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:02,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:02,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:02,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:02,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-07-29 01:38:02,636 INFO L489 LassoAnalysis]: Using template '2-nested'. 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) [2020-07-29 01:38:02,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:02,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:02,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,646 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:02,647 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:38:02,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:02,649 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-07-29 01:38:02,672 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-07-29 01:38:02,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:02,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:02,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:02,675 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:02,692 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-07-29 01:38:02,692 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-07-29 01:38:02,726 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:02,857 INFO L443 ModelExtractionUtils]: Simplification made 29 calls to the SMT solver. [2020-07-29 01:38:02,857 INFO L444 ModelExtractionUtils]: 9 out of 51 variables were initially zero. Simplification set additionally 37 variables to zero. 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-07-29 01:38:02,863 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:02,872 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2020-07-29 01:38:02,872 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:02,872 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)))_1 + 1*ULTIMATE.start_main_~length~0 f1 = -2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-07-29 01:38:02,930 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:38:02,937 INFO L393 LassoCheck]: Loop: "assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209;" [2020-07-29 01:38:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:02,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:02,948 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:02,948 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:02,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:03,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:38:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:03,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:03,078 INFO L280 TraceCheckUtils]: 0: Hoare triple {209#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {209#unseeded} is VALID [2020-07-29 01:38:03,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {209#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, 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; {209#unseeded} is VALID [2020-07-29 01:38:03,080 INFO L280 TraceCheckUtils]: 2: Hoare triple {209#unseeded} assume !(main_~length~0 < 1); {209#unseeded} is VALID [2020-07-29 01:38:03,081 INFO L280 TraceCheckUtils]: 3: Hoare triple {209#unseeded} 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; {209#unseeded} is VALID [2020-07-29 01:38:03,082 INFO L280 TraceCheckUtils]: 4: Hoare triple {209#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {265#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:38:03,083 INFO L280 TraceCheckUtils]: 5: Hoare triple {265#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} 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; {265#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:38:03,084 INFO L280 TraceCheckUtils]: 6: Hoare triple {265#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {244#(and (= (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)) ULTIMATE.start_main_~arr~0.offset) unseeded)} is VALID [2020-07-29 01:38:03,084 INFO L280 TraceCheckUtils]: 7: Hoare triple {244#(and (= (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)) ULTIMATE.start_main_~arr~0.offset) unseeded)} assume !(main_~i~0 < main_~length~0); {244#(and (= (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)) ULTIMATE.start_main_~arr~0.offset) unseeded)} is VALID [2020-07-29 01:38:03,085 INFO L280 TraceCheckUtils]: 8: Hoare triple {244#(and (= (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)) ULTIMATE.start_main_~arr~0.offset) unseeded)} main_~j~0 := 0; {244#(and (= (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)) ULTIMATE.start_main_~arr~0.offset) unseeded)} is VALID [2020-07-29 01:38:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:03,094 WARN L261 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:38:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:03,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:03,105 INFO L280 TraceCheckUtils]: 0: Hoare triple {245#(and (>= oldRank1 (ite (> (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)))) ULTIMATE.start_main_~length~0) 0) (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)))) ULTIMATE.start_main_~length~0) (+ (* (- 2) ULTIMATE.start_main_~j~0) (* 2 ULTIMATE.start_main_~length~0)))) (= (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)) ULTIMATE.start_main_~arr~0.offset) (>= oldRank0 (ite (> (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)))) ULTIMATE.start_main_~length~0) 0) 1 0)))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; {247#(and (= (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)) ULTIMATE.start_main_~arr~0.offset) (or (and (> oldRank0 (ite (> (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)))) ULTIMATE.start_main_~length~0) 0) 1 0)) (>= oldRank0 0)) (and (>= oldRank1 0) (> oldRank1 (ite (> (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)))) ULTIMATE.start_main_~length~0) 0) (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)))) ULTIMATE.start_main_~length~0) (+ (* (- 2) ULTIMATE.start_main_~j~0) (* 2 ULTIMATE.start_main_~length~0)))) (>= oldRank0 (ite (> (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~arr~0.offset (- 4)))) ULTIMATE.start_main_~length~0) 0) 1 0))) unseeded))} is VALID [2020-07-29 01:38:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:03,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:38:03,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:03,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:03,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,122 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2020-07-29 01:38:03,122 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-07-29 01:38:03,326 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 21 transitions. Complement of second has 6 states. [2020-07-29 01:38:03,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 0 non-accepting loop states 2 accepting loop states [2020-07-29 01:38:03,326 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:03,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:38:03,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:03,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:03,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:38:03,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:03,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:03,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:03,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2020-07-29 01:38:03,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:03,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:03,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:03,331 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:38:03,331 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:03,332 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:38:03,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:03,333 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:03,333 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:38:03,334 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:03,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:03,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:03,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:03,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:38:03,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:38:03,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:38:03,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:03,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:03,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:03,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:38:03,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:38:03,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:38:03,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:38:03,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:38:03,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:38:03,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:03,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:03,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:03,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:03,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:03,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:03,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:38:03,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:38:03,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:38:03,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:03,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:03,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:03,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,347 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:38:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2020-07-29 01:38:03,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:03,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:38:03,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:38:03,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:03,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:38:03,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:03,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 15 states and 17 transitions. [2020-07-29 01:38:03,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:38:03,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:38:03,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2020-07-29 01:38:03,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:03,353 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-29 01:38:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2020-07-29 01:38:03,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2020-07-29 01:38:03,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:03,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 17 transitions. Second operand 12 states. [2020-07-29 01:38:03,355 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 17 transitions. Second operand 12 states. [2020-07-29 01:38:03,356 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 12 states. [2020-07-29 01:38:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:03,357 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-29 01:38:03,357 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-29 01:38:03,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:03,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:03,358 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 15 states and 17 transitions. [2020-07-29 01:38:03,358 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 15 states and 17 transitions. [2020-07-29 01:38:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:03,360 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-29 01:38:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-29 01:38:03,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:03,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:03,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:03,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:38:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2020-07-29 01:38:03,362 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-07-29 01:38:03,362 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-07-29 01:38:03,363 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:38:03,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2020-07-29 01:38:03,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:03,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:03,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:03,364 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:03,365 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:38:03,365 INFO L794 eck$LassoCheckResult]: Stem: 314#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 311#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, 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; 312#L367 assume !(main_~length~0 < 1); 315#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; 316#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 317#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; 320#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 321#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; 318#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 319#L370-3 assume !(main_~i~0 < main_~length~0); 313#L370-4 main_~j~0 := 0; 310#L374-2 [2020-07-29 01:38:03,365 INFO L796 eck$LassoCheckResult]: Loop: 310#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; 310#L374-2 [2020-07-29 01:38:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:03,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1332965227, now seen corresponding path program 2 times [2020-07-29 01:38:03,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:03,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399933240] [2020-07-29 01:38:03,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:03,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:03,392 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:03,396 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:03,397 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 3 times [2020-07-29 01:38:03,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:03,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061220822] [2020-07-29 01:38:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:03,403 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:03,407 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:03,409 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:03,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1627750960, now seen corresponding path program 2 times [2020-07-29 01:38:03,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:03,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034736280] [2020-07-29 01:38:03,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:03,428 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:03,443 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:03,451 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:03,712 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2020-07-29 01:38:03,831 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:03,831 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:03,831 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:03,831 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:03,831 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:03,831 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:03,831 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:03,832 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:03,832 INFO L133 ssoRankerPreferences]: Filename of dumped script: array06_alloca.i_Iteration4_Lasso [2020-07-29 01:38:03,832 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:03,832 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:03,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:03,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:03,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:03,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:03,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:03,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:03,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:03,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:03,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:04,026 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 01:38:04,446 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:04,446 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:04,455 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-07-29 01:38:04,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:04,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:04,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:04,501 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-07-29 01:38:04,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:04,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:04,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:04,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,506 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:04,547 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-07-29 01:38:04,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:04,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:04,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:04,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,552 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:04,587 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-07-29 01:38:04,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:04,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:04,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:04,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,592 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 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,622 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-07-29 01:38:04,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:04,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:04,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:04,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:04,628 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 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,659 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-07-29 01:38:04,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:04,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:04,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:04,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:04,663 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 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,685 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-07-29 01:38:04,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:04,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:04,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:04,691 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,714 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-07-29 01:38:04,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:04,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:04,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:04,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:04,719 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,743 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-07-29 01:38:04,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:04,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:04,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:04,769 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,791 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-07-29 01:38:04,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:04,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:04,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:04,802 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:04,837 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-07-29 01:38:04,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:04,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:04,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,845 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:04,881 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-07-29 01:38:04,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:04,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:04,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-07-29 01:38:04,925 INFO L489 LassoAnalysis]: Using template '2-nested'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:04,929 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-07-29 01:38:04,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,931 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:04,933 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-07-29 01:38:04,934 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,943 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:04,976 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-07-29 01:38:04,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:04,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:04,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:04,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:04,978 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:04,979 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:38:04,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:04,981 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:05,005 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-07-29 01:38:05,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:05,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:05,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:05,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:05,006 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:05,007 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:38:05,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:05,008 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:05,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:05,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:05,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:05,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:05,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:05,032 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:05,033 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:38:05,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:05,035 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 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:05,056 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-07-29 01:38:05,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:05,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:05,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:05,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:05,058 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:05,058 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:38:05,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:05,061 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:05,084 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-07-29 01:38:05,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:05,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:05,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:05,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:05,086 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:05,086 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:38:05,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:05,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 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:05,112 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-07-29 01:38:05,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:05,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:05,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:05,114 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:05,115 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-07-29 01:38:05,116 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-07-29 01:38:05,122 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 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:05,144 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-07-29 01:38:05,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:05,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:05,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:05,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:05,147 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:05,147 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:38:05,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:05,149 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 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:05,172 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-07-29 01:38:05,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:05,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:05,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:05,175 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:05,187 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-07-29 01:38:05,187 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-07-29 01:38:05,210 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:05,271 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-07-29 01:38:05,271 INFO L444 ModelExtractionUtils]: 18 out of 46 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:05,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:05,277 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 3. [2020-07-29 01:38:05,278 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:05,278 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~length~0 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2 f1 = -2*ULTIMATE.start_main_~j~0 + 3 Supporting invariants [-1*ULTIMATE.start_main_~length~0 + 2 >= 0] [2020-07-29 01:38:05,317 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:38:05,323 INFO L393 LassoCheck]: Loop: "assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209;" [2020-07-29 01:38:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:05,329 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:05,330 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:05,330 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:05,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:05,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:38:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:05,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:05,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {361#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {361#unseeded} is VALID [2020-07-29 01:38:05,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {361#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, 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#unseeded} is VALID [2020-07-29 01:38:05,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {361#unseeded} assume !(main_~length~0 < 1); {361#unseeded} is VALID [2020-07-29 01:38:05,539 INFO L280 TraceCheckUtils]: 3: Hoare triple {361#unseeded} 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; {361#unseeded} is VALID [2020-07-29 01:38:05,539 INFO L280 TraceCheckUtils]: 4: Hoare triple {361#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {417#(and (<= ULTIMATE.start_main_~i~0 0) unseeded)} is VALID [2020-07-29 01:38:05,540 INFO L280 TraceCheckUtils]: 5: Hoare triple {417#(and (<= ULTIMATE.start_main_~i~0 0) unseeded)} 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; {417#(and (<= ULTIMATE.start_main_~i~0 0) unseeded)} is VALID [2020-07-29 01:38:05,541 INFO L280 TraceCheckUtils]: 6: Hoare triple {417#(and (<= ULTIMATE.start_main_~i~0 0) unseeded)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {424#(and unseeded (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:38:05,542 INFO L280 TraceCheckUtils]: 7: Hoare triple {424#(and unseeded (<= ULTIMATE.start_main_~i~0 1))} 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; {424#(and unseeded (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:38:05,543 INFO L280 TraceCheckUtils]: 8: Hoare triple {424#(and unseeded (<= ULTIMATE.start_main_~i~0 1))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {431#(and (<= ULTIMATE.start_main_~i~0 2) unseeded)} is VALID [2020-07-29 01:38:05,543 INFO L280 TraceCheckUtils]: 9: Hoare triple {431#(and (<= ULTIMATE.start_main_~i~0 2) unseeded)} assume !(main_~i~0 < main_~length~0); {396#(and (>= (+ (* (- 1) ULTIMATE.start_main_~length~0) 2) 0) unseeded)} is VALID [2020-07-29 01:38:05,544 INFO L280 TraceCheckUtils]: 10: Hoare triple {396#(and (>= (+ (* (- 1) ULTIMATE.start_main_~length~0) 2) 0) unseeded)} main_~j~0 := 0; {396#(and (>= (+ (* (- 1) ULTIMATE.start_main_~length~0) 2) 0) unseeded)} is VALID [2020-07-29 01:38:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:05,550 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:38:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:05,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:05,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {397#(and (>= oldRank1 (ite (> (+ ULTIMATE.start_main_~length~0 (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) 0) (+ ULTIMATE.start_main_~length~0 (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) (+ (* (- 2) ULTIMATE.start_main_~j~0) 3))) (>= (+ (* (- 1) ULTIMATE.start_main_~length~0) 2) 0) (>= oldRank0 (ite (> (+ ULTIMATE.start_main_~length~0 (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) 0) 1 0)))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; {399#(and (or (and (>= oldRank1 0) (> oldRank1 (ite (> (+ ULTIMATE.start_main_~length~0 (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) 0) (+ ULTIMATE.start_main_~length~0 (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) (+ (* (- 2) ULTIMATE.start_main_~j~0) 3))) (>= oldRank0 (ite (> (+ ULTIMATE.start_main_~length~0 (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) 0) 1 0))) (and (>= oldRank0 0) (> oldRank0 (ite (> (+ ULTIMATE.start_main_~length~0 (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) 0) 1 0))) unseeded) (>= (+ (* (- 1) ULTIMATE.start_main_~length~0) 2) 0))} is VALID [2020-07-29 01:38:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:05,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:38:05,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:05,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:38:05,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,580 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 1 loop predicates [2020-07-29 01:38:05,580 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-07-29 01:38:05,908 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 27 states and 31 transitions. Complement of second has 11 states. [2020-07-29 01:38:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 8 stem states 0 non-accepting loop states 2 accepting loop states [2020-07-29 01:38:05,908 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:05,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. cyclomatic complexity: 4 [2020-07-29 01:38:05,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:05,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:05,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:38:05,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:05,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:05,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:05,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2020-07-29 01:38:05,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:05,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:05,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:05,914 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 14 transitions. cyclomatic complexity: 4 [2020-07-29 01:38:05,915 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:05,915 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:38:05,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:05,917 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:05,917 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 31 transitions. cyclomatic complexity: 8 [2020-07-29 01:38:05,917 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:05,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:38:05,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:38:05,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:38:05,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:38:05,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:38:05,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:38:05,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2020-07-29 01:38:05,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 1 letters. [2020-07-29 01:38:05,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 1 letters. [2020-07-29 01:38:05,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:38:05,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:38:05,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:38:05,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:38:05,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:38:05,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:38:05,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:38:05,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:38:05,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:38:05,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:38:05,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:38:05,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:38:05,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:38:05,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:38:05,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:38:05,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2020-07-29 01:38:05,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 1 letters. [2020-07-29 01:38:05,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 1 letters. [2020-07-29 01:38:05,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,928 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:38:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2020-07-29 01:38:05,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 27 transitions. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:38:05,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 27 transitions. Stem has 12 letters. Loop has 1 letters. [2020-07-29 01:38:05,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 27 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:38:05,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. cyclomatic complexity: 8 [2020-07-29 01:38:05,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:05,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 17 states and 18 transitions. [2020-07-29 01:38:05,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:38:05,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:38:05,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2020-07-29 01:38:05,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:05,935 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-07-29 01:38:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2020-07-29 01:38:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2020-07-29 01:38:05,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:05,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 18 transitions. Second operand 14 states. [2020-07-29 01:38:05,937 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 18 transitions. Second operand 14 states. [2020-07-29 01:38:05,937 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 14 states. [2020-07-29 01:38:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:05,938 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-29 01:38:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-29 01:38:05,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:05,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:05,939 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 17 states and 18 transitions. [2020-07-29 01:38:05,939 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 17 states and 18 transitions. [2020-07-29 01:38:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:05,940 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-29 01:38:05,940 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-29 01:38:05,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:05,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:05,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:05,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:38:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-29 01:38:05,943 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-29 01:38:05,943 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-29 01:38:05,943 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:38:05,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2020-07-29 01:38:05,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:05,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:05,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:05,944 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:05,944 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:38:05,944 INFO L794 eck$LassoCheckResult]: Stem: 496#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 493#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, 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; 494#L367 assume !(main_~length~0 < 1); 497#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; 498#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 499#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; 502#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 503#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; 500#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 501#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; 505#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); 495#L370-4 main_~j~0 := 0; 492#L374-2 [2020-07-29 01:38:05,944 INFO L796 eck$LassoCheckResult]: Loop: 492#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; 492#L374-2 [2020-07-29 01:38:05,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:05,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1079272553, now seen corresponding path program 3 times [2020-07-29 01:38:05,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:05,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49335125] [2020-07-29 01:38:05,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:05,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:05,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:05,974 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:05,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:05,975 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 4 times [2020-07-29 01:38:05,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:05,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183254817] [2020-07-29 01:38:05,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:05,980 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:05,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:05,984 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:05,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:05,985 INFO L82 PathProgramCache]: Analyzing trace with hash 902289262, now seen corresponding path program 3 times [2020-07-29 01:38:05,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:05,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069623267] [2020-07-29 01:38:05,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:06,001 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:06,015 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:06,019 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:06,336 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2020-07-29 01:38:06,456 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:06,456 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:06,456 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:06,456 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:06,456 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:06,457 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:06,457 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:06,457 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:06,457 INFO L133 ssoRankerPreferences]: Filename of dumped script: array06_alloca.i_Iteration5_Lasso [2020-07-29 01:38:06,457 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:06,457 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:06,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:06,609 WARN L257 bleTransFormulaUtils]: 3 quantified variables [2020-07-29 01:38:06,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:06,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:06,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:06,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:06,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:06,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:06,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:06,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:06,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:07,105 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:07,105 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,116 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-07-29 01:38:07,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:07,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:07,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:07,128 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:07,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:07,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:07,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:07,160 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,194 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-07-29 01:38:07,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:07,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:07,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:07,201 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 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,224 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-07-29 01:38:07,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:07,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:07,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:07,243 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 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,265 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-07-29 01:38:07,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:07,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:07,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:07,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:07,269 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 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,291 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-07-29 01:38:07,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:07,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:07,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:07,297 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,320 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-07-29 01:38:07,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:07,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:07,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:07,327 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 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,359 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-07-29 01:38:07,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:07,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:07,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:07,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:07,362 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 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,385 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-07-29 01:38:07,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:07,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:07,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:07,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:07,388 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,412 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-07-29 01:38:07,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:07,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:07,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:07,417 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,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-07-29 01:38:07,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:07,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:07,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:07,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:07,449 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,470 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-07-29 01:38:07,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:07,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:07,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:07,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:07,474 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 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,497 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-07-29 01:38:07,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:07,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:07,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:07,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:07,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-07-29 01:38:07,522 INFO L489 LassoAnalysis]: Using template '2-nested'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:07,524 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-07-29 01:38:07,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,526 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,529 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-07-29 01:38:07,529 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-07-29 01:38:07,537 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:38:07,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,561 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:07,564 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-07-29 01:38:07,565 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-07-29 01:38:07,573 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,604 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-07-29 01:38:07,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,606 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:07,607 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-07-29 01:38:07,607 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-07-29 01:38:07,611 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,635 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-07-29 01:38:07,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:07,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:07,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:07,637 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:07,643 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-07-29 01:38:07,644 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-07-29 01:38:07,663 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:07,705 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2020-07-29 01:38:07,705 INFO L444 ModelExtractionUtils]: 17 out of 41 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:07,711 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:07,713 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2020-07-29 01:38:07,713 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:07,713 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_4 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_3 f1 = -2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-07-29 01:38:07,746 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:38:07,750 INFO L393 LassoCheck]: Loop: "assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209;" [2020-07-29 01:38:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:07,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:38:07,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:07,758 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:38:07,759 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:07,759 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:38:07,759 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:07,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:07,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:38:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:07,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:07,837 INFO L280 TraceCheckUtils]: 0: Hoare triple {549#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {549#unseeded} is VALID [2020-07-29 01:38:07,837 INFO L280 TraceCheckUtils]: 1: Hoare triple {549#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, 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; {549#unseeded} is VALID [2020-07-29 01:38:07,838 INFO L280 TraceCheckUtils]: 2: Hoare triple {549#unseeded} assume !(main_~length~0 < 1); {549#unseeded} is VALID [2020-07-29 01:38:07,839 INFO L280 TraceCheckUtils]: 3: Hoare triple {549#unseeded} 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; {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:07,840 INFO L280 TraceCheckUtils]: 4: Hoare triple {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:07,841 INFO L280 TraceCheckUtils]: 5: Hoare triple {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} 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; {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:07,842 INFO L280 TraceCheckUtils]: 6: Hoare triple {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:07,844 INFO L280 TraceCheckUtils]: 7: Hoare triple {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} 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; {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:07,845 INFO L280 TraceCheckUtils]: 8: Hoare triple {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:07,847 INFO L280 TraceCheckUtils]: 9: Hoare triple {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} 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; {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:07,848 INFO L280 TraceCheckUtils]: 10: Hoare triple {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:07,849 INFO L280 TraceCheckUtils]: 11: Hoare triple {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} assume !(main_~i~0 < main_~length~0); {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:07,849 INFO L280 TraceCheckUtils]: 12: Hoare triple {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} main_~j~0 := 0; {579#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:07,856 WARN L261 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:38:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:07,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:07,864 INFO L280 TraceCheckUtils]: 0: Hoare triple {580#(and (>= oldRank1 (ite (> (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) 0) (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) (+ (* (- 2) ULTIMATE.start_main_~j~0) (* 2 ULTIMATE.start_main_~length~0)))) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (>= oldRank0 (ite (> (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) 0) 1 0)))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; {582#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (or (and (>= oldRank1 0) (> oldRank1 (ite (> (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) 0) (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) (+ (* (- 2) ULTIMATE.start_main_~j~0) (* 2 ULTIMATE.start_main_~length~0)))) (>= oldRank0 (ite (> (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) 0) 1 0))) (and (>= oldRank0 0) (> oldRank0 (ite (> (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset))) 0) 1 0))) unseeded))} is VALID [2020-07-29 01:38:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:07,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:38:07,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:07,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:07,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,878 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2020-07-29 01:38:07,878 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:38:07,968 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 15 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 15 states and 16 transitions. Complement of second has 3 states. [2020-07-29 01:38:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2020-07-29 01:38:07,968 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:07,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. cyclomatic complexity: 3 [2020-07-29 01:38:07,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:07,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:07,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:38:07,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:07,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:07,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:07,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-07-29 01:38:07,971 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:38:07,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:38:07,972 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 15 transitions. cyclomatic complexity: 3 [2020-07-29 01:38:07,972 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:07,972 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:38:07,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:07,973 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:07,973 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 16 transitions. cyclomatic complexity: 3 [2020-07-29 01:38:07,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. cyclomatic complexity: 3 [2020-07-29 01:38:07,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:38:07,973 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:38:07,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:07,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:07,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:07,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:07,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:07,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:07,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:38:07,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:38:07,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:38:07,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:38:07,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:38:07,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:38:07,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:07,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:07,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:07,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:07,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:07,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:07,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:07,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:07,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:07,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,978 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:38:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 01:38:07,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 13 letters. Loop has 1 letters. [2020-07-29 01:38:07,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:38:07,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:38:07,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:07,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. cyclomatic complexity: 3 [2020-07-29 01:38:07,981 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:38:07,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2020-07-29 01:38:07,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:38:07,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:38:07,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:38:07,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:07,981 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:38:07,981 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:38:07,981 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:38:07,982 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:38:07,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:38:07,982 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:38:07,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:38:07,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:38:07 BoogieIcfgContainer [2020-07-29 01:38:07,989 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:38:07,989 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:38:07,989 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:38:07,989 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:38:07,990 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:58" (3/4) ... [2020-07-29 01:38:07,994 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:38:07,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:38:07,996 INFO L168 Benchmark]: Toolchain (without parser) took 11216.35 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -116.5 MB). Peak memory consumption was 208.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:07,996 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:38:07,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 862.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:07,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:38:07,998 INFO L168 Benchmark]: Boogie Preprocessor took 29.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:07,998 INFO L168 Benchmark]: RCFGBuilder took 488.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:07,999 INFO L168 Benchmark]: BuchiAutomizer took 9746.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 198.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:07,999 INFO L168 Benchmark]: Witness Printer took 4.83 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:38:08,002 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 862.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 488.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9746.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 198.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.83 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -4 * i + -1 * arr and consists of 6 locations. One deterministic module has 2-nested ranking function (if -2 * unknown-#memory_int-unknown[arr][i * 4 + arr + -4] + length > 0 then 1 else 0), (if -2 * unknown-#memory_int-unknown[arr][i * 4 + arr + -4] + length > 0 then -2 * unknown-#memory_int-unknown[arr][i * 4 + arr + -4] + length else -2 * j + 2 * length) and consists of 5 locations. One deterministic module has 2-nested ranking function (if length + -2 * unknown-#memory_int-unknown[arr][arr] > 0 then 1 else 0), (if length + -2 * unknown-#memory_int-unknown[arr][arr] > 0 then length + -2 * unknown-#memory_int-unknown[arr][arr] else -2 * j + 3) and consists of 10 locations. One deterministic module has 2-nested ranking function (if unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -2 * unknown-#memory_int-unknown[arr][arr] > 0 then 1 else 0), (if unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -2 * unknown-#memory_int-unknown[arr][arr] > 0 then unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -2 * unknown-#memory_int-unknown[arr][arr] else -2 * j + 2 * length) and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.6s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 7.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 35 SDtfs, 60 SDslu, 33 SDs, 0 SdLazy, 80 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital126 mio100 ax100 hnf98 lsp94 ukn77 mio100 lsp69 div100 bol100 ite100 ukn100 eq170 hnf89 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 202ms VariablesStem: 10 VariablesLoop: 11 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...