./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_22.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.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-restricted-15/NO_22.c -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 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 04:33:14,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 04:33:14,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 04:33:14,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 04:33:14,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 04:33:14,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 04:33:14,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 04:33:14,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 04:33:14,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 04:33:14,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 04:33:14,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 04:33:14,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 04:33:14,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 04:33:14,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 04:33:14,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 04:33:14,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 04:33:14,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 04:33:14,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 04:33:14,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 04:33:14,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 04:33:14,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 04:33:14,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 04:33:14,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 04:33:14,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 04:33:14,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 04:33:14,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 04:33:14,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 04:33:14,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 04:33:14,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 04:33:14,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 04:33:14,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 04:33:14,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 04:33:14,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 04:33:14,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 04:33:14,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 04:33:14,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 04:33:14,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 04:33:14,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 04:33:14,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 04:33:14,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 04:33:14,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 04:33:14,547 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-16 04:33:14,567 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 04:33:14,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 04:33:14,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 04:33:14,568 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 04:33:14,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 04:33:14,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 04:33:14,569 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 04:33:14,569 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-16 04:33:14,569 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-16 04:33:14,569 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-16 04:33:14,570 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-16 04:33:14,570 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-16 04:33:14,570 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-16 04:33:14,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 04:33:14,571 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 04:33:14,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 04:33:14,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 04:33:14,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-16 04:33:14,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-16 04:33:14,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-16 04:33:14,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 04:33:14,572 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-16 04:33:14,572 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 04:33:14,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-16 04:33:14,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 04:33:14,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 04:33:14,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 04:33:14,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 04:33:14,574 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-16 04:33:14,574 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 -> 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 [2023-02-16 04:33:14,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 04:33:14,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 04:33:14,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 04:33:14,785 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 04:33:14,786 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 04:33:14,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_22.c [2023-02-16 04:33:15,849 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 04:33:15,979 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 04:33:15,979 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_22.c [2023-02-16 04:33:15,983 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefd90d40/1704d0b2a4ae4bc2a5123c1d7ce51760/FLAGb1572e8f7 [2023-02-16 04:33:16,414 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefd90d40/1704d0b2a4ae4bc2a5123c1d7ce51760 [2023-02-16 04:33:16,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 04:33:16,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 04:33:16,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 04:33:16,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 04:33:16,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 04:33:16,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:33:16" (1/1) ... [2023-02-16 04:33:16,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764b5dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16, skipping insertion in model container [2023-02-16 04:33:16,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:33:16" (1/1) ... [2023-02-16 04:33:16,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 04:33:16,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 04:33:16,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:33:16,547 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 04:33:16,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:33:16,566 INFO L208 MainTranslator]: Completed translation [2023-02-16 04:33:16,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16 WrapperNode [2023-02-16 04:33:16,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 04:33:16,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 04:33:16,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 04:33:16,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 04:33:16,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16" (1/1) ... [2023-02-16 04:33:16,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16" (1/1) ... [2023-02-16 04:33:16,585 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2023-02-16 04:33:16,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 04:33:16,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 04:33:16,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 04:33:16,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 04:33:16,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16" (1/1) ... [2023-02-16 04:33:16,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16" (1/1) ... [2023-02-16 04:33:16,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16" (1/1) ... [2023-02-16 04:33:16,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16" (1/1) ... [2023-02-16 04:33:16,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16" (1/1) ... [2023-02-16 04:33:16,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16" (1/1) ... [2023-02-16 04:33:16,595 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16" (1/1) ... [2023-02-16 04:33:16,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16" (1/1) ... [2023-02-16 04:33:16,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 04:33:16,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 04:33:16,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 04:33:16,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 04:33:16,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16" (1/1) ... [2023-02-16 04:33:16,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:16,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:16,621 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) [2023-02-16 04:33:16,652 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 [2023-02-16 04:33:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 04:33:16,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 04:33:16,717 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 04:33:16,719 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 04:33:16,774 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 04:33:16,778 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 04:33:16,779 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 04:33:16,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:33:16 BoogieIcfgContainer [2023-02-16 04:33:16,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 04:33:16,781 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-16 04:33:16,781 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-16 04:33:16,784 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-16 04:33:16,784 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-16 04:33:16,784 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.02 04:33:16" (1/3) ... [2023-02-16 04:33:16,785 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7607ef8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.02 04:33:16, skipping insertion in model container [2023-02-16 04:33:16,785 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-16 04:33:16,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:16" (2/3) ... [2023-02-16 04:33:16,785 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7607ef8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.02 04:33:16, skipping insertion in model container [2023-02-16 04:33:16,786 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-16 04:33:16,786 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:33:16" (3/3) ... [2023-02-16 04:33:16,787 INFO L332 chiAutomizerObserver]: Analyzing ICFG NO_22.c [2023-02-16 04:33:16,836 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-16 04:33:16,836 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-16 04:33:16,836 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-16 04:33:16,837 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-16 04:33:16,837 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-16 04:33:16,837 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-16 04:33:16,837 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-16 04:33:16,837 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-16 04:33:16,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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) [2023-02-16 04:33:16,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-16 04:33:16,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:16,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:16,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-16 04:33:16,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-16 04:33:16,873 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-16 04:33:16,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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) [2023-02-16 04:33:16,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-16 04:33:16,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:16,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:16,874 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-16 04:33:16,874 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-16 04:33:16,880 INFO L748 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 3#L10-2true [2023-02-16 04:33:16,880 INFO L750 eck$LassoCheckResult]: Loop: 3#L10-2true assume !!(main_~i~0#1 < 100); 5#L10true assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 3#L10-2true [2023-02-16 04:33:16,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:16,884 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-16 04:33:16,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:16,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951439223] [2023-02-16 04:33:16,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:16,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:16,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:16,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:16,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:16,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2023-02-16 04:33:16,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:16,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742693900] [2023-02-16 04:33:16,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:16,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:16,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:16,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:16,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:16,991 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2023-02-16 04:33:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:16,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431045290] [2023-02-16 04:33:16,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:16,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:17,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:17,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431045290] [2023-02-16 04:33:17,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431045290] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:33:17,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:33:17,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:33:17,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600787008] [2023-02-16 04:33:17,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:33:17,120 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:17,120 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:17,120 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:17,137 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:17,137 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:33:17,137 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:17,137 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:17,137 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:17,137 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2023-02-16 04:33:17,138 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:17,138 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:17,149 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:17,180 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:17,183 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:17,233 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:17,234 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:33:17,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:17,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:17,238 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) [2023-02-16 04:33:17,250 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 [2023-02-16 04:33:17,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:17,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:17,278 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:17,279 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:17,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:17,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:17,293 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) [2023-02-16 04:33:17,293 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 [2023-02-16 04:33:17,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:17,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:17,308 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:17,308 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:17,313 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 [2023-02-16 04:33:17,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:17,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:17,378 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) [2023-02-16 04:33:17,379 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 [2023-02-16 04:33:17,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:17,380 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:17,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:17,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:17,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:17,396 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) [2023-02-16 04:33:17,398 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 [2023-02-16 04:33:17,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:33:17,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:17,425 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:33:17,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:17,444 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:17,445 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:17,445 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:17,445 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:17,445 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:33:17,445 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:17,445 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:17,445 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:17,445 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2023-02-16 04:33:17,445 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:17,445 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:17,447 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:17,451 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:17,458 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:17,506 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:17,510 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:33:17,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:17,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:17,512 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) [2023-02-16 04:33:17,514 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 [2023-02-16 04:33:17,516 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 [2023-02-16 04:33:17,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:17,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:17,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:17,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:17,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:33:17,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:33:17,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:33:17,552 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 [2023-02-16 04:33:17,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:17,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:17,553 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) [2023-02-16 04:33:17,555 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 [2023-02-16 04:33:17,557 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 [2023-02-16 04:33:17,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:17,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:17,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:17,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:17,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:33:17,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:33:17,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:33:17,580 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 [2023-02-16 04:33:17,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:17,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:17,582 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) [2023-02-16 04:33:17,584 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 [2023-02-16 04:33:17,585 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 [2023-02-16 04:33:17,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:17,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:17,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:17,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:17,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:17,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:17,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:17,618 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:33:17,627 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:33:17,627 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-16 04:33:17,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:17,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:17,629 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) [2023-02-16 04:33:17,631 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 [2023-02-16 04:33:17,632 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:33:17,632 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:33:17,633 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:33:17,633 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-16 04:33:17,641 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 [2023-02-16 04:33:17,645 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:33:17,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:17,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:17,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:17,715 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:17,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:17,746 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-02-16 04:33:17,747 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-02-16 04:33:17,773 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 24 states and 31 transitions. Complement of second has 6 states. [2023-02-16 04:33:17,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-16 04:33:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-02-16 04:33:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2023-02-16 04:33:17,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 2 letters. [2023-02-16 04:33:17,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:17,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 2 letters. [2023-02-16 04:33:17,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:17,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 4 letters. [2023-02-16 04:33:17,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:17,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2023-02-16 04:33:17,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-16 04:33:17,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2023-02-16 04:33:17,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-16 04:33:17,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-16 04:33:17,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2023-02-16 04:33:17,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:17,787 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-16 04:33:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2023-02-16 04:33:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-02-16 04:33:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2023-02-16 04:33:17,804 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-16 04:33:17,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:33:17,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:33:17,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:33:17,807 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-02-16 04:33:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:33:17,814 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2023-02-16 04:33:17,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2023-02-16 04:33:17,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-16 04:33:17,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2023-02-16 04:33:17,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-02-16 04:33:17,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-16 04:33:17,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2023-02-16 04:33:17,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-16 04:33:17,816 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2023-02-16 04:33:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2023-02-16 04:33:17,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2023-02-16 04:33:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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) [2023-02-16 04:33:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2023-02-16 04:33:17,817 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2023-02-16 04:33:17,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:33:17,818 INFO L428 stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2023-02-16 04:33:17,818 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-16 04:33:17,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2023-02-16 04:33:17,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-16 04:33:17,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:17,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:17,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-16 04:33:17,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-16 04:33:17,819 INFO L748 eck$LassoCheckResult]: Stem: 86#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 87#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 88#L10-2 assume !!(main_~i~0#1 < 100); 85#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 83#L10-2 [2023-02-16 04:33:17,819 INFO L750 eck$LassoCheckResult]: Loop: 83#L10-2 assume !!(main_~i~0#1 < 100); 84#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 83#L10-2 [2023-02-16 04:33:17,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2023-02-16 04:33:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:17,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774395383] [2023-02-16 04:33:17,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:17,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:17,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:17,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2023-02-16 04:33:17,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:17,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87301367] [2023-02-16 04:33:17,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:17,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:17,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:17,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:17,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2023-02-16 04:33:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:17,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608668525] [2023-02-16 04:33:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:17,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:17,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:17,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:17,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608668525] [2023-02-16 04:33:17,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608668525] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:33:17,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206380493] [2023-02-16 04:33:17,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:17,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:33:17,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:17,861 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:33:17,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 04:33:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:17,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:33:17,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:17,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:33:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:17,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206380493] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:33:17,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:33:17,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-16 04:33:17,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480215086] [2023-02-16 04:33:17,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:33:17,966 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:17,966 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:17,966 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:17,966 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:17,967 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:33:17,967 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:17,967 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:17,967 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:17,967 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2023-02-16 04:33:17,967 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:17,967 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:17,968 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:17,970 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:17,973 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:18,000 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:18,000 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:33:18,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:18,003 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) [2023-02-16 04:33:18,004 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 [2023-02-16 04:33:18,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:18,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:18,026 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:18,027 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:18,049 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 [2023-02-16 04:33:18,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:18,050 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) [2023-02-16 04:33:18,069 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 [2023-02-16 04:33:18,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:18,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:18,093 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:18,093 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:18,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:18,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:18,098 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) [2023-02-16 04:33:18,101 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 [2023-02-16 04:33:18,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:18,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:18,126 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 [2023-02-16 04:33:18,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:18,128 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) [2023-02-16 04:33:18,129 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 [2023-02-16 04:33:18,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:33:18,132 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:18,157 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:33:18,175 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 [2023-02-16 04:33:18,175 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:18,175 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:18,175 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:18,175 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:18,175 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:33:18,175 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,175 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:18,175 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:18,175 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2023-02-16 04:33:18,176 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:18,176 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:18,177 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:18,179 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:18,185 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:18,230 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:18,230 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:33:18,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:18,232 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) [2023-02-16 04:33:18,258 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 [2023-02-16 04:33:18,261 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 [2023-02-16 04:33:18,262 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 [2023-02-16 04:33:18,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:18,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:18,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:18,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:18,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:33:18,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:33:18,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:33:18,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:18,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:18,289 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) [2023-02-16 04:33:18,305 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 [2023-02-16 04:33:18,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:18,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:18,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:18,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:18,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:18,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:18,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:18,316 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 [2023-02-16 04:33:18,324 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:33:18,326 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:33:18,326 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-16 04:33:18,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:18,328 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) [2023-02-16 04:33:18,333 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:33:18,333 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:33:18,333 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:33:18,333 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-16 04:33:18,339 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 [2023-02-16 04:33:18,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:18,340 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:33:18,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:18,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:18,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:18,360 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:18,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:18,362 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-02-16 04:33:18,362 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2023-02-16 04:33:18,369 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 10 states and 13 transitions. Complement of second has 5 states. [2023-02-16 04:33:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-16 04:33:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2023-02-16 04:33:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2023-02-16 04:33:18,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2023-02-16 04:33:18,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:18,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2023-02-16 04:33:18,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:18,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2023-02-16 04:33:18,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:18,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2023-02-16 04:33:18,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-16 04:33:18,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2023-02-16 04:33:18,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-02-16 04:33:18,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-16 04:33:18,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2023-02-16 04:33:18,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:18,372 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2023-02-16 04:33:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2023-02-16 04:33:18,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-02-16 04:33:18,373 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) [2023-02-16 04:33:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2023-02-16 04:33:18,373 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2023-02-16 04:33:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:33:18,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:33:18,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:33:18,374 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:33:18,387 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2023-02-16 04:33:18,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2023-02-16 04:33:18,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-16 04:33:18,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2023-02-16 04:33:18,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-02-16 04:33:18,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-02-16 04:33:18,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2023-02-16 04:33:18,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-16 04:33:18,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-02-16 04:33:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2023-02-16 04:33:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-02-16 04:33:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 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) [2023-02-16 04:33:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-02-16 04:33:18,390 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-02-16 04:33:18,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:33:18,390 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-02-16 04:33:18,391 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-16 04:33:18,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2023-02-16 04:33:18,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-16 04:33:18,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:18,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:18,392 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1] [2023-02-16 04:33:18,392 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-16 04:33:18,401 INFO L748 eck$LassoCheckResult]: Stem: 196#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 198#L10-2 assume !!(main_~i~0#1 < 100); 195#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 193#L10-2 assume !!(main_~i~0#1 < 100); 194#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 204#L10-2 assume !!(main_~i~0#1 < 100); 203#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 202#L10-2 assume !!(main_~i~0#1 < 100); 201#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 200#L10-2 [2023-02-16 04:33:18,401 INFO L750 eck$LassoCheckResult]: Loop: 200#L10-2 assume !!(main_~i~0#1 < 100); 199#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 200#L10-2 [2023-02-16 04:33:18,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:18,402 INFO L85 PathProgramCache]: Analyzing trace with hash 742492623, now seen corresponding path program 2 times [2023-02-16 04:33:18,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:18,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729690153] [2023-02-16 04:33:18,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:18,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:18,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:18,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2023-02-16 04:33:18,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:18,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789532041] [2023-02-16 04:33:18,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:18,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:18,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:18,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:18,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:18,431 INFO L85 PathProgramCache]: Analyzing trace with hash 570839924, now seen corresponding path program 2 times [2023-02-16 04:33:18,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:18,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857836054] [2023-02-16 04:33:18,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:18,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:18,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:18,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857836054] [2023-02-16 04:33:18,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857836054] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:33:18,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460999362] [2023-02-16 04:33:18,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 04:33:18,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:33:18,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:18,498 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:33:18,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-16 04:33:18,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 04:33:18,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:33:18,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 04:33:18,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:18,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:33:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:18,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460999362] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:33:18,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:33:18,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-02-16 04:33:18,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89702820] [2023-02-16 04:33:18,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:33:18,629 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:18,629 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:18,629 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:18,629 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:18,629 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:33:18,629 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,629 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:18,629 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:18,629 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2023-02-16 04:33:18,630 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:18,630 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:18,630 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:18,636 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:18,638 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:18,665 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:18,665 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:33:18,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:18,683 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) [2023-02-16 04:33:18,684 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 [2023-02-16 04:33:18,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:18,685 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:18,719 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 [2023-02-16 04:33:18,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:18,721 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) [2023-02-16 04:33:18,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:33:18,729 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:18,738 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 [2023-02-16 04:33:18,747 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:33:18,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:18,752 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:18,753 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:18,753 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:18,753 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:18,753 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:33:18,753 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,753 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:18,753 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:18,753 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2023-02-16 04:33:18,753 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:18,753 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:18,754 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:18,760 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:18,762 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:18,794 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:18,794 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:33:18,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:18,803 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) [2023-02-16 04:33:18,825 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 [2023-02-16 04:33:18,825 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 [2023-02-16 04:33:18,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:18,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:18,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:18,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:18,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:18,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:18,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:18,848 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:33:18,851 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:33:18,851 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-16 04:33:18,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:18,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:18,865 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) [2023-02-16 04:33:18,866 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 [2023-02-16 04:33:18,867 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:33:18,867 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:33:18,867 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:33:18,867 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-16 04:33:18,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:18,871 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:33:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:18,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:18,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:18,898 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:18,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:18,900 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-02-16 04:33:18,900 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 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) [2023-02-16 04:33:18,904 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. 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 13 states and 14 transitions. Complement of second has 5 states. [2023-02-16 04:33:18,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-16 04:33:18,905 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) [2023-02-16 04:33:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2023-02-16 04:33:18,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2023-02-16 04:33:18,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:18,905 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:33:18,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:18,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:18,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:18,925 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:18,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:18,929 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-02-16 04:33:18,929 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 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) [2023-02-16 04:33:18,932 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. 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 13 states and 14 transitions. Complement of second has 5 states. [2023-02-16 04:33:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-16 04:33:18,933 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) [2023-02-16 04:33:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2023-02-16 04:33:18,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2023-02-16 04:33:18,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:18,933 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:33:18,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:18,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:18,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:18,956 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:18,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:18,958 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-02-16 04:33:18,958 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 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) [2023-02-16 04:33:18,963 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. 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 17 states and 19 transitions. Complement of second has 4 states. [2023-02-16 04:33:18,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-16 04:33:18,967 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) [2023-02-16 04:33:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2023-02-16 04:33:18,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2023-02-16 04:33:18,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:18,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2023-02-16 04:33:18,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:18,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2023-02-16 04:33:18,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:18,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2023-02-16 04:33:18,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-16 04:33:18,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2023-02-16 04:33:18,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-16 04:33:18,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-02-16 04:33:18,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2023-02-16 04:33:18,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:18,981 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-02-16 04:33:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2023-02-16 04:33:18,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2023-02-16 04:33:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 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) [2023-02-16 04:33:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-02-16 04:33:18,982 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-02-16 04:33:18,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:33:18,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 04:33:18,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:33:18,983 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:33:19,004 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-02-16 04:33:19,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2023-02-16 04:33:19,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-16 04:33:19,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2023-02-16 04:33:19,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-02-16 04:33:19,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-02-16 04:33:19,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2023-02-16 04:33:19,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:19,006 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-02-16 04:33:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2023-02-16 04:33:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-02-16 04:33:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 24 states have internal predecessors, (27), 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) [2023-02-16 04:33:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-02-16 04:33:19,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-02-16 04:33:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 04:33:19,008 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-02-16 04:33:19,008 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-16 04:33:19,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2023-02-16 04:33:19,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-16 04:33:19,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:19,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:19,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1] [2023-02-16 04:33:19,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-16 04:33:19,014 INFO L748 eck$LassoCheckResult]: Stem: 509#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 510#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 511#L10-2 assume !!(main_~i~0#1 < 100); 508#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 503#L10-2 assume !!(main_~i~0#1 < 100); 504#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 527#L10-2 assume !!(main_~i~0#1 < 100); 526#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 525#L10-2 assume !!(main_~i~0#1 < 100); 524#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 523#L10-2 assume !!(main_~i~0#1 < 100); 522#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 521#L10-2 assume !!(main_~i~0#1 < 100); 520#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 519#L10-2 assume !!(main_~i~0#1 < 100); 518#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 517#L10-2 assume !!(main_~i~0#1 < 100); 516#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 515#L10-2 assume !!(main_~i~0#1 < 100); 514#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 513#L10-2 assume !!(main_~i~0#1 < 100); 507#L10 [2023-02-16 04:33:19,014 INFO L750 eck$LassoCheckResult]: Loop: 507#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 512#L10-2 assume !!(main_~i~0#1 < 100); 507#L10 [2023-02-16 04:33:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:19,014 INFO L85 PathProgramCache]: Analyzing trace with hash -926509747, now seen corresponding path program 3 times [2023-02-16 04:33:19,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:19,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921493954] [2023-02-16 04:33:19,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:19,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:19,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:19,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2023-02-16 04:33:19,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:19,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228930641] [2023-02-16 04:33:19,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:19,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:19,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:19,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636150, now seen corresponding path program 4 times [2023-02-16 04:33:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:19,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659488652] [2023-02-16 04:33:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:19,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:19,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:19,107 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:19,107 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:19,107 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:19,107 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:19,107 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:33:19,108 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:19,108 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:19,108 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:19,108 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2023-02-16 04:33:19,108 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:19,108 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:19,109 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:19,114 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:19,116 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:19,142 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:19,143 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:33:19,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:19,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:19,182 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) [2023-02-16 04:33:19,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:19,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:19,215 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 [2023-02-16 04:33:19,229 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 [2023-02-16 04:33:19,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:19,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:19,230 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) [2023-02-16 04:33:19,250 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 [2023-02-16 04:33:19,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:33:19,251 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:19,281 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:33:19,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:19,287 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:19,287 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:19,287 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:19,287 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:19,287 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:33:19,287 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:19,287 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:19,287 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:19,287 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2023-02-16 04:33:19,287 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:19,287 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:19,288 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:19,295 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:19,297 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:19,324 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:19,324 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:33:19,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:19,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:19,325 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) [2023-02-16 04:33:19,328 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 [2023-02-16 04:33:19,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 [2023-02-16 04:33:19,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:19,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:19,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:19,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:19,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:19,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:19,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:19,352 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:33:19,365 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:33:19,365 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-16 04:33:19,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:19,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:19,368 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) [2023-02-16 04:33:19,379 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:33:19,379 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:33:19,379 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:33:19,379 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2023-02-16 04:33:19,381 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 [2023-02-16 04:33:19,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:19,395 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:33:19,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:19,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:19,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:19,449 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:19,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:19,460 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-16 04:33:19,460 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3 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) [2023-02-16 04:33:19,468 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3. 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 38 states and 42 transitions. Complement of second has 5 states. [2023-02-16 04:33:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-16 04:33:19,469 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) [2023-02-16 04:33:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2023-02-16 04:33:19,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 2 letters. [2023-02-16 04:33:19,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:19,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 23 letters. Loop has 2 letters. [2023-02-16 04:33:19,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:19,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 4 letters. [2023-02-16 04:33:19,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:19,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2023-02-16 04:33:19,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-16 04:33:19,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 31 transitions. [2023-02-16 04:33:19,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-02-16 04:33:19,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-16 04:33:19,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2023-02-16 04:33:19,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:19,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-02-16 04:33:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2023-02-16 04:33:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-02-16 04:33:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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) [2023-02-16 04:33:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-16 04:33:19,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-16 04:33:19,473 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-16 04:33:19,473 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-16 04:33:19,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2023-02-16 04:33:19,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-16 04:33:19,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:19,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:19,474 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2023-02-16 04:33:19,474 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-16 04:33:19,474 INFO L748 eck$LassoCheckResult]: Stem: 663#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 664#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 665#L10-2 assume !!(main_~i~0#1 < 100); 660#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 661#L10-2 assume !!(main_~i~0#1 < 100); 662#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 658#L10-2 assume !!(main_~i~0#1 < 100); 659#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 681#L10-2 assume !!(main_~i~0#1 < 100); 680#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 679#L10-2 assume !!(main_~i~0#1 < 100); 678#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 677#L10-2 assume !!(main_~i~0#1 < 100); 676#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 675#L10-2 assume !!(main_~i~0#1 < 100); 674#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 673#L10-2 assume !!(main_~i~0#1 < 100); 672#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 671#L10-2 assume !!(main_~i~0#1 < 100); 670#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 669#L10-2 assume !!(main_~i~0#1 < 100); 668#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 667#L10-2 assume !!(main_~i~0#1 < 100); 656#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 666#L10-2 assume !!(main_~i~0#1 < 100); 657#L10 [2023-02-16 04:33:19,474 INFO L750 eck$LassoCheckResult]: Loop: 657#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 655#L10-2 assume !!(main_~i~0#1 < 100); 657#L10 [2023-02-16 04:33:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 3 times [2023-02-16 04:33:19,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:19,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701725545] [2023-02-16 04:33:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:19,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:19,564 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 [2023-02-16 04:33:19,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:19,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:19,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701725545] [2023-02-16 04:33:19,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701725545] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:33:19,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606981323] [2023-02-16 04:33:19,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 04:33:19,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:33:19,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:19,616 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:33:19,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-02-16 04:33:19,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-02-16 04:33:19,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:33:19,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 04:33:19,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:19,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:33:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:19,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606981323] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:33:19,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:33:19,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2023-02-16 04:33:19,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927054484] [2023-02-16 04:33:19,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:33:19,850 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-16 04:33:19,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:19,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2023-02-16 04:33:19,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:19,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101882117] [2023-02-16 04:33:19,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:19,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:19,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:19,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:19,865 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:19,865 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:19,865 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:19,865 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:19,865 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:33:19,865 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:19,865 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:19,865 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:19,865 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2023-02-16 04:33:19,865 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:19,866 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:19,867 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:19,869 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:19,870 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:19,884 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:19,884 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:33:19,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:19,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:19,897 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) [2023-02-16 04:33:19,912 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 [2023-02-16 04:33:19,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:19,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:19,952 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 [2023-02-16 04:33:19,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:19,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:19,953 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) [2023-02-16 04:33:19,955 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 [2023-02-16 04:33:19,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:33:19,956 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:19,978 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:33:19,983 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 [2023-02-16 04:33:19,983 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:19,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:19,983 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:19,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:19,983 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:33:19,983 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:19,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:19,983 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:19,983 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2023-02-16 04:33:19,983 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:19,983 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:19,984 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:19,996 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:19,999 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:20,024 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:20,024 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:33:20,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:20,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:20,051 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) [2023-02-16 04:33:20,069 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 [2023-02-16 04:33:20,070 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 [2023-02-16 04:33:20,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:20,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:20,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:20,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:20,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:20,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:20,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:20,088 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:33:20,089 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:33:20,090 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-16 04:33:20,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:20,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:20,093 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) [2023-02-16 04:33:20,093 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 [2023-02-16 04:33:20,110 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:33:20,110 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:33:20,110 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:33:20,110 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2023-02-16 04:33:20,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:20,119 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:33:20,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:20,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:20,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:20,169 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:20,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:20,180 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-16 04:33:20,180 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-02-16 04:33:20,186 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 38 states and 42 transitions. Complement of second has 5 states. [2023-02-16 04:33:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-16 04:33:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-02-16 04:33:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2023-02-16 04:33:20,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 25 letters. Loop has 2 letters. [2023-02-16 04:33:20,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:20,187 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:33:20,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:20,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:20,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:20,222 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:20,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:20,231 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-16 04:33:20,231 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-02-16 04:33:20,241 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 43 transitions. Complement of second has 5 states. [2023-02-16 04:33:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-16 04:33:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-02-16 04:33:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2023-02-16 04:33:20,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 25 letters. Loop has 2 letters. [2023-02-16 04:33:20,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:20,242 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:33:20,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:20,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:20,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:20,282 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:20,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:20,301 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-16 04:33:20,302 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-02-16 04:33:20,322 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 40 states and 45 transitions. Complement of second has 4 states. [2023-02-16 04:33:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-16 04:33:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-02-16 04:33:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2023-02-16 04:33:20,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 2 letters. [2023-02-16 04:33:20,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:20,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2023-02-16 04:33:20,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:20,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 4 letters. [2023-02-16 04:33:20,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:20,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2023-02-16 04:33:20,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-16 04:33:20,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2023-02-16 04:33:20,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-16 04:33:20,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-16 04:33:20,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2023-02-16 04:33:20,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:20,325 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-02-16 04:33:20,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2023-02-16 04:33:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-02-16 04:33:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 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) [2023-02-16 04:33:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-02-16 04:33:20,326 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-02-16 04:33:20,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:33:20,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 04:33:20,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2023-02-16 04:33:20,327 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 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) [2023-02-16 04:33:20,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:33:20,404 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2023-02-16 04:33:20,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2023-02-16 04:33:20,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-16 04:33:20,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2023-02-16 04:33:20,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-16 04:33:20,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-16 04:33:20,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2023-02-16 04:33:20,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:20,410 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2023-02-16 04:33:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2023-02-16 04:33:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-02-16 04:33:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.04) internal successors, (52), 49 states have internal predecessors, (52), 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) [2023-02-16 04:33:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2023-02-16 04:33:20,417 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2023-02-16 04:33:20,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-16 04:33:20,418 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2023-02-16 04:33:20,418 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-16 04:33:20,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2023-02-16 04:33:20,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-16 04:33:20,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:20,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:20,422 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 22, 1, 1, 1] [2023-02-16 04:33:20,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2023-02-16 04:33:20,423 INFO L748 eck$LassoCheckResult]: Stem: 1330#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1331#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 1324#L10-2 assume !!(main_~i~0#1 < 100); 1325#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1328#L10-2 assume !!(main_~i~0#1 < 100); 1329#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1326#L10-2 assume !!(main_~i~0#1 < 100); 1327#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1373#L10-2 assume !!(main_~i~0#1 < 100); 1372#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1371#L10-2 assume !!(main_~i~0#1 < 100); 1370#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1369#L10-2 assume !!(main_~i~0#1 < 100); 1368#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1367#L10-2 assume !!(main_~i~0#1 < 100); 1366#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1365#L10-2 assume !!(main_~i~0#1 < 100); 1364#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1363#L10-2 assume !!(main_~i~0#1 < 100); 1362#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1361#L10-2 assume !!(main_~i~0#1 < 100); 1360#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1359#L10-2 assume !!(main_~i~0#1 < 100); 1358#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1357#L10-2 assume !!(main_~i~0#1 < 100); 1356#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1355#L10-2 assume !!(main_~i~0#1 < 100); 1354#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1353#L10-2 assume !!(main_~i~0#1 < 100); 1352#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1351#L10-2 assume !!(main_~i~0#1 < 100); 1350#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1349#L10-2 assume !!(main_~i~0#1 < 100); 1348#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1347#L10-2 assume !!(main_~i~0#1 < 100); 1346#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1345#L10-2 assume !!(main_~i~0#1 < 100); 1344#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1343#L10-2 assume !!(main_~i~0#1 < 100); 1342#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1341#L10-2 assume !!(main_~i~0#1 < 100); 1340#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1339#L10-2 assume !!(main_~i~0#1 < 100); 1338#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1337#L10-2 assume !!(main_~i~0#1 < 100); 1336#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1335#L10-2 assume !!(main_~i~0#1 < 100); 1333#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1332#L10-2 assume !!(main_~i~0#1 < 100); 1334#L10 [2023-02-16 04:33:20,423 INFO L750 eck$LassoCheckResult]: Loop: 1334#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1335#L10-2 assume !!(main_~i~0#1 < 100); 1333#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1332#L10-2 assume !!(main_~i~0#1 < 100); 1334#L10 [2023-02-16 04:33:20,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:20,423 INFO L85 PathProgramCache]: Analyzing trace with hash -694298463, now seen corresponding path program 4 times [2023-02-16 04:33:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:20,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165143299] [2023-02-16 04:33:20,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:20,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-02-16 04:33:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:20,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:20,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165143299] [2023-02-16 04:33:20,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165143299] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:33:20,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261130525] [2023-02-16 04:33:20,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 04:33:20,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:33:20,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:20,856 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:33:20,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-02-16 04:33:20,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 04:33:20,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:33:20,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 04:33:20,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:20,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:33:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:21,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261130525] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:33:21,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:33:21,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2023-02-16 04:33:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725149115] [2023-02-16 04:33:21,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:33:21,530 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-16 04:33:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:21,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2023-02-16 04:33:21,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:21,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179014617] [2023-02-16 04:33:21,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:21,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:21,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:21,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:21,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:33:21,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-16 04:33:21,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2023-02-16 04:33:21,556 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 48 states have internal predecessors, (96), 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) [2023-02-16 04:33:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:33:21,661 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2023-02-16 04:33:21,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2023-02-16 04:33:21,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-16 04:33:21,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2023-02-16 04:33:21,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-16 04:33:21,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-16 04:33:21,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2023-02-16 04:33:21,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:21,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2023-02-16 04:33:21,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2023-02-16 04:33:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2023-02-16 04:33:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 97 states have internal predecessors, (100), 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) [2023-02-16 04:33:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2023-02-16 04:33:21,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2023-02-16 04:33:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-02-16 04:33:21,667 INFO L428 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2023-02-16 04:33:21,667 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-16 04:33:21,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2023-02-16 04:33:21,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-16 04:33:21,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:21,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:21,670 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 46, 1, 1, 1] [2023-02-16 04:33:21,670 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2023-02-16 04:33:21,670 INFO L748 eck$LassoCheckResult]: Stem: 1842#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1843#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 1836#L10-2 assume !!(main_~i~0#1 < 100); 1837#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1840#L10-2 assume !!(main_~i~0#1 < 100); 1841#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1838#L10-2 assume !!(main_~i~0#1 < 100); 1839#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1933#L10-2 assume !!(main_~i~0#1 < 100); 1932#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1931#L10-2 assume !!(main_~i~0#1 < 100); 1930#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1929#L10-2 assume !!(main_~i~0#1 < 100); 1928#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1927#L10-2 assume !!(main_~i~0#1 < 100); 1926#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1925#L10-2 assume !!(main_~i~0#1 < 100); 1924#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1923#L10-2 assume !!(main_~i~0#1 < 100); 1922#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1921#L10-2 assume !!(main_~i~0#1 < 100); 1920#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1919#L10-2 assume !!(main_~i~0#1 < 100); 1918#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1917#L10-2 assume !!(main_~i~0#1 < 100); 1916#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1915#L10-2 assume !!(main_~i~0#1 < 100); 1914#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1913#L10-2 assume !!(main_~i~0#1 < 100); 1912#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1911#L10-2 assume !!(main_~i~0#1 < 100); 1910#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1909#L10-2 assume !!(main_~i~0#1 < 100); 1908#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1907#L10-2 assume !!(main_~i~0#1 < 100); 1906#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1905#L10-2 assume !!(main_~i~0#1 < 100); 1904#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1903#L10-2 assume !!(main_~i~0#1 < 100); 1902#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1901#L10-2 assume !!(main_~i~0#1 < 100); 1900#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1899#L10-2 assume !!(main_~i~0#1 < 100); 1898#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1897#L10-2 assume !!(main_~i~0#1 < 100); 1896#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1895#L10-2 assume !!(main_~i~0#1 < 100); 1894#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1893#L10-2 assume !!(main_~i~0#1 < 100); 1892#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1891#L10-2 assume !!(main_~i~0#1 < 100); 1890#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1889#L10-2 assume !!(main_~i~0#1 < 100); 1888#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1887#L10-2 assume !!(main_~i~0#1 < 100); 1886#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1885#L10-2 assume !!(main_~i~0#1 < 100); 1884#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1883#L10-2 assume !!(main_~i~0#1 < 100); 1882#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1881#L10-2 assume !!(main_~i~0#1 < 100); 1880#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1879#L10-2 assume !!(main_~i~0#1 < 100); 1878#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1877#L10-2 assume !!(main_~i~0#1 < 100); 1876#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1875#L10-2 assume !!(main_~i~0#1 < 100); 1874#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1873#L10-2 assume !!(main_~i~0#1 < 100); 1872#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1871#L10-2 assume !!(main_~i~0#1 < 100); 1870#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1869#L10-2 assume !!(main_~i~0#1 < 100); 1868#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1867#L10-2 assume !!(main_~i~0#1 < 100); 1866#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1865#L10-2 assume !!(main_~i~0#1 < 100); 1864#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1863#L10-2 assume !!(main_~i~0#1 < 100); 1862#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1861#L10-2 assume !!(main_~i~0#1 < 100); 1860#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1859#L10-2 assume !!(main_~i~0#1 < 100); 1858#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1857#L10-2 assume !!(main_~i~0#1 < 100); 1856#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1855#L10-2 assume !!(main_~i~0#1 < 100); 1854#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1853#L10-2 assume !!(main_~i~0#1 < 100); 1852#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1851#L10-2 assume !!(main_~i~0#1 < 100); 1850#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1849#L10-2 assume !!(main_~i~0#1 < 100); 1848#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1847#L10-2 assume !!(main_~i~0#1 < 100); 1845#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1844#L10-2 assume !!(main_~i~0#1 < 100); 1846#L10 [2023-02-16 04:33:21,670 INFO L750 eck$LassoCheckResult]: Loop: 1846#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1847#L10-2 assume !!(main_~i~0#1 < 100); 1845#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1844#L10-2 assume !!(main_~i~0#1 < 100); 1846#L10 [2023-02-16 04:33:21,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:21,670 INFO L85 PathProgramCache]: Analyzing trace with hash -818401447, now seen corresponding path program 5 times [2023-02-16 04:33:21,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:21,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633573965] [2023-02-16 04:33:21,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:21,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:22,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:22,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633573965] [2023-02-16 04:33:22,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633573965] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:33:22,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044100186] [2023-02-16 04:33:22,888 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 04:33:22,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:33:22,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:22,899 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:33:22,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-02-16 04:33:22,947 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2023-02-16 04:33:22,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:33:22,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-16 04:33:22,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:23,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:33:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:23,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044100186] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:33:23,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:33:23,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2023-02-16 04:33:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297969395] [2023-02-16 04:33:23,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:33:23,963 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-16 04:33:23,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:23,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2023-02-16 04:33:23,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:23,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966605820] [2023-02-16 04:33:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:23,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:23,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:23,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:23,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:33:23,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-16 04:33:23,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2023-02-16 04:33:23,989 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 3 Second operand has 52 states, 52 states have (on average 2.019230769230769) internal successors, (105), 52 states have internal predecessors, (105), 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) [2023-02-16 04:33:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:33:24,111 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2023-02-16 04:33:24,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 113 transitions. [2023-02-16 04:33:24,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-16 04:33:24,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 107 states and 109 transitions. [2023-02-16 04:33:24,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-16 04:33:24,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-16 04:33:24,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 109 transitions. [2023-02-16 04:33:24,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:24,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 109 transitions. [2023-02-16 04:33:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 109 transitions. [2023-02-16 04:33:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2023-02-16 04:33:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 105 states have internal predecessors, (108), 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) [2023-02-16 04:33:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2023-02-16 04:33:24,129 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 108 transitions. [2023-02-16 04:33:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-02-16 04:33:24,130 INFO L428 stractBuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2023-02-16 04:33:24,130 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-16 04:33:24,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 108 transitions. [2023-02-16 04:33:24,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-16 04:33:24,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:24,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:24,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [52, 50, 1, 1, 1] [2023-02-16 04:33:24,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2023-02-16 04:33:24,135 INFO L748 eck$LassoCheckResult]: Stem: 2682#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2683#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 2676#L10-2 assume !!(main_~i~0#1 < 100); 2677#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2680#L10-2 assume !!(main_~i~0#1 < 100); 2681#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2678#L10-2 assume !!(main_~i~0#1 < 100); 2679#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2781#L10-2 assume !!(main_~i~0#1 < 100); 2780#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2779#L10-2 assume !!(main_~i~0#1 < 100); 2778#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2777#L10-2 assume !!(main_~i~0#1 < 100); 2776#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2775#L10-2 assume !!(main_~i~0#1 < 100); 2774#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2773#L10-2 assume !!(main_~i~0#1 < 100); 2772#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2771#L10-2 assume !!(main_~i~0#1 < 100); 2770#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2769#L10-2 assume !!(main_~i~0#1 < 100); 2768#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2767#L10-2 assume !!(main_~i~0#1 < 100); 2766#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2765#L10-2 assume !!(main_~i~0#1 < 100); 2764#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2763#L10-2 assume !!(main_~i~0#1 < 100); 2762#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2761#L10-2 assume !!(main_~i~0#1 < 100); 2760#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2759#L10-2 assume !!(main_~i~0#1 < 100); 2758#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2757#L10-2 assume !!(main_~i~0#1 < 100); 2756#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2755#L10-2 assume !!(main_~i~0#1 < 100); 2754#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2753#L10-2 assume !!(main_~i~0#1 < 100); 2752#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2751#L10-2 assume !!(main_~i~0#1 < 100); 2750#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2749#L10-2 assume !!(main_~i~0#1 < 100); 2748#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2747#L10-2 assume !!(main_~i~0#1 < 100); 2746#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2745#L10-2 assume !!(main_~i~0#1 < 100); 2744#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2743#L10-2 assume !!(main_~i~0#1 < 100); 2742#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2741#L10-2 assume !!(main_~i~0#1 < 100); 2740#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2739#L10-2 assume !!(main_~i~0#1 < 100); 2738#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2737#L10-2 assume !!(main_~i~0#1 < 100); 2736#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2735#L10-2 assume !!(main_~i~0#1 < 100); 2734#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2733#L10-2 assume !!(main_~i~0#1 < 100); 2732#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2731#L10-2 assume !!(main_~i~0#1 < 100); 2730#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2729#L10-2 assume !!(main_~i~0#1 < 100); 2728#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2727#L10-2 assume !!(main_~i~0#1 < 100); 2726#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2725#L10-2 assume !!(main_~i~0#1 < 100); 2724#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2723#L10-2 assume !!(main_~i~0#1 < 100); 2722#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2721#L10-2 assume !!(main_~i~0#1 < 100); 2720#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2719#L10-2 assume !!(main_~i~0#1 < 100); 2718#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2717#L10-2 assume !!(main_~i~0#1 < 100); 2716#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2715#L10-2 assume !!(main_~i~0#1 < 100); 2714#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2713#L10-2 assume !!(main_~i~0#1 < 100); 2712#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2711#L10-2 assume !!(main_~i~0#1 < 100); 2710#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2709#L10-2 assume !!(main_~i~0#1 < 100); 2708#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2707#L10-2 assume !!(main_~i~0#1 < 100); 2706#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2705#L10-2 assume !!(main_~i~0#1 < 100); 2704#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2703#L10-2 assume !!(main_~i~0#1 < 100); 2702#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2701#L10-2 assume !!(main_~i~0#1 < 100); 2700#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2699#L10-2 assume !!(main_~i~0#1 < 100); 2698#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2697#L10-2 assume !!(main_~i~0#1 < 100); 2696#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2695#L10-2 assume !!(main_~i~0#1 < 100); 2694#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2693#L10-2 assume !!(main_~i~0#1 < 100); 2692#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2691#L10-2 assume !!(main_~i~0#1 < 100); 2690#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2689#L10-2 assume !!(main_~i~0#1 < 100); 2688#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2687#L10-2 assume !!(main_~i~0#1 < 100); 2685#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 2684#L10-2 assume !!(main_~i~0#1 < 100); 2686#L10 [2023-02-16 04:33:24,136 INFO L750 eck$LassoCheckResult]: Loop: 2686#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2687#L10-2 assume !!(main_~i~0#1 < 100); 2685#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 2684#L10-2 assume !!(main_~i~0#1 < 100); 2686#L10 [2023-02-16 04:33:24,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:24,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1468745677, now seen corresponding path program 6 times [2023-02-16 04:33:24,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:24,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748543035] [2023-02-16 04:33:24,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:24,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:24,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:24,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:24,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2023-02-16 04:33:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:24,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72727059] [2023-02-16 04:33:24,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:24,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:24,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:24,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:24,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1914756667, now seen corresponding path program 7 times [2023-02-16 04:33:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:24,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746964981] [2023-02-16 04:33:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:24,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:24,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:25,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:25,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.02 04:33:25 BoogieIcfgContainer [2023-02-16 04:33:25,212 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-16 04:33:25,213 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 04:33:25,213 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 04:33:25,213 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 04:33:25,213 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:33:16" (3/4) ... [2023-02-16 04:33:25,224 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-16 04:33:25,268 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 04:33:25,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 04:33:25,271 INFO L158 Benchmark]: Toolchain (without parser) took 8854.26ms. Allocated memory was 109.1MB in the beginning and 232.8MB in the end (delta: 123.7MB). Free memory was 70.0MB in the beginning and 140.9MB in the end (delta: -70.9MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2023-02-16 04:33:25,271 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory was 77.9MB in the beginning and 77.8MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:33:25,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 149.60ms. Allocated memory is still 109.1MB. Free memory was 70.0MB in the beginning and 61.2MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 04:33:25,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.77ms. Allocated memory is still 109.1MB. Free memory was 60.9MB in the beginning and 59.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:33:25,272 INFO L158 Benchmark]: Boogie Preprocessor took 9.93ms. Allocated memory is still 109.1MB. Free memory was 59.5MB in the beginning and 58.8MB in the end (delta: 761.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:33:25,272 INFO L158 Benchmark]: RCFGBuilder took 183.12ms. Allocated memory is still 109.1MB. Free memory was 58.8MB in the beginning and 50.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 04:33:25,273 INFO L158 Benchmark]: BuchiAutomizer took 8431.64ms. Allocated memory was 109.1MB in the beginning and 232.8MB in the end (delta: 123.7MB). Free memory was 50.7MB in the beginning and 144.0MB in the end (delta: -93.3MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2023-02-16 04:33:25,273 INFO L158 Benchmark]: Witness Printer took 57.95ms. Allocated memory is still 232.8MB. Free memory was 144.0MB in the beginning and 140.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:33:25,274 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory was 77.9MB in the beginning and 77.8MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 149.60ms. Allocated memory is still 109.1MB. Free memory was 70.0MB in the beginning and 61.2MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.77ms. Allocated memory is still 109.1MB. Free memory was 60.9MB in the beginning and 59.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 9.93ms. Allocated memory is still 109.1MB. Free memory was 59.5MB in the beginning and 58.8MB in the end (delta: 761.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 183.12ms. Allocated memory is still 109.1MB. Free memory was 58.8MB in the beginning and 50.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 8431.64ms. Allocated memory was 109.1MB in the beginning and 232.8MB in the end (delta: 123.7MB). Free memory was 50.7MB in the beginning and 144.0MB in the end (delta: -93.3MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * Witness Printer took 57.95ms. Allocated memory is still 232.8MB. Free memory was 144.0MB in the beginning and 140.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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 11 terminating modules (6 trivial, 3 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 99 and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 99 and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 52 locations. The remainder module has 106 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 8 iterations. TraceHistogramMax:52. Analysis of lassos took 7.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 350 IncrementalHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 54 mSDtfsCounter, 350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN2 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax199 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq149 hnf94 smp100 dnf100 smp100 tf111 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 10]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] i = 0 VAL [i=0] [L9] COND TRUE i < 100 VAL [i=0] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=1] [L9] COND TRUE i < 100 VAL [i=1] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=2] [L9] COND TRUE i < 100 VAL [i=2] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=3] [L9] COND TRUE i < 100 VAL [i=3] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=4] [L9] COND TRUE i < 100 VAL [i=4] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=5] [L9] COND TRUE i < 100 VAL [i=5] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=6] [L9] COND TRUE i < 100 VAL [i=6] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=7] [L9] COND TRUE i < 100 VAL [i=7] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=8] [L9] COND TRUE i < 100 VAL [i=8] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=9] [L9] COND TRUE i < 100 VAL [i=9] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=10] [L9] COND TRUE i < 100 VAL [i=10] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=11] [L9] COND TRUE i < 100 VAL [i=11] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=12] [L9] COND TRUE i < 100 VAL [i=12] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=13] [L9] COND TRUE i < 100 VAL [i=13] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=14] [L9] COND TRUE i < 100 VAL [i=14] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=15] [L9] COND TRUE i < 100 VAL [i=15] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=16] [L9] COND TRUE i < 100 VAL [i=16] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=17] [L9] COND TRUE i < 100 VAL [i=17] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=18] [L9] COND TRUE i < 100 VAL [i=18] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=19] [L9] COND TRUE i < 100 VAL [i=19] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=20] [L9] COND TRUE i < 100 VAL [i=20] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=21] [L9] COND TRUE i < 100 VAL [i=21] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=22] [L9] COND TRUE i < 100 VAL [i=22] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=23] [L9] COND TRUE i < 100 VAL [i=23] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=24] [L9] COND TRUE i < 100 VAL [i=24] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=25] [L9] COND TRUE i < 100 VAL [i=25] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=26] [L9] COND TRUE i < 100 VAL [i=26] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=27] [L9] COND TRUE i < 100 VAL [i=27] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=28] [L9] COND TRUE i < 100 VAL [i=28] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=29] [L9] COND TRUE i < 100 VAL [i=29] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=30] [L9] COND TRUE i < 100 VAL [i=30] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=31] [L9] COND TRUE i < 100 VAL [i=31] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=32] [L9] COND TRUE i < 100 VAL [i=32] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=33] [L9] COND TRUE i < 100 VAL [i=33] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=34] [L9] COND TRUE i < 100 VAL [i=34] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=35] [L9] COND TRUE i < 100 VAL [i=35] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=36] [L9] COND TRUE i < 100 VAL [i=36] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=37] [L9] COND TRUE i < 100 VAL [i=37] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=38] [L9] COND TRUE i < 100 VAL [i=38] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=39] [L9] COND TRUE i < 100 VAL [i=39] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=40] [L9] COND TRUE i < 100 VAL [i=40] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=41] [L9] COND TRUE i < 100 VAL [i=41] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=42] [L9] COND TRUE i < 100 VAL [i=42] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=43] [L9] COND TRUE i < 100 VAL [i=43] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=44] [L9] COND TRUE i < 100 VAL [i=44] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=45] [L9] COND TRUE i < 100 VAL [i=45] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=46] [L9] COND TRUE i < 100 VAL [i=46] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=47] [L9] COND TRUE i < 100 VAL [i=47] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=48] [L9] COND TRUE i < 100 VAL [i=48] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=50] [L9] COND TRUE i < 100 VAL [i=50] [L10] COND FALSE !(i < 50) [L11] i = i-1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] Loop: [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 VAL [i=0] [L9] COND TRUE i < 100 VAL [i=0] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=1] [L9] COND TRUE i < 100 VAL [i=1] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=2] [L9] COND TRUE i < 100 VAL [i=2] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=3] [L9] COND TRUE i < 100 VAL [i=3] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=4] [L9] COND TRUE i < 100 VAL [i=4] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=5] [L9] COND TRUE i < 100 VAL [i=5] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=6] [L9] COND TRUE i < 100 VAL [i=6] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=7] [L9] COND TRUE i < 100 VAL [i=7] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=8] [L9] COND TRUE i < 100 VAL [i=8] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=9] [L9] COND TRUE i < 100 VAL [i=9] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=10] [L9] COND TRUE i < 100 VAL [i=10] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=11] [L9] COND TRUE i < 100 VAL [i=11] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=12] [L9] COND TRUE i < 100 VAL [i=12] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=13] [L9] COND TRUE i < 100 VAL [i=13] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=14] [L9] COND TRUE i < 100 VAL [i=14] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=15] [L9] COND TRUE i < 100 VAL [i=15] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=16] [L9] COND TRUE i < 100 VAL [i=16] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=17] [L9] COND TRUE i < 100 VAL [i=17] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=18] [L9] COND TRUE i < 100 VAL [i=18] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=19] [L9] COND TRUE i < 100 VAL [i=19] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=20] [L9] COND TRUE i < 100 VAL [i=20] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=21] [L9] COND TRUE i < 100 VAL [i=21] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=22] [L9] COND TRUE i < 100 VAL [i=22] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=23] [L9] COND TRUE i < 100 VAL [i=23] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=24] [L9] COND TRUE i < 100 VAL [i=24] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=25] [L9] COND TRUE i < 100 VAL [i=25] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=26] [L9] COND TRUE i < 100 VAL [i=26] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=27] [L9] COND TRUE i < 100 VAL [i=27] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=28] [L9] COND TRUE i < 100 VAL [i=28] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=29] [L9] COND TRUE i < 100 VAL [i=29] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=30] [L9] COND TRUE i < 100 VAL [i=30] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=31] [L9] COND TRUE i < 100 VAL [i=31] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=32] [L9] COND TRUE i < 100 VAL [i=32] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=33] [L9] COND TRUE i < 100 VAL [i=33] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=34] [L9] COND TRUE i < 100 VAL [i=34] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=35] [L9] COND TRUE i < 100 VAL [i=35] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=36] [L9] COND TRUE i < 100 VAL [i=36] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=37] [L9] COND TRUE i < 100 VAL [i=37] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=38] [L9] COND TRUE i < 100 VAL [i=38] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=39] [L9] COND TRUE i < 100 VAL [i=39] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=40] [L9] COND TRUE i < 100 VAL [i=40] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=41] [L9] COND TRUE i < 100 VAL [i=41] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=42] [L9] COND TRUE i < 100 VAL [i=42] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=43] [L9] COND TRUE i < 100 VAL [i=43] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=44] [L9] COND TRUE i < 100 VAL [i=44] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=45] [L9] COND TRUE i < 100 VAL [i=45] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=46] [L9] COND TRUE i < 100 VAL [i=46] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=47] [L9] COND TRUE i < 100 VAL [i=47] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=48] [L9] COND TRUE i < 100 VAL [i=48] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=50] [L9] COND TRUE i < 100 VAL [i=50] [L10] COND FALSE !(i < 50) [L11] i = i-1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] Loop: [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-02-16 04:33:25,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:25,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:25,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:25,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-02-16 04:33:26,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-16 04:33:26,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)