./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array06_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 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/array06_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0813819187e9a2abc800e062dc2a3ce48468372a35f94a85a0472def328bf451 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:34:10,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:34:10,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:34:10,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:34:10,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:34:10,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:34:10,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:34:10,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:34:10,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:34:10,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:34:10,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:34:10,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:34:10,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:34:10,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:34:10,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:34:10,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:34:10,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:34:10,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:34:10,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:34:10,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:34:10,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:34:10,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:34:10,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:34:10,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:34:10,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:34:10,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:34:10,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:34:10,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:34:10,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:34:10,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:34:10,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:34:10,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:34:10,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:34:10,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:34:10,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:34:10,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:34:10,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:34:10,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:34:10,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:34:10,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:34:10,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:34:10,598 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:10,620 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:34:10,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:34:10,620 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:34:10,621 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:34:10,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:34:10,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:34:10,622 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:34:10,622 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:34:10,622 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:34:10,622 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:34:10,622 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:34:10,622 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:34:10,623 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:34:10,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:34:10,623 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:34:10,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:34:10,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:34:10,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:34:10,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:34:10,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:34:10,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:34:10,624 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:34:10,624 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:34:10,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:34:10,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:34:10,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:34:10,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:34:10,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:34:10,626 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:34:10,626 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 -> 0813819187e9a2abc800e062dc2a3ce48468372a35f94a85a0472def328bf451 [2022-02-21 03:34:10,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:34:10,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:34:10,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:34:10,853 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:34:10,854 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:34:10,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array06_alloca.i [2022-02-21 03:34:10,898 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2068d73ca/a87490b4dd4649028fd968e6b76ba47e/FLAG862f8157d [2022-02-21 03:34:11,305 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:34:11,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array06_alloca.i [2022-02-21 03:34:11,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2068d73ca/a87490b4dd4649028fd968e6b76ba47e/FLAG862f8157d [2022-02-21 03:34:11,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2068d73ca/a87490b4dd4649028fd968e6b76ba47e [2022-02-21 03:34:11,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:34:11,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:34:11,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:11,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:34:11,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:34:11,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:11" (1/1) ... [2022-02-21 03:34:11,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d60306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:11, skipping insertion in model container [2022-02-21 03:34:11,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:11" (1/1) ... [2022-02-21 03:34:11,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:34:11,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:34:11,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:11,586 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:34:11,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:11,664 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:34:11,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:11 WrapperNode [2022-02-21 03:34:11,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:11,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:11,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:34:11,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:34:11,675 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:11" (1/1) ... [2022-02-21 03:34:11,693 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:11" (1/1) ... [2022-02-21 03:34:11,719 INFO L137 Inliner]: procedures = 151, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2022-02-21 03:34:11,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:11,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:34:11,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:34:11,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:34:11,726 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:11" (1/1) ... [2022-02-21 03:34:11,726 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:11" (1/1) ... [2022-02-21 03:34:11,732 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:11" (1/1) ... [2022-02-21 03:34:11,732 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:11" (1/1) ... [2022-02-21 03:34:11,735 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:11" (1/1) ... [2022-02-21 03:34:11,744 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:11" (1/1) ... [2022-02-21 03:34:11,747 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:11" (1/1) ... [2022-02-21 03:34:11,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:34:11,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:34:11,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:34:11,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:34:11,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:11" (1/1) ... [2022-02-21 03:34:11,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:11,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:11,771 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:11,773 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:11,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:34:11,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:34:11,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:34:11,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:34:11,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:34:11,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:34:11,843 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:34:11,844 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:34:12,005 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:34:12,009 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:34:12,009 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:34:12,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:12 BoogieIcfgContainer [2022-02-21 03:34:12,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:34:12,011 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:34:12,011 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:34:12,017 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:34:12,018 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:12,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:34:11" (1/3) ... [2022-02-21 03:34:12,019 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7118fa98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:12, skipping insertion in model container [2022-02-21 03:34:12,019 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:12,019 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:11" (2/3) ... [2022-02-21 03:34:12,020 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7118fa98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:12, skipping insertion in model container [2022-02-21 03:34:12,020 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:12,020 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:12" (3/3) ... [2022-02-21 03:34:12,021 INFO L388 chiAutomizerObserver]: Analyzing ICFG array06_alloca.i [2022-02-21 03:34:12,075 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:34:12,076 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:34:12,076 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:34:12,076 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:34:12,076 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:34:12,076 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:34:12,076 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:34:12,076 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:34:12,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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:12,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:12,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:12,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:12,132 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:12,133 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:12,133 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:34:12,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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:12,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:12,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:12,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:12,141 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:12,141 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:12,147 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#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~nondet208#1, main_#t~post207#1, main_#t~mem209#1, main_#t~post210#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; 12#L367true assume !(main_~length~0#1 < 1); 9#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; 6#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 7#L370-3true [2022-02-21 03:34:12,147 INFO L793 eck$LassoCheckResult]: Loop: 7#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1; 13#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 7#L370-3true [2022-02-21 03:34:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-02-21 03:34:12,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:12,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026816359] [2022-02-21 03:34:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:12,263 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:12,300 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:12,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2022-02-21 03:34:12,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:12,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845609891] [2022-02-21 03:34:12,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:12,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:12,322 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:12,341 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:12,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:12,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2022-02-21 03:34:12,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:12,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241008764] [2022-02-21 03:34:12,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:12,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:12,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:12,383 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:12,620 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:12,620 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:12,620 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:12,621 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:12,621 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:12,621 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:12,621 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:12,621 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:12,621 INFO L133 ssoRankerPreferences]: Filename of dumped script: array06_alloca.i_Iteration1_Lasso [2022-02-21 03:34:12,622 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:12,622 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:12,636 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:12,641 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:12,644 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:12,647 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:12,649 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:12,651 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:12,653 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:12,657 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:12,659 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:13,011 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:34:13,014 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:34:13,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:13,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:13,017 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:13,022 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:13,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:13,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:13,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:13,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:13,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:13,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:13,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:13,034 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:13,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:13,107 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:13,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:13,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:13,110 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:13,111 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:13,112 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:13,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:13,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:13,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:13,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:13,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:13,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:13,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:13,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:34:13,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:13,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:13,157 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:13,157 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:13,158 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:13,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:13,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:13,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:13,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:13,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:13,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:13,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:13,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:13,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:34:13,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:13,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:13,188 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:13,190 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:13,191 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:13,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:13,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:13,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:13,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:13,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:13,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:13,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:13,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:13,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:34:13,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:13,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:13,224 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:13,234 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:13,240 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:13,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:13,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:13,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:13,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:13,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:13,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:13,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:13,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:13,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:13,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:13,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:13,262 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:13,264 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:13,264 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:13,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:13,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:13,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:13,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:13,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:13,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:13,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:13,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:13,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:13,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:13,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:13,303 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:13,308 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:13,308 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:13,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:13,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:13,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:13,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:13,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:13,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:13,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:13,347 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:13,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:13,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:13,351 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:13,362 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:13,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:13,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:13,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:13,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:13,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:13,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:13,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:13,374 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:13,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:13,404 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:13,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:13,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:13,405 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:13,406 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:13,408 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:13,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:13,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:13,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:13,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:13,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:13,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:13,436 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:34:13,452 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 03:34:13,452 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:34:13,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:13,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:13,454 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:13,455 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:13,457 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:34:13,508 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:34:13,508 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:34:13,508 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~arr~0#1.offset) = 2*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~arr~0#1.offset Supporting invariants [] [2022-02-21 03:34:13,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:34:13,563 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:34:13,568 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#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:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:13,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:13,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:34:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:13,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:13,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {23#unseeded} is VALID [2022-02-21 03:34:13,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#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~nondet208#1, main_#t~post207#1, main_#t~mem209#1, main_#t~post210#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; {23#unseeded} is VALID [2022-02-21 03:34:13,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#unseeded} assume !(main_~length~0#1 < 1); {23#unseeded} is VALID [2022-02-21 03:34:13,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {23#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; {23#unseeded} is VALID [2022-02-21 03:34:13,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {23#unseeded} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {23#unseeded} is VALID [2022-02-21 03:34:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:13,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:34:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:13,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:13,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(>= oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* (- 4) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1; {68#(and (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (>= oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~i~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= 0 (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} is VALID [2022-02-21 03:34:13,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {68#(and (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (>= oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~i~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= 0 (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {51#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* (- 4) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|)))))} is VALID [2022-02-21 03:34:13,697 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:13,719 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:13,726 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:13,728 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:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,732 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:13,733 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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:13,796 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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 30 states and 40 transitions. Complement of second has 7 states. [2022-02-21 03:34:13,796 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:13,796 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:13,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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:13,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:13,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:13,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:13,798 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:13,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:13,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:13,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:13,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:34:13,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:13,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:13,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:13,803 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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:13,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:13,804 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:34:13,804 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:13,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:13,806 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:13,806 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 40 transitions. cyclomatic complexity: 14 [2022-02-21 03:34:13,806 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:34:13,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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:13,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,806 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:13,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:34:13,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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:13,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,807 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:13,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:13,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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 1 letters. [2022-02-21 03:34:13,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,807 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 1 letters. [2022-02-21 03:34:13,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:34:13,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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 30 letters. Loop has 30 letters. [2022-02-21 03:34:13,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,808 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 30 letters. Loop has 30 letters. [2022-02-21 03:34:13,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 14 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:34:13,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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:13,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,808 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 13 letters. Loop has 13 letters. [2022-02-21 03:34:13,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:34:13,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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:13,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,809 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:13,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:13,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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 1 letters. [2022-02-21 03:34:13,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,809 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 1 letters. [2022-02-21 03:34:13,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:34:13,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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:13,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,810 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:13,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:34:13,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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:13,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,810 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:13,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:34:13,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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:13,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,811 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:13,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:13,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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:13,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,815 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:13,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:13,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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 1 letters. [2022-02-21 03:34:13,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,824 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 1 letters. [2022-02-21 03:34:13,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:34:13,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,825 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:13,828 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:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-21 03:34:13,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:34:13,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:13,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:34:13,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:13,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. cyclomatic complexity: 14 [2022-02-21 03:34:13,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:13,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2022-02-21 03:34:13,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:34:13,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:34:13,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2022-02-21 03:34:13,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:13,850 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:34:13,854 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:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2022-02-21 03:34:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-21 03:34:13,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:13,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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:13,868 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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:13,870 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:13,876 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 03:34:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:34:13,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:13,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:13,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 10 states and 13 transitions. [2022-02-21 03:34:13,879 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 10 states and 13 transitions. [2022-02-21 03:34:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:13,880 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 03:34:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:34:13,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:13,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:13,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:13,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-02-21 03:34:13,884 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:34:13,884 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:34:13,884 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:34:13,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:34:13,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:13,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:13,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:13,885 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:13,885 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:34:13,886 INFO L791 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 114#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~nondet208#1, main_#t~post207#1, main_#t~mem209#1, main_#t~post210#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; 119#L367 assume !(main_~length~0#1 < 1); 115#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; 116#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 117#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 118#L370-4 main_~j~0#1 := 0; 112#L374-2 [2022-02-21 03:34:13,886 INFO L793 eck$LassoCheckResult]: Loop: 112#L374-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_#t~post210#1 := main_#t~mem209#1;call write~int(1 + main_#t~post210#1, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~j~0#1 := main_~j~0#1 + main_#t~post210#1;havoc main_#t~mem209#1;havoc main_#t~post210#1; 112#L374-2 [2022-02-21 03:34:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2022-02-21 03:34:13,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:13,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673277495] [2022-02-21 03:34:13,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:13,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:13,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {145#true} is VALID [2022-02-21 03:34:13,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#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~nondet208#1, main_#t~post207#1, main_#t~mem209#1, main_#t~post210#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; {145#true} is VALID [2022-02-21 03:34:13,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {145#true} assume !(main_~length~0#1 < 1); {147#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:13,951 INFO L290 TraceCheckUtils]: 3: Hoare triple {147#(<= 1 |ULTIMATE.start_main_~length~0#1|)} 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; {147#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:13,952 INFO L290 TraceCheckUtils]: 4: Hoare triple {147#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {148#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:34:13,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !(main_~i~0#1 < main_~length~0#1); {146#false} is VALID [2022-02-21 03:34:13,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#false} main_~j~0#1 := 0; {146#false} is VALID [2022-02-21 03:34:13,954 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:13,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:13,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673277495] [2022-02-21 03:34:13,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673277495] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:34:13,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:34:13,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:34:13,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344322003] [2022-02-21 03:34:13,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:34:13,956 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:34:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:13,957 INFO L85 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2022-02-21 03:34:13,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:13,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304117704] [2022-02-21 03:34:13,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:13,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:13,967 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:13,971 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:14,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:14,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:34:14,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:34:14,019 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:14,047 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 03:34:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:34:14,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:14,053 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:14,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2022-02-21 03:34:14,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:14,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2022-02-21 03:34:14,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:34:14,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:34:14,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2022-02-21 03:34:14,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:14,054 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-02-21 03:34:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2022-02-21 03:34:14,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-02-21 03:34:14,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:14,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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:14,055 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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:14,055 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:14,056 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 03:34:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-02-21 03:34:14,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:14,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:14,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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) Second operand 11 states and 13 transitions. [2022-02-21 03:34:14,056 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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) Second operand 11 states and 13 transitions. [2022-02-21 03:34:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:14,057 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 03:34:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-02-21 03:34:14,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:14,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:14,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:14,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2022-02-21 03:34:14,058 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 03:34:14,058 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 03:34:14,058 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:34:14,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2022-02-21 03:34:14,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:14,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:14,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:14,058 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:14,058 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:34:14,059 INFO L791 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 164#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~nondet208#1, main_#t~post207#1, main_#t~mem209#1, main_#t~post210#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; 169#L367 assume !(main_~length~0#1 < 1); 165#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; 166#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 167#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1; 170#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 171#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 168#L370-4 main_~j~0#1 := 0; 162#L374-2 [2022-02-21 03:34:14,059 INFO L793 eck$LassoCheckResult]: Loop: 162#L374-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_#t~post210#1 := main_#t~mem209#1;call write~int(1 + main_#t~post210#1, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~j~0#1 := main_~j~0#1 + main_#t~post210#1;havoc main_#t~mem209#1;havoc main_#t~post210#1; 162#L374-2 [2022-02-21 03:34:14,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:14,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2022-02-21 03:34:14,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:14,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182122660] [2022-02-21 03:34:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:14,090 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:14,098 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2022-02-21 03:34:14,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:14,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227615812] [2022-02-21 03:34:14,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:14,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:14,108 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:14,116 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:14,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:14,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2022-02-21 03:34:14,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:14,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484654644] [2022-02-21 03:34:14,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:14,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:14,138 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:14,158 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:14,377 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:14,378 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:14,378 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:14,378 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:14,378 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:14,378 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:14,378 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:14,378 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:14,378 INFO L133 ssoRankerPreferences]: Filename of dumped script: array06_alloca.i_Iteration3_Lasso [2022-02-21 03:34:14,378 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:14,378 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:14,382 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:14,384 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:14,387 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:14,389 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:14,391 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:14,572 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:34:14,573 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:34:14,578 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:14,579 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:14,581 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:14,583 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:14,836 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:34:14,836 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:34:14,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:14,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:14,837 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:14,838 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:14,840 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:14,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:14,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:14,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:14,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:14,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:14,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:14,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:14,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:14,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:34:14,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:14,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:14,878 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:14,880 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:14,883 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:14,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:14,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:14,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:14,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:14,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:14,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:14,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:14,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:14,935 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:14,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:14,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:14,936 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:14,939 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:14,941 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:14,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:14,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:14,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:14,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:14,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:14,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:14,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:14,974 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:14,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:14,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:14,975 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:14,976 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:14,978 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:14,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:14,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:14,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:14,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:14,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:14,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:14,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:14,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:34:15,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,016 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:15,016 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:15,018 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:15,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:15,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:15,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:15,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:34:15,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,059 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:15,061 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:15,062 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:15,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:15,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:15,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:15,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:34:15,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,112 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:15,113 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:15,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:15,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:15,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:15,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:15,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,173 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:15,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,174 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:15,176 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:15,177 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:15,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:15,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:15,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:15,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,215 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:15,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,217 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:15,224 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:15,224 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:15,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:15,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:15,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:15,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:15,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 03:34:15,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,262 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:15,262 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:15,264 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:15,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:15,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:15,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:15,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:15,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 03:34:15,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,292 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:15,293 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:15,294 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:15,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:15,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:15,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:15,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:15,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:34:15,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,321 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:15,321 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:15,323 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:15,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:15,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:15,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:15,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:15,359 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-02-21 03:34:15,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,360 INFO L229 MonitoredProcess]: Starting monitored process 24 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:15,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:34:15,362 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:15,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:15,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,369 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:15,370 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 03:34:15,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:15,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:34:15,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,392 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:15,392 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:15,393 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:15,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:15,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,400 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:15,400 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 03:34:15,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:15,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,426 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:15,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,427 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:15,430 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:15,430 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:15,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,437 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:15,438 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 03:34:15,439 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 03:34:15,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,467 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:15,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,484 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:15,485 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:15,486 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:15,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:15,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,493 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:15,494 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 03:34:15,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:15,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:34:15,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,525 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:15,525 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:15,527 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:15,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,534 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:15,537 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 03:34:15,537 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 03:34:15,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:15,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,572 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:15,574 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:15,575 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:15,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,581 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:15,584 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 03:34:15,584 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 03:34:15,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:15,617 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:15,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,619 INFO L229 MonitoredProcess]: Starting monitored process 30 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:15,630 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:15,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:15,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:15,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:15,637 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:15,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:34:15,648 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 03:34:15,648 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 03:34:15,664 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:34:15,740 INFO L443 ModelExtractionUtils]: Simplification made 34 calls to the SMT solver. [2022-02-21 03:34:15,741 INFO L444 ModelExtractionUtils]: 13 out of 51 variables were initially zero. Simplification set additionally 33 variables to zero. [2022-02-21 03:34:15,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:15,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:15,742 INFO L229 MonitoredProcess]: Starting monitored process 31 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:15,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:34:15,744 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:34:15,765 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2022-02-21 03:34:15,766 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:34:15,766 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~i~0#1 4) ULTIMATE.start_main_~arr~0#1.offset (- 4)))_1 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 f1 = 2*ULTIMATE.start_main_~length~0#1 - 2*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-02-21 03:34:15,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:34:15,835 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 03:34:15,847 INFO L390 LassoCheck]: Loop: "assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_#t~post210#1 := main_#t~mem209#1;call write~int(1 + main_#t~post210#1, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~j~0#1 := main_~j~0#1 + main_#t~post210#1;havoc main_#t~mem209#1;havoc main_#t~post210#1;" [2022-02-21 03:34:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:15,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:15,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:34:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:15,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:15,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {203#unseeded} is VALID [2022-02-21 03:34:15,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#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~nondet208#1, main_#t~post207#1, main_#t~mem209#1, main_#t~post210#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; {203#unseeded} is VALID [2022-02-21 03:34:15,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#unseeded} assume !(main_~length~0#1 < 1); {203#unseeded} is VALID [2022-02-21 03:34:15,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {203#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; {203#unseeded} is VALID [2022-02-21 03:34:15,968 INFO L290 TraceCheckUtils]: 4: Hoare triple {203#unseeded} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {259#(and (= |ULTIMATE.start_main_~i~0#1| 0) unseeded)} is VALID [2022-02-21 03:34:15,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {259#(and (= |ULTIMATE.start_main_~i~0#1| 0) unseeded)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1; {259#(and (= |ULTIMATE.start_main_~i~0#1| 0) unseeded)} is VALID [2022-02-21 03:34:15,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(and (= |ULTIMATE.start_main_~i~0#1| 0) unseeded)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {238#(and (= |ULTIMATE.start_main_~arr~0#1.offset| (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) unseeded)} is VALID [2022-02-21 03:34:15,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#(and (= |ULTIMATE.start_main_~arr~0#1.offset| (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) unseeded)} assume !(main_~i~0#1 < main_~length~0#1); {238#(and (= |ULTIMATE.start_main_~arr~0#1.offset| (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) unseeded)} is VALID [2022-02-21 03:34:15,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#(and (= |ULTIMATE.start_main_~arr~0#1.offset| (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) unseeded)} main_~j~0#1 := 0; {238#(and (= |ULTIMATE.start_main_~arr~0#1.offset| (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) unseeded)} is VALID [2022-02-21 03:34:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:15,978 WARN L261 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:34:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:15,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:15,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {239#(and (= |ULTIMATE.start_main_~arr~0#1.offset| (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) (>= oldRank0 (ite (> (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4)))) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) 0) 1 0)) (>= oldRank1 (ite (> (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4)))) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) 0) (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4)))) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~length~0#1|)))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_#t~post210#1 := main_#t~mem209#1;call write~int(1 + main_#t~post210#1, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~j~0#1 := main_~j~0#1 + main_#t~post210#1;havoc main_#t~mem209#1;havoc main_#t~post210#1; {241#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (ite (> (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4)))) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) 0) 1 0))) (and (>= oldRank0 (ite (> (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4)))) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) 0) 1 0)) (> oldRank1 (ite (> (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4)))) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) 0) (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4)))) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~length~0#1|)))) (>= oldRank1 0))) (= |ULTIMATE.start_main_~arr~0#1.offset| (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))))} is VALID [2022-02-21 03:34:15,987 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:15,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:15,997 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:15,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:34:15,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:15,999 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2022-02-21 03:34:15,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:16,115 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Result 18 states and 21 transitions. Complement of second has 6 states. [2022-02-21 03:34:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 0 non-accepting loop states 2 accepting loop states [2022-02-21 03:34:16,115 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:16,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:34:16,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:16,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:16,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:16,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:16,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:16,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:16,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:34:16,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:16,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:16,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:16,117 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:34:16,117 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:34:16,117 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:16,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:16,118 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:34:16,118 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2022-02-21 03:34:16,118 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:34:16,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:34:16,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:34:16,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:34:16,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:34:16,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:34:16,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:34:16,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 1 letters. [2022-02-21 03:34:16,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 13 letters. Loop has 1 letters. [2022-02-21 03:34:16,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 1 letters. [2022-02-21 03:34:16,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:16,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:16,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,119 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:16,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:34:16,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:34:16,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:34:16,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:16,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:16,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:16,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:34:16,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:34:16,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:34:16,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:34:16,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:34:16,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:34:16,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 1 letters. [2022-02-21 03:34:16,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 13 letters. Loop has 1 letters. [2022-02-21 03:34:16,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 1 letters. [2022-02-21 03:34:16,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,122 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-02-21 03:34:16,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:34:16,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 10 letters. Loop has 1 letters. [2022-02-21 03:34:16,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:16,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:16,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2022-02-21 03:34:16,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:16,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 15 states and 17 transitions. [2022-02-21 03:34:16,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:34:16,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:34:16,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2022-02-21 03:34:16,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:16,124 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-21 03:34:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2022-02-21 03:34:16,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2022-02-21 03:34:16,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:16,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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:16,125 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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:16,125 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:16,126 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:34:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:34:16,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:16,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:16,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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 15 states and 17 transitions. [2022-02-21 03:34:16,126 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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 15 states and 17 transitions. [2022-02-21 03:34:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:16,126 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:34:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:34:16,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:16,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:16,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:16,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2022-02-21 03:34:16,127 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-02-21 03:34:16,127 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-02-21 03:34:16,127 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:34:16,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2022-02-21 03:34:16,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:16,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:16,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:16,128 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:16,128 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:34:16,128 INFO L791 eck$LassoCheckResult]: Stem: 305#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 306#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~nondet208#1, main_#t~post207#1, main_#t~mem209#1, main_#t~post210#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; 311#L367 assume !(main_~length~0#1 < 1); 307#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; 308#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 309#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1; 312#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 313#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1; 314#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 315#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 310#L370-4 main_~j~0#1 := 0; 304#L374-2 [2022-02-21 03:34:16,133 INFO L793 eck$LassoCheckResult]: Loop: 304#L374-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_#t~post210#1 := main_#t~mem209#1;call write~int(1 + main_#t~post210#1, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~j~0#1 := main_~j~0#1 + main_#t~post210#1;havoc main_#t~mem209#1;havoc main_#t~post210#1; 304#L374-2 [2022-02-21 03:34:16,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:16,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1332965227, now seen corresponding path program 2 times [2022-02-21 03:34:16,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:16,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412197848] [2022-02-21 03:34:16,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:16,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:16,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:16,153 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:16,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:16,154 INFO L85 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 3 times [2022-02-21 03:34:16,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:16,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725756789] [2022-02-21 03:34:16,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:16,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:16,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:16,162 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:16,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:16,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1627750960, now seen corresponding path program 2 times [2022-02-21 03:34:16,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:16,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278554387] [2022-02-21 03:34:16,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:16,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:16,177 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:16,186 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:16,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:16,446 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:16,446 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:16,446 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:16,446 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:16,446 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:16,446 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:16,446 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:16,446 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:16,446 INFO L133 ssoRankerPreferences]: Filename of dumped script: array06_alloca.i_Iteration4_Lasso [2022-02-21 03:34:16,446 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:16,446 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:16,448 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:16,451 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:16,452 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:16,454 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:16,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:16,458 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:16,625 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:34:16,627 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:34:16,629 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:16,631 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:16,633 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:16,636 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:16,895 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:34:16,896 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:34:16,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:16,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:16,897 INFO L229 MonitoredProcess]: Starting monitored process 32 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:16,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:34:16,899 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:16,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:16,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:16,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:16,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:16,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:16,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:16,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:16,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:16,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 03:34:16,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:16,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:16,930 INFO L229 MonitoredProcess]: Starting monitored process 33 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:16,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:34:16,932 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:16,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:16,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:16,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:16,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:16,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:16,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:16,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:16,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:16,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 03:34:16,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:16,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:16,956 INFO L229 MonitoredProcess]: Starting monitored process 34 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:16,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:34:16,959 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:16,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:16,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:16,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:16,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:16,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:16,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:16,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:16,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:16,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:16,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:16,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:16,986 INFO L229 MonitoredProcess]: Starting monitored process 35 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:16,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:34:16,987 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:16,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:16,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:16,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:16,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:16,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:16,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:16,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:16,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 03:34:17,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,011 INFO L229 MonitoredProcess]: Starting monitored process 36 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:17,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:34:17,013 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:17,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:17,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:17,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:17,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 03:34:17,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,061 INFO L229 MonitoredProcess]: Starting monitored process 37 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:17,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:34:17,063 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:17,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:17,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:17,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:17,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:34:17,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,103 INFO L229 MonitoredProcess]: Starting monitored process 38 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:17,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:34:17,105 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:17,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:17,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:17,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:17,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 03:34:17,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,140 INFO L229 MonitoredProcess]: Starting monitored process 39 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:17,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:34:17,143 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:17,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:17,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:17,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:17,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:17,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,170 INFO L229 MonitoredProcess]: Starting monitored process 40 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:17,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:34:17,172 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:17,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:17,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:17,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:17,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-02-21 03:34:17,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,201 INFO L229 MonitoredProcess]: Starting monitored process 41 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:17,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:34:17,204 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:17,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:17,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:17,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:17,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-02-21 03:34:17,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,259 INFO L229 MonitoredProcess]: Starting monitored process 42 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:17,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:34:17,261 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:17,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:17,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:17,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:17,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:34:17,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,292 INFO L229 MonitoredProcess]: Starting monitored process 43 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:17,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:34:17,294 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:17,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:17,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:17,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:17,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:17,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:34:17,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,328 INFO L229 MonitoredProcess]: Starting monitored process 44 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:17,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:34:17,329 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:17,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:17,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:17,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:17,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:17,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:34:17,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,353 INFO L229 MonitoredProcess]: Starting monitored process 45 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:17,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:34:17,355 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:17,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:17,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:17,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:17,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 03:34:17,382 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-02-21 03:34:17,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,383 INFO L229 MonitoredProcess]: Starting monitored process 46 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:17,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:34:17,385 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:17,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:17,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,392 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:17,392 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 03:34:17,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:17,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 03:34:17,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,409 INFO L229 MonitoredProcess]: Starting monitored process 47 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:17,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:34:17,411 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:17,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:17,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,417 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:17,417 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 03:34:17,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:17,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 03:34:17,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,434 INFO L229 MonitoredProcess]: Starting monitored process 48 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:17,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:34:17,437 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:17,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:17,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,447 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:17,448 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 03:34:17,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:17,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:17,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,473 INFO L229 MonitoredProcess]: Starting monitored process 49 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:17,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:34:17,475 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:17,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:17,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,481 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:17,482 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 03:34:17,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:17,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 03:34:17,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,513 INFO L229 MonitoredProcess]: Starting monitored process 50 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:17,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:34:17,515 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:17,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,521 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:17,523 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 03:34:17,523 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 03:34:17,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-02-21 03:34:17,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,541 INFO L229 MonitoredProcess]: Starting monitored process 51 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:17,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:34:17,544 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:17,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,550 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:17,553 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 03:34:17,553 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 03:34:17,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 03:34:17,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,582 INFO L229 MonitoredProcess]: Starting monitored process 52 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:17,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:34:17,584 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:17,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,590 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:17,591 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 03:34:17,591 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 03:34:17,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-02-21 03:34:17,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,619 INFO L229 MonitoredProcess]: Starting monitored process 53 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:17,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:34:17,621 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:17,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,627 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:17,628 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 03:34:17,628 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 03:34:17,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-02-21 03:34:17,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,651 INFO L229 MonitoredProcess]: Starting monitored process 54 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:17,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:34:17,653 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:17,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,659 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:17,663 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 03:34:17,663 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 03:34:17,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:17,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:17,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,690 INFO L229 MonitoredProcess]: Starting monitored process 55 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:17,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 03:34:17,697 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:17,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:17,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:17,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:17,703 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 03:34:17,713 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 03:34:17,714 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 03:34:17,729 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:34:17,767 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2022-02-21 03:34:17,767 INFO L444 ModelExtractionUtils]: 11 out of 46 variables were initially zero. Simplification set additionally 30 variables to zero. [2022-02-21 03:34:17,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:17,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:17,768 INFO L229 MonitoredProcess]: Starting monitored process 56 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:17,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 03:34:17,769 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:34:17,779 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2022-02-21 03:34:17,779 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:34:17,779 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) ULTIMATE.start_main_~arr~0#1.offset)_2 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206#1.base)_3 f1 = -2*ULTIMATE.start_main_~j~0#1 + 2*ULTIMATE.start_main_~length~0#1 Supporting invariants [] [2022-02-21 03:34:17,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:17,847 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 03:34:17,863 INFO L390 LassoCheck]: Loop: "assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_#t~post210#1 := main_#t~mem209#1;call write~int(1 + main_#t~post210#1, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~j~0#1 := main_~j~0#1 + main_#t~post210#1;havoc main_#t~mem209#1;havoc main_#t~post210#1;" [2022-02-21 03:34:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:17,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:17,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:34:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:17,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:17,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {355#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {355#unseeded} is VALID [2022-02-21 03:34:17,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#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~nondet208#1, main_#t~post207#1, main_#t~mem209#1, main_#t~post210#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; {355#unseeded} is VALID [2022-02-21 03:34:17,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#unseeded} assume !(main_~length~0#1 < 1); {355#unseeded} is VALID [2022-02-21 03:34:17,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {355#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; {400#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:17,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {400#(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);main_~i~0#1 := 0; {400#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:17,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {400#(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);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1; {400#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:17,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {400#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {400#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:17,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {400#(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);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1; {400#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:17,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {400#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {400#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:17,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(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); {400#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:17,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {400#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} main_~j~0#1 := 0; {400#(and unseeded (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:17,977 WARN L261 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:34:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:17,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:17,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {401#(and (>= oldRank0 (ite (> (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))) 0) 1 0)) (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (>= oldRank1 (ite (> (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))) 0) (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))) (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~length~0#1|)))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_#t~post210#1 := main_#t~mem209#1;call write~int(1 + main_#t~post210#1, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~j~0#1 := main_~j~0#1 + main_#t~post210#1;havoc main_#t~mem209#1;havoc main_#t~post210#1; {403#(and (or (and (>= oldRank0 (ite (> (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))) 0) 1 0)) (> oldRank1 (ite (> (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))) 0) (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))) (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~length~0#1|)))) (>= oldRank1 0)) unseeded (and (>= oldRank0 0) (> oldRank0 (ite (> (+ (select |#length| |ULTIMATE.start_main_#t~malloc206#1.base|) (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))) 0) 1 0)))) (= |ULTIMATE.start_main_#t~malloc206#1.base| |ULTIMATE.start_main_~arr~0#1.base|))} is VALID [2022-02-21 03:34:17,987 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:17,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:17,998 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:17,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:34:17,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:17,999 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2022-02-21 03:34:17,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:18,052 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Result 13 states and 15 transitions. Complement of second has 3 states. [2022-02-21 03:34:18,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:34:18,052 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:18,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. cyclomatic complexity: 4 [2022-02-21 03:34:18,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:18,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:18,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:18,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:18,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:18,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:18,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2022-02-21 03:34:18,054 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:34:18,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:34:18,055 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 14 transitions. cyclomatic complexity: 4 [2022-02-21 03:34:18,055 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:34:18,055 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:18,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:18,056 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:34:18,056 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 15 transitions. cyclomatic complexity: 4 [2022-02-21 03:34:18,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. cyclomatic complexity: 4 [2022-02-21 03:34:18,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:34:18,056 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:34:18,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:34:18,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:34:18,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:34:18,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:18,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:18,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:18,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:34:18,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:34:18,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:34:18,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:34:18,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:34:18,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:34:18,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:34:18,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:34:18,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:34:18,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:34:18,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:34:18,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:34:18,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:18,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:18,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:18,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,061 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:34:18,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:34:18,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 12 letters. Loop has 1 letters. [2022-02-21 03:34:18,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:34:18,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:18,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. cyclomatic complexity: 4 [2022-02-21 03:34:18,063 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:34:18,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2022-02-21 03:34:18,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:34:18,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:34:18,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:34:18,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:18,063 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:34:18,063 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:34:18,063 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:34:18,063 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:34:18,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:34:18,064 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:34:18,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:34:18,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:34:18 BoogieIcfgContainer [2022-02-21 03:34:18,068 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:34:18,069 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:34:18,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:34:18,069 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:34:18,070 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:12" (3/4) ... [2022-02-21 03:34:18,072 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:34:18,072 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:34:18,073 INFO L158 Benchmark]: Toolchain (without parser) took 6748.19ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 49.6MB in the beginning and 64.4MB in the end (delta: -14.8MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2022-02-21 03:34:18,073 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 90.2MB. Free memory was 67.3MB in the beginning and 67.3MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:34:18,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.42ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 49.4MB in the beginning and 76.9MB in the end (delta: -27.5MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2022-02-21 03:34:18,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.34ms. Allocated memory is still 109.1MB. Free memory was 76.9MB in the beginning and 74.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:34:18,074 INFO L158 Benchmark]: Boogie Preprocessor took 29.46ms. Allocated memory is still 109.1MB. Free memory was 74.8MB in the beginning and 73.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:34:18,074 INFO L158 Benchmark]: RCFGBuilder took 260.05ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 62.2MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:34:18,074 INFO L158 Benchmark]: BuchiAutomizer took 6057.34ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 62.2MB in the beginning and 64.4MB in the end (delta: -2.2MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2022-02-21 03:34:18,074 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 159.4MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:34:18,075 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.13ms. Allocated memory is still 90.2MB. Free memory was 67.3MB in the beginning and 67.3MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.42ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 49.4MB in the beginning and 76.9MB in the end (delta: -27.5MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.34ms. Allocated memory is still 109.1MB. Free memory was 76.9MB in the beginning and 74.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.46ms. Allocated memory is still 109.1MB. Free memory was 74.8MB in the beginning and 73.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 260.05ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 62.2MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6057.34ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 62.2MB in the beginning and 64.4MB in the end (delta: -2.2MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 159.4MB. Free memory is still 64.4MB. 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 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#length-unknown[arr] + -4 * i + -1 * arr and consists of 5 locations. One deterministic module has 2-nested ranking function (if -2 * unknown-#memory_int-unknown[arr][i * 4 + arr + -4] + unknown-#length-unknown[arr] > 0 then 1 else 0), (if -2 * unknown-#memory_int-unknown[arr][i * 4 + arr + -4] + unknown-#length-unknown[arr] > 0 then -2 * unknown-#memory_int-unknown[arr][i * 4 + arr + -4] + unknown-#length-unknown[arr] else -2 * j + 2 * length) and consists of 5 locations. One deterministic module has 2-nested ranking function (if unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -2 * unknown-#memory_int-unknown[arr][arr] > 0 then 1 else 0), (if unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -2 * unknown-#memory_int-unknown[arr][arr] > 0 then unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -2 * unknown-#memory_int-unknown[arr][arr] else -2 * j + 2 * length) and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 35 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital122 mio100 ax100 hnf100 lsp94 ukn86 mio100 lsp67 div100 bol100 ite100 ukn100 eq176 hnf90 smp97 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:34:18,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-02-21 03:34:18,315 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