./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 a31fd051 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-?-a31fd05 [2023-02-15 14:15:45,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 14:15:45,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 14:15:45,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 14:15:45,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 14:15:46,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 14:15:46,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 14:15:46,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 14:15:46,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 14:15:46,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 14:15:46,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 14:15:46,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 14:15:46,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 14:15:46,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 14:15:46,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 14:15:46,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 14:15:46,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 14:15:46,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 14:15:46,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 14:15:46,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 14:15:46,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 14:15:46,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 14:15:46,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 14:15:46,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 14:15:46,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 14:15:46,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 14:15:46,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 14:15:46,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 14:15:46,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 14:15:46,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 14:15:46,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 14:15:46,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 14:15:46,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 14:15:46,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 14:15:46,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 14:15:46,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 14:15:46,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 14:15:46,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 14:15:46,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 14:15:46,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 14:15:46,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 14:15:46,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 14:15:46,066 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 14:15:46,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 14:15:46,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 14:15:46,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 14:15:46,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 14:15:46,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 14:15:46,076 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 14:15:46,076 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 14:15:46,076 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 14:15:46,076 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 14:15:46,077 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 14:15:46,077 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 14:15:46,077 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 14:15:46,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 14:15:46,078 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 14:15:46,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 14:15:46,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 14:15:46,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 14:15:46,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 14:15:46,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 14:15:46,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 14:15:46,079 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 14:15:46,079 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 14:15:46,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 14:15:46,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 14:15:46,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 14:15:46,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 14:15:46,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 14:15:46,081 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 14:15:46,081 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-15 14:15:46,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 14:15:46,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 14:15:46,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 14:15:46,255 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 14:15:46,255 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 14:15:46,256 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-15 14:15:47,328 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 14:15:47,437 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 14:15:47,437 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_22.c [2023-02-15 14:15:47,442 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85b5ec4a4/aacb0bfe5a2d4500a4e26ebbb01733a3/FLAG2ef42927c [2023-02-15 14:15:47,454 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85b5ec4a4/aacb0bfe5a2d4500a4e26ebbb01733a3 [2023-02-15 14:15:47,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 14:15:47,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 14:15:47,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 14:15:47,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 14:15:47,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 14:15:47,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:15:47" (1/1) ... [2023-02-15 14:15:47,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a36fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47, skipping insertion in model container [2023-02-15 14:15:47,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:15:47" (1/1) ... [2023-02-15 14:15:47,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 14:15:47,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 14:15:47,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:15:47,564 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 14:15:47,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:15:47,580 INFO L208 MainTranslator]: Completed translation [2023-02-15 14:15:47,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47 WrapperNode [2023-02-15 14:15:47,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 14:15:47,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 14:15:47,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 14:15:47,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 14:15:47,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47" (1/1) ... [2023-02-15 14:15:47,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47" (1/1) ... [2023-02-15 14:15:47,601 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2023-02-15 14:15:47,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 14:15:47,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 14:15:47,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 14:15:47,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 14:15:47,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47" (1/1) ... [2023-02-15 14:15:47,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47" (1/1) ... [2023-02-15 14:15:47,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47" (1/1) ... [2023-02-15 14:15:47,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47" (1/1) ... [2023-02-15 14:15:47,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47" (1/1) ... [2023-02-15 14:15:47,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47" (1/1) ... [2023-02-15 14:15:47,612 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47" (1/1) ... [2023-02-15 14:15:47,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47" (1/1) ... [2023-02-15 14:15:47,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 14:15:47,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 14:15:47,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 14:15:47,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 14:15:47,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47" (1/1) ... [2023-02-15 14:15:47,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:47,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:47,644 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-15 14:15:47,647 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-15 14:15:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 14:15:47,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 14:15:47,753 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 14:15:47,755 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 14:15:47,823 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 14:15:47,827 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 14:15:47,827 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 14:15:47,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:15:47 BoogieIcfgContainer [2023-02-15 14:15:47,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 14:15:47,829 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 14:15:47,829 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 14:15:47,832 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 14:15:47,832 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:15:47,832 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 02:15:47" (1/3) ... [2023-02-15 14:15:47,833 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a27d593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:15:47, skipping insertion in model container [2023-02-15 14:15:47,833 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:15:47,833 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:47" (2/3) ... [2023-02-15 14:15:47,833 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a27d593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:15:47, skipping insertion in model container [2023-02-15 14:15:47,833 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:15:47,833 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:15:47" (3/3) ... [2023-02-15 14:15:47,834 INFO L332 chiAutomizerObserver]: Analyzing ICFG NO_22.c [2023-02-15 14:15:47,868 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 14:15:47,868 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 14:15:47,868 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 14:15:47,868 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 14:15:47,869 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 14:15:47,869 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 14:15:47,869 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 14:15:47,869 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 14:15:47,872 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-15 14:15:47,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:47,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:47,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:47,885 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 14:15:47,885 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 14:15:47,885 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 14:15:47,886 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-15 14:15:47,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:47,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:47,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:47,886 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 14:15:47,886 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 14:15:47,891 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-15 14:15:47,891 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-15 14:15:47,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:47,895 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-15 14:15:47,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:47,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181559470] [2023-02-15 14:15:47,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:47,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:47,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:47,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:47,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2023-02-15 14:15:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:47,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799879008] [2023-02-15 14:15:47,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:47,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:47,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:47,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:47,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:47,979 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2023-02-15 14:15:47,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:47,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021526017] [2023-02-15 14:15:47,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:47,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:48,041 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-15 14:15:48,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:48,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021526017] [2023-02-15 14:15:48,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021526017] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:15:48,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:15:48,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 14:15:48,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608049454] [2023-02-15 14:15:48,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:15:48,072 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:48,073 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:48,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:48,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:48,073 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:48,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:48,074 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:48,074 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2023-02-15 14:15:48,074 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:48,074 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:48,090 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-15 14:15:48,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-15 14:15:48,118 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-15 14:15:48,197 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:48,197 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:48,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,237 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-15 14:15:48,263 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-15 14:15:48,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:48,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:48,290 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:48,291 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-15 14:15:48,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-02-15 14:15:48,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,299 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-15 14:15:48,312 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-15 14:15:48,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:48,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:48,339 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:48,339 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-15 14:15:48,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:48,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,345 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-15 14:15:48,347 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-15 14:15:48,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:48,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:48,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-15 14:15:48,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,392 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-15 14:15:48,394 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-15 14:15:48,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:48,396 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:48,422 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:48,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-02-15 14:15:48,428 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:48,428 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:48,429 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:48,429 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:48,429 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:48,429 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,429 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:48,429 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:48,429 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2023-02-15 14:15:48,429 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:48,429 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:48,432 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-15 14:15:48,437 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-15 14:15:48,442 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-15 14:15:48,492 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:48,496 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:48,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,499 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-15 14:15:48,501 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-15 14:15:48,502 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-15 14:15:48,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:48,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:48,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:48,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:48,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:48,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:48,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:48,550 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-15 14:15:48,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,552 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-15 14:15:48,554 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-15 14:15:48,556 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-15 14:15:48,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:48,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:48,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:48,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:48,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:48,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:48,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:48,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-02-15 14:15:48,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,599 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-15 14:15:48,601 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-15 14:15:48,602 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-15 14:15:48,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:48,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:48,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:48,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:48,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:48,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:48,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:48,629 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:48,632 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:48,632 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:48,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,675 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-15 14:15:48,676 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-15 14:15:48,677 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:48,677 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:48,677 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:48,677 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-15 14:15:48,680 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-15 14:15:48,683 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:48,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:48,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:48,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:48,719 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:48,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:48,723 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-15 14:15:48,758 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-15 14:15:48,760 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-15 14:15:48,789 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-15 14:15:48,791 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-15 14:15:48,798 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-15 14:15:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2023-02-15 14:15:48,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 2 letters. [2023-02-15 14:15:48,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:48,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 2 letters. [2023-02-15 14:15:48,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:48,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 4 letters. [2023-02-15 14:15:48,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:48,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2023-02-15 14:15:48,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:48,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2023-02-15 14:15:48,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-15 14:15:48,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-15 14:15:48,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2023-02-15 14:15:48,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:48,807 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-15 14:15:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2023-02-15 14:15:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-02-15 14:15:48,823 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-15 14:15:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2023-02-15 14:15:48,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-15 14:15:48,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:48,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 14:15:48,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 14:15:48,827 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-15 14:15:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:48,835 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2023-02-15 14:15:48,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2023-02-15 14:15:48,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:48,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2023-02-15 14:15:48,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-02-15 14:15:48,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-15 14:15:48,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2023-02-15 14:15:48,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:15:48,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2023-02-15 14:15:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2023-02-15 14:15:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2023-02-15 14:15:48,838 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-15 14:15:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2023-02-15 14:15:48,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2023-02-15 14:15:48,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 14:15:48,839 INFO L428 stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2023-02-15 14:15:48,840 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 14:15:48,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2023-02-15 14:15:48,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:48,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:48,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:48,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 14:15:48,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 14:15:48,844 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-15 14:15:48,844 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-15 14:15:48,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2023-02-15 14:15:48,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:48,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586135684] [2023-02-15 14:15:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:48,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:48,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:48,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:48,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2023-02-15 14:15:48,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:48,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607770181] [2023-02-15 14:15:48,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:48,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:48,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:48,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:48,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:48,895 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2023-02-15 14:15:48,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:48,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112953877] [2023-02-15 14:15:48,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:48,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:48,933 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-15 14:15:48,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:48,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112953877] [2023-02-15 14:15:48,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112953877] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:48,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732307547] [2023-02-15 14:15:48,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:48,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:48,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,951 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-15 14:15:48,952 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-15 14:15:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:48,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 14:15:48,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:49,002 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-15 14:15:49,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:49,023 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-15 14:15:49,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732307547] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:49,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:49,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-15 14:15:49,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835516225] [2023-02-15 14:15:49,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:49,043 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:49,043 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:49,044 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:49,044 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:49,044 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:49,044 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,044 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:49,044 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:49,044 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2023-02-15 14:15:49,044 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:49,044 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:49,047 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-15 14:15:49,051 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-15 14:15:49,053 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-15 14:15:49,081 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:49,081 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:49,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,109 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-15 14:15:49,110 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-15 14:15:49,111 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:49,111 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:49,141 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:49,141 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-15 14:15:49,146 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-15 14:15:49,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,147 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-15 14:15:49,154 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-15 14:15:49,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:49,155 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:49,166 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:49,166 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-15 14:15:49,169 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-15 14:15:49,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,171 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-15 14:15:49,171 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-15 14:15:49,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:49,175 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:49,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-02-15 14:15:49,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,220 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-15 14:15:49,222 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-15 14:15:49,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:49,223 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:49,263 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:49,267 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-15 14:15:49,267 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:49,267 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:49,268 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:49,268 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:49,268 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:49,268 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,268 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:49,268 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:49,268 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2023-02-15 14:15:49,268 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:49,268 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:49,269 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-15 14:15:49,272 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-15 14:15:49,277 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-15 14:15:49,306 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:49,307 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:49,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,314 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-15 14:15:49,314 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-15 14:15:49,317 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-15 14:15:49,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:49,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:49,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:49,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:49,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:49,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:49,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:49,340 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-15 14:15:49,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,342 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-15 14:15:49,372 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-15 14:15:49,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:49,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:49,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:49,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:49,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:49,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:49,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:49,380 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-15 14:15:49,392 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:49,417 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:49,417 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:49,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,420 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-15 14:15:49,444 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:49,444 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:49,444 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:49,444 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-15 14:15:49,447 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-15 14:15:49,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-02-15 14:15:49,464 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:49,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:49,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:49,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:49,489 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:49,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:49,492 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-15 14:15:49,492 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-15 14:15:49,492 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-15 14:15:49,506 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-15 14:15:49,506 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-15 14:15:49,508 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-15 14:15:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2023-02-15 14:15:49,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2023-02-15 14:15:49,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:49,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2023-02-15 14:15:49,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:49,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2023-02-15 14:15:49,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:49,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2023-02-15 14:15:49,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:49,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2023-02-15 14:15:49,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-02-15 14:15:49,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-15 14:15:49,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2023-02-15 14:15:49,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:49,511 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2023-02-15 14:15:49,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2023-02-15 14:15:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-02-15 14:15:49,513 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-15 14:15:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2023-02-15 14:15:49,513 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2023-02-15 14:15:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:49,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 14:15:49,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:15:49,515 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-15 14:15:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:49,530 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2023-02-15 14:15:49,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2023-02-15 14:15:49,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:49,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2023-02-15 14:15:49,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-02-15 14:15:49,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-02-15 14:15:49,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2023-02-15 14:15:49,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:15:49,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-02-15 14:15:49,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2023-02-15 14:15:49,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-02-15 14:15:49,532 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-15 14:15:49,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-02-15 14:15:49,532 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-02-15 14:15:49,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 14:15:49,533 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-02-15 14:15:49,533 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 14:15:49,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2023-02-15 14:15:49,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:49,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:49,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:49,534 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1] [2023-02-15 14:15:49,534 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 14:15:49,535 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-15 14:15:49,535 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-15 14:15:49,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:49,535 INFO L85 PathProgramCache]: Analyzing trace with hash 742492623, now seen corresponding path program 2 times [2023-02-15 14:15:49,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:49,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088566403] [2023-02-15 14:15:49,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:49,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:49,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:49,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:49,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2023-02-15 14:15:49,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:49,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781465167] [2023-02-15 14:15:49,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:49,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:49,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:49,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:49,555 INFO L85 PathProgramCache]: Analyzing trace with hash 570839924, now seen corresponding path program 2 times [2023-02-15 14:15:49,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:49,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749545673] [2023-02-15 14:15:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:49,607 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-15 14:15:49,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:49,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749545673] [2023-02-15 14:15:49,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749545673] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:49,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888825214] [2023-02-15 14:15:49,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:15:49,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:49,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,629 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-15 14:15:49,660 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-15 14:15:49,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:15:49,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:49,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:15:49,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:49,697 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-15 14:15:49,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:49,743 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-15 14:15:49,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888825214] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:49,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:49,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-02-15 14:15:49,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686637890] [2023-02-15 14:15:49,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:49,755 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:49,755 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:49,755 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:49,755 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:49,755 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:49,755 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,755 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:49,755 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:49,756 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2023-02-15 14:15:49,756 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:49,756 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:49,756 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-15 14:15:49,761 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-15 14:15:49,764 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-15 14:15:49,787 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:49,787 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:49,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,803 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-15 14:15:49,804 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-15 14:15:49,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:49,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:49,849 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-15 14:15:49,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,866 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-15 14:15:49,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:49,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:49,897 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-15 14:15:49,905 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:49,910 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-15 14:15:49,910 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:49,911 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:49,911 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:49,911 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:49,911 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:49,911 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,911 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:49,911 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:49,911 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2023-02-15 14:15:49,911 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:49,911 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:49,912 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-15 14:15:49,918 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-15 14:15:49,920 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-15 14:15:49,948 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:49,948 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:49,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,950 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-15 14:15:49,965 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-15 14:15:49,965 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-15 14:15:49,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:49,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:49,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:49,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:49,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:49,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:49,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:49,988 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:49,990 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:49,991 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:49,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,993 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-15 14:15:49,994 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-15 14:15:49,995 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:49,995 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:49,995 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:49,995 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-15 14:15:50,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-02-15 14:15:50,001 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,038 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,039 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-15 14:15:50,040 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-15 14:15:50,040 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-15 14:15:50,044 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-15 14:15:50,045 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-15 14:15:50,045 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-15 14:15:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2023-02-15 14:15:50,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2023-02-15 14:15:50,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:50,045 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:50,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,074 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,076 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-15 14:15:50,076 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-15 14:15:50,076 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-15 14:15:50,080 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-15 14:15:50,080 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-15 14:15:50,080 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-15 14:15:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2023-02-15 14:15:50,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2023-02-15 14:15:50,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:50,081 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:50,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,108 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,111 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-15 14:15:50,112 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-15 14:15:50,112 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-15 14:15:50,120 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-15 14:15:50,121 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-15 14:15:50,121 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-15 14:15:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2023-02-15 14:15:50,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2023-02-15 14:15:50,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:50,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2023-02-15 14:15:50,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:50,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2023-02-15 14:15:50,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:50,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2023-02-15 14:15:50,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:15:50,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2023-02-15 14:15:50,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-15 14:15:50,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-02-15 14:15:50,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2023-02-15 14:15:50,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:50,140 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-02-15 14:15:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2023-02-15 14:15:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2023-02-15 14:15:50,146 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-15 14:15:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-02-15 14:15:50,146 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-02-15 14:15:50,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:50,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 14:15:50,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-15 14:15:50,147 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-15 14:15:50,151 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-15 14:15:50,156 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-15 14:15:50,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-02-15 14:15:50,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:50,202 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-02-15 14:15:50,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2023-02-15 14:15:50,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:15:50,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2023-02-15 14:15:50,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-02-15 14:15:50,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-02-15 14:15:50,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2023-02-15 14:15:50,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:50,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-02-15 14:15:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2023-02-15 14:15:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-02-15 14:15:50,204 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-15 14:15:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-02-15 14:15:50,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-02-15 14:15:50,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 14:15:50,205 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-02-15 14:15:50,205 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 14:15:50,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2023-02-15 14:15:50,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:15:50,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:50,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:50,206 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1] [2023-02-15 14:15:50,206 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 14:15:50,206 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-15 14:15:50,206 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-15 14:15:50,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,207 INFO L85 PathProgramCache]: Analyzing trace with hash -926509747, now seen corresponding path program 3 times [2023-02-15 14:15:50,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:50,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795125520] [2023-02-15 14:15:50,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:50,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:50,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2023-02-15 14:15:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:50,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008410969] [2023-02-15 14:15:50,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:50,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:50,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636150, now seen corresponding path program 4 times [2023-02-15 14:15:50,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:50,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109873988] [2023-02-15 14:15:50,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:50,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:50,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:50,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:50,247 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:50,247 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:50,247 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:50,247 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:50,247 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:50,247 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,247 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:50,247 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:50,247 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2023-02-15 14:15:50,247 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:50,247 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:50,248 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-15 14:15:50,251 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-15 14:15:50,253 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-15 14:15:50,275 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:50,275 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:50,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:50,276 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-15 14:15:50,278 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-15 14:15:50,280 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:50,280 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:50,323 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-15 14:15:50,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:50,325 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-15 14:15:50,327 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-15 14:15:50,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:50,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:50,349 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:50,375 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-15 14:15:50,376 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:50,376 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:50,376 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:50,376 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:50,376 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:50,376 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,376 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:50,376 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:50,376 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2023-02-15 14:15:50,376 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:50,376 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:50,377 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-15 14:15:50,381 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-15 14:15:50,383 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-15 14:15:50,408 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:50,409 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:50,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:50,410 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-15 14:15:50,412 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-15 14:15:50,413 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-15 14:15:50,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:50,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:50,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:50,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:50,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:50,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:50,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:50,436 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:50,445 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:50,445 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:15:50,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:50,461 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-15 14:15:50,464 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:50,464 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:50,464 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:50,464 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-15 14:15:50,468 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-15 14:15:50,483 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-15 14:15:50,484 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,532 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,545 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-15 14:15:50,545 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-15 14:15:50,545 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-15 14:15:50,553 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-15 14:15:50,553 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-15 14:15:50,553 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-15 14:15:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2023-02-15 14:15:50,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 2 letters. [2023-02-15 14:15:50,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:50,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 23 letters. Loop has 2 letters. [2023-02-15 14:15:50,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:50,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 4 letters. [2023-02-15 14:15:50,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:50,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2023-02-15 14:15:50,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:15:50,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 31 transitions. [2023-02-15 14:15:50,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-02-15 14:15:50,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-15 14:15:50,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2023-02-15 14:15:50,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:50,555 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-02-15 14:15:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2023-02-15 14:15:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-02-15 14:15:50,557 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-15 14:15:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-15 14:15:50,557 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-15 14:15:50,557 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-15 14:15:50,557 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-15 14:15:50,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2023-02-15 14:15:50,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:15:50,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:50,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:50,558 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2023-02-15 14:15:50,558 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 14:15:50,558 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-15 14:15:50,558 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-15 14:15:50,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,558 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 3 times [2023-02-15 14:15:50,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:50,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316825728] [2023-02-15 14:15:50,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:50,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,725 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-15 14:15:50,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:50,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316825728] [2023-02-15 14:15:50,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316825728] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:50,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262722952] [2023-02-15 14:15:50,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 14:15:50,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:50,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:50,729 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-15 14:15:50,730 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-15 14:15:50,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-02-15 14:15:50,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:50,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,794 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-15 14:15:50,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:50,933 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-15 14:15:50,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262722952] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:50,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:50,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2023-02-15 14:15:50,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243700648] [2023-02-15 14:15:50,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:50,934 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:50,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2023-02-15 14:15:50,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:50,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114233862] [2023-02-15 14:15:50,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:50,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:50,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:50,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:50,947 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:50,948 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:50,948 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:50,948 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:50,948 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:50,948 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,948 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:50,948 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:50,948 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2023-02-15 14:15:50,948 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:50,948 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:50,949 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-15 14:15:50,953 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-15 14:15:50,954 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-15 14:15:50,975 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:50,975 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:50,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:50,994 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-15 14:15:51,008 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:51,008 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:51,017 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-15 14:15:51,057 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-15 14:15:51,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:51,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:51,067 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-15 14:15:51,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:51,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:51,092 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-15 14:15:51,093 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:51,098 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-15 14:15:51,099 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:51,099 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:51,099 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:51,099 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:51,099 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:51,099 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:51,099 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:51,099 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:51,099 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2023-02-15 14:15:51,099 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:51,099 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:51,100 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-15 14:15:51,117 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-15 14:15:51,119 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-15 14:15:51,139 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:51,139 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:51,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:51,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:51,156 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-15 14:15:51,157 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-15 14:15:51,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:51,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:51,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:51,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:51,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:51,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:51,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:51,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:51,176 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:51,178 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:51,178 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:15:51,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:51,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:51,190 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-15 14:15:51,193 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-15 14:15:51,194 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:51,194 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:51,194 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:51,194 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-15 14:15:51,200 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-15 14:15:51,201 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:51,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:51,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:51,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:51,252 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:51,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:51,262 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-15 14:15:51,263 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-15 14:15:51,263 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-15 14:15:51,269 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-15 14:15:51,270 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-15 14:15:51,270 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-15 14:15:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2023-02-15 14:15:51,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 25 letters. Loop has 2 letters. [2023-02-15 14:15:51,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:51,271 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:51,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:51,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:51,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:51,310 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:51,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:51,319 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-15 14:15:51,320 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-15 14:15:51,320 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-15 14:15:51,330 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-15 14:15:51,331 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-15 14:15:51,331 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-15 14:15:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2023-02-15 14:15:51,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 25 letters. Loop has 2 letters. [2023-02-15 14:15:51,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:51,331 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:51,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:51,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:51,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:51,372 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:51,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:51,393 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-15 14:15:51,396 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-15 14:15:51,396 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-15 14:15:51,396 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-15 14:15:51,406 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-15 14:15:51,406 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-15 14:15:51,406 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-15 14:15:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2023-02-15 14:15:51,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 2 letters. [2023-02-15 14:15:51,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:51,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2023-02-15 14:15:51,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:51,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 4 letters. [2023-02-15 14:15:51,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:51,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2023-02-15 14:15:51,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:51,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-15 14:15:51,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2023-02-15 14:15:51,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-15 14:15:51,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-15 14:15:51,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2023-02-15 14:15:51,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:51,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-02-15 14:15:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2023-02-15 14:15:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-02-15 14:15:51,410 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-15 14:15:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-02-15 14:15:51,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-02-15 14:15:51,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:51,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 14:15:51,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2023-02-15 14:15:51,411 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-15 14:15:51,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:51,463 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2023-02-15 14:15:51,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2023-02-15 14:15:51,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 14:15:51,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2023-02-15 14:15:51,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-15 14:15:51,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-15 14:15:51,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2023-02-15 14:15:51,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:51,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2023-02-15 14:15:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2023-02-15 14:15:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-02-15 14:15:51,466 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-15 14:15:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2023-02-15 14:15:51,467 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2023-02-15 14:15:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 14:15:51,467 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2023-02-15 14:15:51,467 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-15 14:15:51,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2023-02-15 14:15:51,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 14:15:51,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:51,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:51,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 22, 1, 1, 1] [2023-02-15 14:15:51,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2023-02-15 14:15:51,469 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-15 14:15:51,469 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-15 14:15:51,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:51,469 INFO L85 PathProgramCache]: Analyzing trace with hash -694298463, now seen corresponding path program 4 times [2023-02-15 14:15:51,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:51,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83730347] [2023-02-15 14:15:51,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:51,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:51,766 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-15 14:15:51,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:51,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83730347] [2023-02-15 14:15:51,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83730347] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:51,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708698021] [2023-02-15 14:15:51,767 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 14:15:51,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:51,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:51,773 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-15 14:15:51,774 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-15 14:15:51,815 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 14:15:51,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:51,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 14:15:51,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:51,872 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-15 14:15:51,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:52,410 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-15 14:15:52,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708698021] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:52,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:52,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2023-02-15 14:15:52,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675884195] [2023-02-15 14:15:52,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:52,411 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:52,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:52,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2023-02-15 14:15:52,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:52,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610750960] [2023-02-15 14:15:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:52,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:52,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:52,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:52,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:52,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-15 14:15:52,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2023-02-15 14:15:52,438 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-15 14:15:52,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:52,538 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2023-02-15 14:15:52,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2023-02-15 14:15:52,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 14:15:52,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2023-02-15 14:15:52,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-15 14:15:52,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-15 14:15:52,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2023-02-15 14:15:52,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:52,540 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2023-02-15 14:15:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2023-02-15 14:15:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2023-02-15 14:15:52,543 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-15 14:15:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2023-02-15 14:15:52,544 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2023-02-15 14:15:52,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-02-15 14:15:52,544 INFO L428 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2023-02-15 14:15:52,544 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-15 14:15:52,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2023-02-15 14:15:52,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 14:15:52,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:52,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:52,547 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 46, 1, 1, 1] [2023-02-15 14:15:52,547 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2023-02-15 14:15:52,547 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-15 14:15:52,547 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-15 14:15:52,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:52,547 INFO L85 PathProgramCache]: Analyzing trace with hash -818401447, now seen corresponding path program 5 times [2023-02-15 14:15:52,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:52,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742483537] [2023-02-15 14:15:52,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:52,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:53,595 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-15 14:15:53,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:53,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742483537] [2023-02-15 14:15:53,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742483537] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:53,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124244498] [2023-02-15 14:15:53,595 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 14:15:53,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:53,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:53,597 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-15 14:15:53,621 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-15 14:15:53,671 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2023-02-15 14:15:53,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:53,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 14:15:53,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:53,837 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-15 14:15:53,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:54,680 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-15 14:15:54,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124244498] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:54,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:54,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2023-02-15 14:15:54,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750169382] [2023-02-15 14:15:54,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:54,681 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2023-02-15 14:15:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:54,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517689184] [2023-02-15 14:15:54,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:54,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:54,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:54,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:54,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 14:15:54,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2023-02-15 14:15:54,704 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-15 14:15:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:54,808 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2023-02-15 14:15:54,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 113 transitions. [2023-02-15 14:15:54,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 14:15:54,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 107 states and 109 transitions. [2023-02-15 14:15:54,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-15 14:15:54,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-15 14:15:54,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 109 transitions. [2023-02-15 14:15:54,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:54,810 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 109 transitions. [2023-02-15 14:15:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 109 transitions. [2023-02-15 14:15:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2023-02-15 14:15:54,813 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-15 14:15:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2023-02-15 14:15:54,813 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 108 transitions. [2023-02-15 14:15:54,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-02-15 14:15:54,823 INFO L428 stractBuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2023-02-15 14:15:54,823 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-15 14:15:54,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 108 transitions. [2023-02-15 14:15:54,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 14:15:54,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:54,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:54,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [52, 50, 1, 1, 1] [2023-02-15 14:15:54,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2023-02-15 14:15:54,825 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-15 14:15:54,825 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-15 14:15:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1468745677, now seen corresponding path program 6 times [2023-02-15 14:15:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:54,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312027941] [2023-02-15 14:15:54,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:54,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:54,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:54,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:54,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:54,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2023-02-15 14:15:54,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:54,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170332265] [2023-02-15 14:15:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:54,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:54,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:54,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:54,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1914756667, now seen corresponding path program 7 times [2023-02-15 14:15:54,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:54,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49115904] [2023-02-15 14:15:54,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:54,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:54,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:54,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:55,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:55,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.02 02:15:55 BoogieIcfgContainer [2023-02-15 14:15:55,876 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-15 14:15:55,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 14:15:55,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 14:15:55,876 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 14:15:55,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:15:47" (3/4) ... [2023-02-15 14:15:55,878 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-15 14:15:55,907 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 14:15:55,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 14:15:55,908 INFO L158 Benchmark]: Toolchain (without parser) took 8451.12ms. Allocated memory was 188.7MB in the beginning and 239.1MB in the end (delta: 50.3MB). Free memory was 149.0MB in the beginning and 78.6MB in the end (delta: 70.5MB). Peak memory consumption was 121.9MB. Max. memory is 16.1GB. [2023-02-15 14:15:55,908 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:15:55,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 123.42ms. Allocated memory is still 188.7MB. Free memory was 149.0MB in the beginning and 140.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 14:15:55,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.77ms. Allocated memory is still 188.7MB. Free memory was 140.1MB in the beginning and 138.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 14:15:55,908 INFO L158 Benchmark]: Boogie Preprocessor took 11.69ms. Allocated memory is still 188.7MB. Free memory was 138.6MB in the beginning and 138.0MB in the end (delta: 553.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:15:55,908 INFO L158 Benchmark]: RCFGBuilder took 214.55ms. Allocated memory is still 188.7MB. Free memory was 138.0MB in the beginning and 129.5MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 14:15:55,909 INFO L158 Benchmark]: BuchiAutomizer took 8046.36ms. Allocated memory was 188.7MB in the beginning and 239.1MB in the end (delta: 50.3MB). Free memory was 129.5MB in the beginning and 81.7MB in the end (delta: 47.8MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. [2023-02-15 14:15:55,909 INFO L158 Benchmark]: Witness Printer took 31.37ms. Allocated memory is still 239.1MB. Free memory was 81.7MB in the beginning and 78.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 14:15:55,910 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 134.2MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 123.42ms. Allocated memory is still 188.7MB. Free memory was 149.0MB in the beginning and 140.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.77ms. Allocated memory is still 188.7MB. Free memory was 140.1MB in the beginning and 138.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.69ms. Allocated memory is still 188.7MB. Free memory was 138.6MB in the beginning and 138.0MB in the end (delta: 553.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 214.55ms. Allocated memory is still 188.7MB. Free memory was 138.0MB in the beginning and 129.5MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 8046.36ms. Allocated memory was 188.7MB in the beginning and 239.1MB in the end (delta: 50.3MB). Free memory was 129.5MB in the beginning and 81.7MB in the end (delta: 47.8MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. * Witness Printer took 31.37ms. Allocated memory is still 239.1MB. Free memory was 81.7MB in the beginning and 78.6MB 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 7.9s and 8 iterations. TraceHistogramMax:52. Analysis of lassos took 6.9s. 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.2s 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 hnf100 smp100 dnf94 smp100 tf111 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms 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-15 14:15:55,938 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-15 14:15:56,141 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-15 14:15:56,348 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-15 14:15:56,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:56,745 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-15 14:15:56,946 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)