./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/count_up_and_down_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 00bfc508b8ea24f88f85b042e795fbae14e8287990a04ebdf542583ad129e19a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:34:42,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:34:42,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:34:42,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:34:42,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:34:42,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:34:42,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:34:42,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:34:42,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:34:42,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:34:42,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:34:42,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:34:42,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:34:42,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:34:42,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:34:42,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:34:42,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:34:42,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:34:42,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:34:42,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:34:42,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:34:42,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:34:42,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:34:42,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:34:42,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:34:42,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:34:42,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:34:42,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:34:42,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:34:42,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:34:42,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:34:42,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:34:42,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:34:42,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:34:42,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:34:42,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:34:42,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:34:42,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:34:42,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:34:42,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:34:42,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:34:42,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:34:42,758 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:34:42,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:34:42,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:34:42,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:34:42,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:34:42,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:34:42,760 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:34:42,760 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:34:42,760 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:34:42,761 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:34:42,761 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:34:42,761 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:34:42,762 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:34:42,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:34:42,762 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:34:42,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:34:42,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:34:42,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:34:42,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:34:42,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:34:42,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:34:42,763 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:34:42,763 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:34:42,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:34:42,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:34:42,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:34:42,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:34:42,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:34:42,765 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:34:42,765 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 00bfc508b8ea24f88f85b042e795fbae14e8287990a04ebdf542583ad129e19a [2022-02-21 03:34:42,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:34:42,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:34:42,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:34:42,975 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:34:42,975 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:34:42,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2022-02-21 03:34:43,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9de1ece18/7a4c167aa23b40f2b21b62f6b4bd9b07/FLAGdc9518a7a [2022-02-21 03:34:43,451 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:34:43,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2022-02-21 03:34:43,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9de1ece18/7a4c167aa23b40f2b21b62f6b4bd9b07/FLAGdc9518a7a [2022-02-21 03:34:43,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9de1ece18/7a4c167aa23b40f2b21b62f6b4bd9b07 [2022-02-21 03:34:43,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:34:43,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:34:43,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:43,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:34:43,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:34:43,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:43" (1/1) ... [2022-02-21 03:34:43,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39f9ae68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:43, skipping insertion in model container [2022-02-21 03:34:43,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:43" (1/1) ... [2022-02-21 03:34:43,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:34:43,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:34:44,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:44,082 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:34:44,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:44,148 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:34:44,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:44 WrapperNode [2022-02-21 03:34:44,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:44,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:44,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:34:44,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:34:44,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:44" (1/1) ... [2022-02-21 03:34:44,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:44" (1/1) ... [2022-02-21 03:34:44,197 INFO L137 Inliner]: procedures = 151, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2022-02-21 03:34:44,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:44,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:34:44,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:34:44,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:34:44,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:44" (1/1) ... [2022-02-21 03:34:44,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:44" (1/1) ... [2022-02-21 03:34:44,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:44" (1/1) ... [2022-02-21 03:34:44,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:44" (1/1) ... [2022-02-21 03:34:44,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:44" (1/1) ... [2022-02-21 03:34:44,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:44" (1/1) ... [2022-02-21 03:34:44,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:44" (1/1) ... [2022-02-21 03:34:44,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:34:44,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:34:44,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:34:44,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:34:44,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:44" (1/1) ... [2022-02-21 03:34:44,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:44,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:44,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:44,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:34:44,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:34:44,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:34:44,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:34:44,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:34:44,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:34:44,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:34:44,361 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:34:44,372 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:34:44,562 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:34:44,566 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:34:44,566 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:34:44,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:44 BoogieIcfgContainer [2022-02-21 03:34:44,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:34:44,569 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:34:44,569 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:34:44,571 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:34:44,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:44,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:34:43" (1/3) ... [2022-02-21 03:34:44,573 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e26ca63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:44, skipping insertion in model container [2022-02-21 03:34:44,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:44,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:44" (2/3) ... [2022-02-21 03:34:44,574 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e26ca63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:44, skipping insertion in model container [2022-02-21 03:34:44,574 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:44,574 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:44" (3/3) ... [2022-02-21 03:34:44,575 INFO L388 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca.i [2022-02-21 03:34:44,627 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:34:44,627 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:34:44,628 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:34:44,628 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:34:44,628 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:34:44,628 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:34:44,628 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:34:44,628 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:34:44,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:44,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:34:44,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:44,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:44,665 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:44,665 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:44,665 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:34:44,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:44,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:34:44,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:44,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:44,670 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:44,671 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:44,676 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem208#1, main_#t~post207#1, main_#t~mem211#1, main_#t~post212#1, main_#t~mem210#1, main_#t~post209#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 15#L367true assume !(main_~length~0#1 < 1); 12#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 8#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 3#L371-3true [2022-02-21 03:34:44,676 INFO L793 eck$LassoCheckResult]: Loop: 3#L371-3true assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem208#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int(1 + main_#t~mem208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem208#1; 14#L371-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3#L371-3true [2022-02-21 03:34:44,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-02-21 03:34:44,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:44,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152859076] [2022-02-21 03:34:44,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:44,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:44,824 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2022-02-21 03:34:44,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:44,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343579535] [2022-02-21 03:34:44,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:44,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:44,847 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:44,854 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:44,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:44,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2022-02-21 03:34:44,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:44,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207372748] [2022-02-21 03:34:44,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:44,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:44,877 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:44,895 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:45,202 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:45,203 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:45,203 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:45,203 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:45,203 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:45,203 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:45,203 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:45,203 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:45,203 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration1_Lasso [2022-02-21 03:34:45,204 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:45,204 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:45,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,737 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:34:45,740 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:34:45,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:45,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:45,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:45,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:34:45,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:45,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:45,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:45,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:45,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:45,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:45,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:45,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:45,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:34:45,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:45,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:45,784 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:45,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:45,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:45,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:45,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:45,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:45,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:45,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:45,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:45,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:34:45,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:45,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:45,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:45,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:45,843 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:45,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:34:45,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:45,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:45,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:45,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:45,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:45,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:45,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:45,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:45,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:45,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:45,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:45,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:45,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:45,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:34:45,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:45,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:45,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:45,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:45,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:45,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:45,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:45,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:45,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:45,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:45,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:45,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:45,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:45,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:34:45,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:45,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:45,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:45,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:45,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:45,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:45,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:45,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:45,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:45,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:34:45,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:45,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:45,983 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:45,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:34:45,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:45,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:45,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:45,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:45,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:45,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:45,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:45,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:45,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:46,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:34:46,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:46,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:46,018 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:46,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:34:46,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:46,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:46,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:46,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:46,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:46,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:46,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:46,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:46,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:46,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:46,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:46,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:46,085 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:46,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:34:46,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:46,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:46,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:46,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:46,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:46,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:46,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:46,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:46,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:46,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:46,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:46,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:46,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:46,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:34:46,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:46,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:46,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:46,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:46,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:46,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:46,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:46,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:46,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:46,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:46,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:46,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:46,156 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:46,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:34:46,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:46,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:46,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:46,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:46,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:46,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:46,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:46,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:46,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:46,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:46,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:46,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:46,186 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:46,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:34:46,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:46,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:46,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:46,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:46,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:46,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:46,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:46,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:46,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:46,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:46,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:46,234 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:46,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:34:46,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:46,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:46,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:46,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:46,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:46,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:46,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:46,274 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:34:46,300 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-02-21 03:34:46,301 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-02-21 03:34:46,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:46,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:46,312 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:46,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:34:46,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:34:46,381 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:34:46,382 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:34:46,382 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~length~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~length~0#1 Supporting invariants [] [2022-02-21 03:34:46,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:46,432 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 03:34:46,436 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem208#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int(1 + main_#t~mem208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem208#1;" "main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1;" [2022-02-21 03:34:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:46,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:46,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:34:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:46,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:46,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2022-02-21 03:34:46,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem208#1, main_#t~post207#1, main_#t~mem211#1, main_#t~post212#1, main_#t~mem210#1, main_#t~post209#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {26#unseeded} is VALID [2022-02-21 03:34:46,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~length~0#1 < 1); {26#unseeded} is VALID [2022-02-21 03:34:46,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#unseeded} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {26#unseeded} is VALID [2022-02-21 03:34:46,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#unseeded} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; {26#unseeded} is VALID [2022-02-21 03:34:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:46,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:34:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:46,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:46,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem208#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int(1 + main_#t~mem208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem208#1; {76#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|)) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:34:46,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {76#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|)) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length~0#1|))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {59#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|))) unseeded)} is VALID [2022-02-21 03:34:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:46,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:46,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:46,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:34:46,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,558 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:34:46,559 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:46,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:46,664 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 54 transitions. Complement of second has 7 states. [2022-02-21 03:34:46,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:34:46,666 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:46,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:46,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:34:46,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:46,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:46,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:46,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:46,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:46,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:46,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2022-02-21 03:34:46,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:34:46,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:46,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:46,685 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:46,688 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:34:46,690 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:34:46,690 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:46,694 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:46,697 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:46,698 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 54 transitions. cyclomatic complexity: 19 [2022-02-21 03:34:46,699 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:34:46,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:34:46,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:34:46,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:34:46,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:46,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:46,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:46,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:46,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:46,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:46,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:34:46,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:34:46,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:34:46,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:34:46,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:34:46,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:34:46,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:46,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:46,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:46,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:34:46,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:34:46,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:34:46,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:46,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:46,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:46,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:46,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:46,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:46,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:46,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:46,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:46,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:34:46,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:34:46,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:34:46,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:34:46,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:34:46,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:34:46,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:46,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:46,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:46,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:46,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:46,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:46,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:46,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:46,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:46,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:46,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:46,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:46,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:46,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:46,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:46,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:34:46,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:34:46,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:34:46,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,726 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-02-21 03:34:46,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:34:46,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:46,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:34:46,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:46,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 54 transitions. cyclomatic complexity: 19 [2022-02-21 03:34:46,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:34:46,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 13 states and 17 transitions. [2022-02-21 03:34:46,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:34:46,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:34:46,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2022-02-21 03:34:46,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:46,737 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:34:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2022-02-21 03:34:46,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:34:46,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:46,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:46,754 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:46,756 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:46,758 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:34:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:34:46,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:46,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:46,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 17 transitions. [2022-02-21 03:34:46,759 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 17 transitions. [2022-02-21 03:34:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:46,760 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:34:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:34:46,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:46,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:46,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:46,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-02-21 03:34:46,762 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:34:46,762 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:34:46,762 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:34:46,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:34:46,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:34:46,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:46,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:46,763 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:46,763 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:34:46,763 INFO L791 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 136#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem208#1, main_#t~post207#1, main_#t~mem211#1, main_#t~post212#1, main_#t~mem210#1, main_#t~post209#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 141#L367 assume !(main_~length~0#1 < 1); 139#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 140#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 129#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 130#L371-4 main_~j~0#1 := 0; 134#L374-3 [2022-02-21 03:34:46,764 INFO L793 eck$LassoCheckResult]: Loop: 134#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 137#L375-3 call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 138#L375-1 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1; 133#L374-2 main_#t~post209#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 134#L374-3 [2022-02-21 03:34:46,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:46,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2022-02-21 03:34:46,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:46,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130012467] [2022-02-21 03:34:46,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:46,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:46,774 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:46,793 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:46,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:46,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2036812, now seen corresponding path program 1 times [2022-02-21 03:34:46,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:46,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208947806] [2022-02-21 03:34:46,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:46,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:46,805 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:46,814 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:46,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:46,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1386095268, now seen corresponding path program 1 times [2022-02-21 03:34:46,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:46,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488732661] [2022-02-21 03:34:46,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:46,840 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:46,853 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:47,019 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:47,019 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:47,019 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:47,019 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:47,019 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:47,020 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:47,020 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:47,020 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:47,020 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration2_Lasso [2022-02-21 03:34:47,020 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:47,020 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:47,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:47,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:47,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:47,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:47,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:47,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:47,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:47,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:47,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:47,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:47,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:47,408 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:34:47,408 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:34:47,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:47,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:47,409 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:47,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:34:47,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:47,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:47,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:47,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:47,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:47,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:47,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:47,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:47,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:47,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:47,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:47,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:47,448 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:47,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:34:47,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:47,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:47,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:47,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:47,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:47,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:47,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:47,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:47,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:47,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:47,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:47,499 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:47,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:47,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:47,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:47,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:47,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:47,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:47,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:47,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:47,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:34:47,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:47,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:47,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:47,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:47,544 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:47,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:34:47,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:47,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:47,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:47,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:47,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:47,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:47,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:47,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:47,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:47,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:47,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:47,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:47,591 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:47,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:47,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:47,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:47,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:47,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:47,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:47,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:47,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:47,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:34:47,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:47,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:47,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:47,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:47,656 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:47,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:34:47,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:47,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:47,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:47,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:47,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:47,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:47,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:47,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:47,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:47,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:47,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:47,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:47,701 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:47,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:34:47,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:47,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:47,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:47,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:47,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:47,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:47,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:47,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:47,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:47,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:47,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:47,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:47,728 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:47,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:34:47,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:47,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:47,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:47,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:47,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:47,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:47,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:47,757 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:34:47,772 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:34:47,772 INFO L444 ModelExtractionUtils]: 3 out of 25 variables were initially zero. Simplification set additionally 18 variables to zero. [2022-02-21 03:34:47,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:47,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:47,773 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:47,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:34:47,776 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:34:47,783 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:34:47,783 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:34:47,783 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc206#1.base)_2, ULTIMATE.start_main_~j~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206#1.base)_2 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-02-21 03:34:47,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:47,847 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:34:47,851 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 < main_~length~0#1);" "call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;" "main_#t~post209#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" [2022-02-21 03:34:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:47,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:47,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:34:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:47,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:47,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {177#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {177#unseeded} is VALID [2022-02-21 03:34:47,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem208#1, main_#t~post207#1, main_#t~mem211#1, main_#t~post212#1, main_#t~mem210#1, main_#t~post209#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {177#unseeded} is VALID [2022-02-21 03:34:47,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#unseeded} assume !(main_~length~0#1 < 1); {177#unseeded} is VALID [2022-02-21 03:34:47,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#unseeded} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {206#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:47,914 INFO L290 TraceCheckUtils]: 4: Hoare triple {206#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; {206#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:47,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} assume !(main_~i~0#1 < main_~length~0#1); {206#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:47,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {206#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} main_~j~0#1 := 0; {206#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:47,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:34:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:47,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:47,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#(and (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* (- 4) |ULTIMATE.start_main_~j~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))))} assume !!(main_~j~0#1 < main_~length~0#1); {207#(and (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* (- 4) |ULTIMATE.start_main_~j~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))))} is VALID [2022-02-21 03:34:47,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#(and (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* (- 4) |ULTIMATE.start_main_~j~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))))} call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {236#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* |ULTIMATE.start_main_~j~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} is VALID [2022-02-21 03:34:47,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* |ULTIMATE.start_main_~j~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1; {236#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* |ULTIMATE.start_main_~j~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} is VALID [2022-02-21 03:34:47,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {236#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* |ULTIMATE.start_main_~j~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} main_#t~post209#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; {209#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* (- 4) |ULTIMATE.start_main_~j~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|)))) unseeded) (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:47,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:47,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:47,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:47,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:47,991 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 [2022-02-21 03:34:47,991 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,041 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 25 transitions. Complement of second has 7 states. [2022-02-21 03:34:48,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:34:48,041 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:48,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 6 [2022-02-21 03:34:48,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:48,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:48,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:34:48,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:48,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:48,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2022-02-21 03:34:48,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:48,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:48,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:48,043 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 6 [2022-02-21 03:34:48,043 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:34:48,043 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:34:48,044 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:34:48,044 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:34:48,044 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:48,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:48,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:48,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:48,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:34:48,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:34:48,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:34:48,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:48,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:48,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:48,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:34:48,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:34:48,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:34:48,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:34:48,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:34:48,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:34:48,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:48,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:48,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:48,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:34:48,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:34:48,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:34:48,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:48,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:48,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:48,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:48,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:48,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:48,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:48,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:48,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:48,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:34:48,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:34:48,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:34:48,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:34:48,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:34:48,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:34:48,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:48,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:48,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:48,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,053 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-02-21 03:34:48,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:48,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:34:48,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 8 letters. [2022-02-21 03:34:48,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:48,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:34:48,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:48,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 24 transitions. [2022-02-21 03:34:48,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:34:48,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:34:48,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2022-02-21 03:34:48,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:34:48,057 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-02-21 03:34:48,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2022-02-21 03:34:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-02-21 03:34:48,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:48,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,058 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,058 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,059 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:34:48,060 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2022-02-21 03:34:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-02-21 03:34:48,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:48,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:48,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 24 transitions. [2022-02-21 03:34:48,061 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 24 transitions. [2022-02-21 03:34:48,061 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:34:48,062 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2022-02-21 03:34:48,062 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-02-21 03:34:48,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:48,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:48,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:48,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2022-02-21 03:34:48,063 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-02-21 03:34:48,063 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-02-21 03:34:48,063 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:34:48,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2022-02-21 03:34:48,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:48,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:48,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:48,064 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:48,064 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:48,064 INFO L791 eck$LassoCheckResult]: Stem: 284#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 285#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem208#1, main_#t~post207#1, main_#t~mem211#1, main_#t~post212#1, main_#t~mem210#1, main_#t~post209#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 288#L367 assume !(main_~length~0#1 < 1); 286#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 287#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 274#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 275#L371-4 main_~j~0#1 := 0; 289#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 280#L375-3 [2022-02-21 03:34:48,065 INFO L793 eck$LassoCheckResult]: Loop: 280#L375-3 call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 281#L375-1 assume !!(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post212#1 := main_#t~mem211#1;call write~int(main_#t~post212#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem211#1;havoc main_#t~post212#1; 280#L375-3 [2022-02-21 03:34:48,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:48,065 INFO L85 PathProgramCache]: Analyzing trace with hash 176705843, now seen corresponding path program 1 times [2022-02-21 03:34:48,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:48,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122722089] [2022-02-21 03:34:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:48,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:48,081 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:48,089 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:48,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:48,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 1 times [2022-02-21 03:34:48,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:48,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936692341] [2022-02-21 03:34:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:48,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:48,097 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:48,100 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:48,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:48,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1984375400, now seen corresponding path program 1 times [2022-02-21 03:34:48,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:48,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036143367] [2022-02-21 03:34:48,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:48,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:48,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:34:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:48,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {386#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {386#true} is VALID [2022-02-21 03:34:48,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem208#1, main_#t~post207#1, main_#t~mem211#1, main_#t~post212#1, main_#t~mem210#1, main_#t~post209#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {386#true} is VALID [2022-02-21 03:34:48,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#true} assume !(main_~length~0#1 < 1); {386#true} is VALID [2022-02-21 03:34:48,215 INFO L290 TraceCheckUtils]: 3: Hoare triple {386#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {388#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:48,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {388#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; {389#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:48,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {389#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {389#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:48,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {389#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {390#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:48,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 < main_~length~0#1); {390#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:48,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {391#(and (= |ULTIMATE.start_main_#t~mem210#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:48,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(and (= |ULTIMATE.start_main_#t~mem210#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post212#1 := main_#t~mem211#1;call write~int(main_#t~post212#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem211#1;havoc main_#t~post212#1; {387#false} is VALID [2022-02-21 03:34:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:48,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:48,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036143367] [2022-02-21 03:34:48,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036143367] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:34:48,221 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:34:48,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:34:48,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52055229] [2022-02-21 03:34:48,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:34:48,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:48,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:34:48,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:34:48,257 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:48,337 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-21 03:34:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:34:48,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:48,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2022-02-21 03:34:48,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:48,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2022-02-21 03:34:48,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:34:48,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:34:48,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2022-02-21 03:34:48,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:34:48,348 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-21 03:34:48,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2022-02-21 03:34:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2022-02-21 03:34:48,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:48,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 32 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,350 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 32 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,350 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,350 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:34:48,351 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-21 03:34:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-21 03:34:48,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:48,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:48,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states and 32 transitions. [2022-02-21 03:34:48,352 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states and 32 transitions. [2022-02-21 03:34:48,352 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:34:48,353 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-21 03:34:48,354 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-21 03:34:48,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:48,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:48,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:48,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-02-21 03:34:48,355 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-02-21 03:34:48,355 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-02-21 03:34:48,355 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:34:48,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2022-02-21 03:34:48,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:48,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:48,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:48,356 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:48,356 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:48,356 INFO L791 eck$LassoCheckResult]: Stem: 427#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 428#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem208#1, main_#t~post207#1, main_#t~mem211#1, main_#t~post212#1, main_#t~mem210#1, main_#t~post209#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 435#L367 assume !(main_~length~0#1 < 1); 429#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 430#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 421#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 422#L371-4 main_~j~0#1 := 0; 437#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 438#L375-3 call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 436#L375-1 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1; 425#L374-2 main_#t~post209#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 426#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 431#L375-3 [2022-02-21 03:34:48,356 INFO L793 eck$LassoCheckResult]: Loop: 431#L375-3 call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 432#L375-1 assume !!(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post212#1 := main_#t~mem211#1;call write~int(main_#t~post212#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem211#1;havoc main_#t~post212#1; 431#L375-3 [2022-02-21 03:34:48,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:48,357 INFO L85 PathProgramCache]: Analyzing trace with hash -19280312, now seen corresponding path program 2 times [2022-02-21 03:34:48,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:48,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59842093] [2022-02-21 03:34:48,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:48,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:48,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {561#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {561#true} is VALID [2022-02-21 03:34:48,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {561#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem208#1, main_#t~post207#1, main_#t~mem211#1, main_#t~post212#1, main_#t~mem210#1, main_#t~post209#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {561#true} is VALID [2022-02-21 03:34:48,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {561#true} assume !(main_~length~0#1 < 1); {561#true} is VALID [2022-02-21 03:34:48,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {561#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {561#true} is VALID [2022-02-21 03:34:48,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {561#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; {563#(= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:34:48,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#(= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))} assume !(main_~i~0#1 < main_~length~0#1); {564#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:48,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {564#(<= |ULTIMATE.start_main_~length~0#1| 1)} main_~j~0#1 := 0; {565#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:48,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {565#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 < main_~length~0#1); {565#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:48,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {565#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {565#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:48,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1; {565#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:48,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {565#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post209#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; {566#(<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:34:48,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {566#(<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < main_~length~0#1); {562#false} is VALID [2022-02-21 03:34:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:48,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:48,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59842093] [2022-02-21 03:34:48,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59842093] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:34:48,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793798881] [2022-02-21 03:34:48,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:34:48,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:48,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:48,399 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:34:48,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-02-21 03:34:48,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:34:48,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:34:48,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:34:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:48,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:48,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {561#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {561#true} is VALID [2022-02-21 03:34:48,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {561#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem208#1, main_#t~post207#1, main_#t~mem211#1, main_#t~post212#1, main_#t~mem210#1, main_#t~post209#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {561#true} is VALID [2022-02-21 03:34:48,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {561#true} assume !(main_~length~0#1 < 1); {561#true} is VALID [2022-02-21 03:34:48,522 INFO L290 TraceCheckUtils]: 3: Hoare triple {561#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {561#true} is VALID [2022-02-21 03:34:48,522 INFO L290 TraceCheckUtils]: 4: Hoare triple {561#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; {582#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:48,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {582#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~length~0#1); {564#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:48,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {564#(<= |ULTIMATE.start_main_~length~0#1| 1)} main_~j~0#1 := 0; {589#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:34:48,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 < main_~length~0#1); {589#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:34:48,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {589#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:34:48,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {589#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1; {589#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:34:48,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {589#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} main_#t~post209#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; {602#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:34:48,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {602#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 < main_~length~0#1); {562#false} is VALID [2022-02-21 03:34:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:48,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:34:48,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793798881] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:34:48,533 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:34:48,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-02-21 03:34:48,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464653595] [2022-02-21 03:34:48,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:34:48,533 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:34:48,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 2 times [2022-02-21 03:34:48,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:48,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492796796] [2022-02-21 03:34:48,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:48,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:48,546 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:48,557 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:48,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:48,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:34:48,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:34:48,586 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:48,702 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-21 03:34:48,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:34:48,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:48,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2022-02-21 03:34:48,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:48,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 19 states and 22 transitions. [2022-02-21 03:34:48,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:34:48,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:34:48,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2022-02-21 03:34:48,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:34:48,723 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-02-21 03:34:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2022-02-21 03:34:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-02-21 03:34:48,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:48,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 22 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,724 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 22 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,725 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,725 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:34:48,725 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-21 03:34:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-21 03:34:48,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:48,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:48,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 22 transitions. [2022-02-21 03:34:48,726 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 22 transitions. [2022-02-21 03:34:48,726 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:34:48,727 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-21 03:34:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-21 03:34:48,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:48,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:48,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:48,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-21 03:34:48,728 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-21 03:34:48,728 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-21 03:34:48,728 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:34:48,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:34:48,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:48,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:48,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:48,728 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:48,728 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:48,728 INFO L791 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 660#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem208#1, main_#t~post207#1, main_#t~mem211#1, main_#t~post212#1, main_#t~mem210#1, main_#t~post209#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 661#L367 assume !(main_~length~0#1 < 1); 653#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 654#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 649#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem208#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int(1 + main_#t~mem208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem208#1; 650#L371-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 651#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 652#L371-4 main_~j~0#1 := 0; 662#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 657#L375-3 call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 658#L375-1 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1; 647#L374-2 main_#t~post209#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 648#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 655#L375-3 [2022-02-21 03:34:48,730 INFO L793 eck$LassoCheckResult]: Loop: 655#L375-3 call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 656#L375-1 assume !!(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post212#1 := main_#t~mem211#1;call write~int(main_#t~post212#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem211#1;havoc main_#t~post212#1; 655#L375-3 [2022-02-21 03:34:48,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:48,730 INFO L85 PathProgramCache]: Analyzing trace with hash -744742010, now seen corresponding path program 1 times [2022-02-21 03:34:48,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:48,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973309332] [2022-02-21 03:34:48,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:48,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:48,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:48,763 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:48,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:48,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 3 times [2022-02-21 03:34:48,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:48,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104784776] [2022-02-21 03:34:48,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:48,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:48,781 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:48,783 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:48,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:48,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1562468139, now seen corresponding path program 1 times [2022-02-21 03:34:48,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:48,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179691706] [2022-02-21 03:34:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:48,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:48,817 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:49,071 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:49,071 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:49,071 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:49,071 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:49,071 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:49,071 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:49,071 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:49,071 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:49,071 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration5_Lasso [2022-02-21 03:34:49,071 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:49,072 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:49,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:49,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:49,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:49,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:49,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:49,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:49,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:49,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:49,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:49,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:49,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:49,488 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:34:49,489 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:34:49,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:49,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:49,490 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:49,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:34:49,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:49,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:49,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:49,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:49,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:49,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:49,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:49,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:49,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:49,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:34:49,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:49,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:49,517 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:49,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:34:49,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:49,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:49,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:49,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:49,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:49,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:49,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:49,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:49,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:49,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:49,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:49,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:49,547 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:49,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:34:49,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:49,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:49,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:49,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:49,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:49,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:49,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:49,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:49,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:49,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:49,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:49,598 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:49,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:34:49,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:49,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:49,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:49,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:49,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:49,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:49,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:49,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:34:49,629 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:34:49,629 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 03:34:49,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:49,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:49,631 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:49,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:34:49,663 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:34:49,670 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:34:49,670 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:34:49,670 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset (* ULTIMATE.start_main_~j~0#1 4)))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset (* ULTIMATE.start_main_~j~0#1 4)))_2 Supporting invariants [] [2022-02-21 03:34:49,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:34:49,707 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 03:34:49,718 INFO L390 LassoCheck]: Loop: "call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !!(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post212#1 := main_#t~mem211#1;call write~int(main_#t~post212#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem211#1;havoc main_#t~post212#1;" [2022-02-21 03:34:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:34:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:49,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {779#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {779#unseeded} is VALID [2022-02-21 03:34:49,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {779#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem208#1, main_#t~post207#1, main_#t~mem211#1, main_#t~post212#1, main_#t~mem210#1, main_#t~post209#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {779#unseeded} is VALID [2022-02-21 03:34:49,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {779#unseeded} assume !(main_~length~0#1 < 1); {779#unseeded} is VALID [2022-02-21 03:34:49,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {779#unseeded} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {779#unseeded} is VALID [2022-02-21 03:34:49,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {779#unseeded} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; {779#unseeded} is VALID [2022-02-21 03:34:49,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {779#unseeded} assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem208#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int(1 + main_#t~mem208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem208#1; {779#unseeded} is VALID [2022-02-21 03:34:49,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {779#unseeded} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {779#unseeded} is VALID [2022-02-21 03:34:49,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {779#unseeded} assume !(main_~i~0#1 < main_~length~0#1); {779#unseeded} is VALID [2022-02-21 03:34:49,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {779#unseeded} main_~j~0#1 := 0; {779#unseeded} is VALID [2022-02-21 03:34:49,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {779#unseeded} assume !!(main_~j~0#1 < main_~length~0#1); {779#unseeded} is VALID [2022-02-21 03:34:49,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {779#unseeded} call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {779#unseeded} is VALID [2022-02-21 03:34:49,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {779#unseeded} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1; {779#unseeded} is VALID [2022-02-21 03:34:49,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {779#unseeded} main_#t~post209#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; {779#unseeded} is VALID [2022-02-21 03:34:49,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {779#unseeded} assume !!(main_~j~0#1 < main_~length~0#1); {779#unseeded} is VALID [2022-02-21 03:34:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:34:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:49,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {782#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {866#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= |ULTIMATE.start_main_#t~mem210#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} is VALID [2022-02-21 03:34:49,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= |ULTIMATE.start_main_#t~mem210#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} assume !!(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post212#1 := main_#t~mem211#1;call write~int(main_#t~post212#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem211#1;havoc main_#t~post212#1; {822#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))))} is VALID [2022-02-21 03:34:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:49,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:49,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:49,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,829 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:34:49,829 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:49,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:49,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 24 transitions. Complement of second has 7 states. [2022-02-21 03:34:49,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:34:49,874 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:49,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2022-02-21 03:34:49,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:49,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:49,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:49,874 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:34:49,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:34:49,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2022-02-21 03:34:49,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:49,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:49,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:49,875 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2022-02-21 03:34:49,875 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:49,875 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:49,876 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:34:49,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 12 transitions. cyclomatic complexity: 9 [2022-02-21 03:34:49,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:34:49,876 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:34:49,876 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 24 transitions. cyclomatic complexity: 6 [2022-02-21 03:34:49,876 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:49,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:34:49,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:34:49,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:34:49,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:49,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:49,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:34:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:34:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:34:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:49,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:49,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:49,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,879 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 03:34:49,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,880 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:34:49,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:34:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:49,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {779#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {779#unseeded} is VALID [2022-02-21 03:34:49,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {779#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem208#1, main_#t~post207#1, main_#t~mem211#1, main_#t~post212#1, main_#t~mem210#1, main_#t~post209#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {779#unseeded} is VALID [2022-02-21 03:34:49,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {779#unseeded} assume !(main_~length~0#1 < 1); {779#unseeded} is VALID [2022-02-21 03:34:49,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {779#unseeded} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {779#unseeded} is VALID [2022-02-21 03:34:49,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {779#unseeded} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; {779#unseeded} is VALID [2022-02-21 03:34:49,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {779#unseeded} assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem208#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int(1 + main_#t~mem208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem208#1; {779#unseeded} is VALID [2022-02-21 03:34:49,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {779#unseeded} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {779#unseeded} is VALID [2022-02-21 03:34:49,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {779#unseeded} assume !(main_~i~0#1 < main_~length~0#1); {779#unseeded} is VALID [2022-02-21 03:34:49,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {779#unseeded} main_~j~0#1 := 0; {779#unseeded} is VALID [2022-02-21 03:34:49,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {779#unseeded} assume !!(main_~j~0#1 < main_~length~0#1); {779#unseeded} is VALID [2022-02-21 03:34:49,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {779#unseeded} call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {779#unseeded} is VALID [2022-02-21 03:34:49,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {779#unseeded} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1; {779#unseeded} is VALID [2022-02-21 03:34:49,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {779#unseeded} main_#t~post209#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; {779#unseeded} is VALID [2022-02-21 03:34:49,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {779#unseeded} assume !!(main_~j~0#1 < main_~length~0#1); {779#unseeded} is VALID [2022-02-21 03:34:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:34:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:49,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {782#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {944#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= |ULTIMATE.start_main_#t~mem210#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} is VALID [2022-02-21 03:34:49,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {944#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= |ULTIMATE.start_main_#t~mem210#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} assume !!(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post212#1 := main_#t~mem211#1;call write~int(main_#t~post212#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem211#1;havoc main_#t~post212#1; {822#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))))} is VALID [2022-02-21 03:34:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:49,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:49,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:49,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:49,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:49,979 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:34:49,979 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:49,994 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 24 transitions. Complement of second has 7 states. [2022-02-21 03:34:49,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:34:49,995 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:49,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2022-02-21 03:34:49,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:49,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:49,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:49,997 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:34:49,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:34:49,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2022-02-21 03:34:49,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:49,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:49,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:50,001 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2022-02-21 03:34:50,002 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:50,002 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:50,002 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:34:50,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 12 transitions. cyclomatic complexity: 9 [2022-02-21 03:34:50,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:34:50,003 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:34:50,003 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 24 transitions. cyclomatic complexity: 6 [2022-02-21 03:34:50,003 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:50,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:34:50,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:34:50,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:34:50,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:50,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:50,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:50,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:34:50,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:34:50,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:34:50,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:50,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:50,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:50,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:50,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:50,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:50,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,012 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 03:34:50,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,013 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:34:50,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:50,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:34:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:50,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:50,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {779#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {779#unseeded} is VALID [2022-02-21 03:34:50,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {779#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem208#1, main_#t~post207#1, main_#t~mem211#1, main_#t~post212#1, main_#t~mem210#1, main_#t~post209#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {779#unseeded} is VALID [2022-02-21 03:34:50,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {779#unseeded} assume !(main_~length~0#1 < 1); {779#unseeded} is VALID [2022-02-21 03:34:50,065 INFO L290 TraceCheckUtils]: 3: Hoare triple {779#unseeded} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {779#unseeded} is VALID [2022-02-21 03:34:50,065 INFO L290 TraceCheckUtils]: 4: Hoare triple {779#unseeded} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; {779#unseeded} is VALID [2022-02-21 03:34:50,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {779#unseeded} assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem208#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int(1 + main_#t~mem208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem208#1; {779#unseeded} is VALID [2022-02-21 03:34:50,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {779#unseeded} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {779#unseeded} is VALID [2022-02-21 03:34:50,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {779#unseeded} assume !(main_~i~0#1 < main_~length~0#1); {779#unseeded} is VALID [2022-02-21 03:34:50,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {779#unseeded} main_~j~0#1 := 0; {779#unseeded} is VALID [2022-02-21 03:34:50,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {779#unseeded} assume !!(main_~j~0#1 < main_~length~0#1); {779#unseeded} is VALID [2022-02-21 03:34:50,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {779#unseeded} call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {779#unseeded} is VALID [2022-02-21 03:34:50,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {779#unseeded} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1; {779#unseeded} is VALID [2022-02-21 03:34:50,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {779#unseeded} main_#t~post209#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; {779#unseeded} is VALID [2022-02-21 03:34:50,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {779#unseeded} assume !!(main_~j~0#1 < main_~length~0#1); {779#unseeded} is VALID [2022-02-21 03:34:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:50,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:34:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:50,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:50,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {782#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1022#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= |ULTIMATE.start_main_#t~mem210#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} is VALID [2022-02-21 03:34:50,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {1022#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= |ULTIMATE.start_main_#t~mem210#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} assume !!(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post212#1 := main_#t~mem211#1;call write~int(main_#t~post212#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem211#1;havoc main_#t~post212#1; {822#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))))} is VALID [2022-02-21 03:34:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:50,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:50,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:50,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,104 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:34:50,104 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:50,131 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 28 transitions. Complement of second has 6 states. [2022-02-21 03:34:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:34:50,132 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:50,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2022-02-21 03:34:50,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:50,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:50,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:50,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:50,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:50,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:50,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2022-02-21 03:34:50,132 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:34:50,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:34:50,133 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2022-02-21 03:34:50,133 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:50,133 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:50,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:50,133 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:34:50,133 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 28 transitions. cyclomatic complexity: 8 [2022-02-21 03:34:50,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. cyclomatic complexity: 8 [2022-02-21 03:34:50,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:34:50,133 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:34:50,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:50,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:50,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:50,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:34:50,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:34:50,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:34:50,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:50,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:50,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:50,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:34:50,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:34:50,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:34:50,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:50,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:50,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:50,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:50,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:50,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:50,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,137 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:34:50,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:50,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:34:50,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:34:50,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:50,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. cyclomatic complexity: 8 [2022-02-21 03:34:50,139 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:34:50,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2022-02-21 03:34:50,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:34:50,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:34:50,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:34:50,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:50,139 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:34:50,139 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:34:50,139 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:34:50,139 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:34:50,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:34:50,139 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:34:50,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:34:50,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:34:50 BoogieIcfgContainer [2022-02-21 03:34:50,144 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:34:50,145 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:34:50,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:34:50,145 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:34:50,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:44" (3/4) ... [2022-02-21 03:34:50,147 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:34:50,147 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:34:50,148 INFO L158 Benchmark]: Toolchain (without parser) took 6312.19ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 61.5MB in the beginning and 76.2MB in the end (delta: -14.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-02-21 03:34:50,148 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory was 49.4MB in the beginning and 49.3MB in the end (delta: 45.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:34:50,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.08ms. Allocated memory is still 94.4MB. Free memory was 61.4MB in the beginning and 61.2MB in the end (delta: 180.1kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:34:50,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.60ms. Allocated memory is still 94.4MB. Free memory was 61.2MB in the beginning and 59.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:34:50,148 INFO L158 Benchmark]: Boogie Preprocessor took 37.34ms. Allocated memory is still 94.4MB. Free memory was 59.2MB in the beginning and 57.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:34:50,149 INFO L158 Benchmark]: RCFGBuilder took 332.03ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 57.8MB in the beginning and 92.5MB in the end (delta: -34.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-02-21 03:34:50,149 INFO L158 Benchmark]: BuchiAutomizer took 5575.56ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 92.1MB in the beginning and 76.2MB in the end (delta: 15.9MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2022-02-21 03:34:50,149 INFO L158 Benchmark]: Witness Printer took 2.42ms. Allocated memory is still 142.6MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:34:50,150 INFO L339 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.18ms. Allocated memory is still 94.4MB. Free memory was 49.4MB in the beginning and 49.3MB in the end (delta: 45.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.08ms. Allocated memory is still 94.4MB. Free memory was 61.4MB in the beginning and 61.2MB in the end (delta: 180.1kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.60ms. Allocated memory is still 94.4MB. Free memory was 61.2MB in the beginning and 59.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.34ms. Allocated memory is still 94.4MB. Free memory was 59.2MB in the beginning and 57.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 332.03ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 57.8MB in the beginning and 92.5MB in the end (delta: -34.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 5575.56ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 92.1MB in the beginning and 76.2MB in the end (delta: 15.9MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * Witness Printer took 2.42ms. Allocated memory is still 142.6MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -4 * j + -1 * arr and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr + j * 4] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 76 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital126 mio100 ax100 hnf100 lsp95 ukn84 mio100 lsp55 div100 bol100 ite100 ukn100 eq161 hnf92 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:34:50,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:50,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE