./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 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/UpAndDownIneq.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 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 03:09:37,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 03:09:37,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 03:09:37,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 03:09:37,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 03:09:37,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 03:09:37,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 03:09:37,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 03:09:37,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 03:09:37,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 03:09:37,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 03:09:37,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 03:09:37,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 03:09:37,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 03:09:37,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 03:09:37,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 03:09:37,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 03:09:37,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 03:09:37,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 03:09:37,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 03:09:37,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 03:09:37,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 03:09:37,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 03:09:37,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 03:09:37,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 03:09:37,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 03:09:37,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 03:09:37,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 03:09:37,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 03:09:37,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 03:09:37,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 03:09:37,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 03:09:37,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 03:09:37,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 03:09:37,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 03:09:37,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 03:09:37,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 03:09:37,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 03:09:37,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 03:09:37,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 03:09:37,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 03:09:37,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-14 03:09:37,300 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 03:09:37,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 03:09:37,301 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 03:09:37,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 03:09:37,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 03:09:37,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 03:09:37,302 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 03:09:37,302 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-14 03:09:37,302 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-14 03:09:37,303 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-14 03:09:37,303 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-14 03:09:37,303 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-14 03:09:37,303 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-14 03:09:37,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 03:09:37,303 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 03:09:37,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 03:09:37,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 03:09:37,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-14 03:09:37,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-14 03:09:37,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-14 03:09:37,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 03:09:37,311 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-14 03:09:37,311 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 03:09:37,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-14 03:09:37,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 03:09:37,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 03:09:37,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 03:09:37,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 03:09:37,314 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-14 03:09:37,314 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 -> 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 [2023-02-14 03:09:37,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 03:09:37,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 03:09:37,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 03:09:37,589 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 03:09:37,591 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 03:09:37,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2023-02-14 03:09:38,857 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 03:09:39,033 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 03:09:39,034 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2023-02-14 03:09:39,038 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4bb2f39c/bd5f7078cab540829536237ca0578fd6/FLAG09cafb29c [2023-02-14 03:09:39,053 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4bb2f39c/bd5f7078cab540829536237ca0578fd6 [2023-02-14 03:09:39,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 03:09:39,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 03:09:39,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 03:09:39,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 03:09:39,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 03:09:39,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 03:09:39" (1/1) ... [2023-02-14 03:09:39,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f070ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39, skipping insertion in model container [2023-02-14 03:09:39,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 03:09:39" (1/1) ... [2023-02-14 03:09:39,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 03:09:39,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 03:09:39,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 03:09:39,199 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 03:09:39,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 03:09:39,220 INFO L208 MainTranslator]: Completed translation [2023-02-14 03:09:39,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39 WrapperNode [2023-02-14 03:09:39,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 03:09:39,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 03:09:39,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 03:09:39,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 03:09:39,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39" (1/1) ... [2023-02-14 03:09:39,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39" (1/1) ... [2023-02-14 03:09:39,250 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2023-02-14 03:09:39,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 03:09:39,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 03:09:39,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 03:09:39,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 03:09:39,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39" (1/1) ... [2023-02-14 03:09:39,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39" (1/1) ... [2023-02-14 03:09:39,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39" (1/1) ... [2023-02-14 03:09:39,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39" (1/1) ... [2023-02-14 03:09:39,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39" (1/1) ... [2023-02-14 03:09:39,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39" (1/1) ... [2023-02-14 03:09:39,263 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39" (1/1) ... [2023-02-14 03:09:39,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39" (1/1) ... [2023-02-14 03:09:39,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 03:09:39,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 03:09:39,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 03:09:39,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 03:09:39,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39" (1/1) ... [2023-02-14 03:09:39,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:39,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:39,299 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-14 03:09:39,302 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-14 03:09:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 03:09:39,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 03:09:39,414 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 03:09:39,416 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 03:09:39,512 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 03:09:39,518 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 03:09:39,519 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-14 03:09:39,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:09:39 BoogieIcfgContainer [2023-02-14 03:09:39,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 03:09:39,522 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-14 03:09:39,522 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-14 03:09:39,526 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-14 03:09:39,526 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 03:09:39,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.02 03:09:39" (1/3) ... [2023-02-14 03:09:39,528 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fded448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 03:09:39, skipping insertion in model container [2023-02-14 03:09:39,528 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 03:09:39,528 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:39" (2/3) ... [2023-02-14 03:09:39,529 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fded448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 03:09:39, skipping insertion in model container [2023-02-14 03:09:39,529 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 03:09:39,529 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:09:39" (3/3) ... [2023-02-14 03:09:39,530 INFO L332 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq.c [2023-02-14 03:09:39,607 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-14 03:09:39,607 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-14 03:09:39,607 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-14 03:09:39,607 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-14 03:09:39,607 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-14 03:09:39,608 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-14 03:09:39,608 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-14 03:09:39,608 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-14 03:09:39,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:39,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-14 03:09:39,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:39,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:39,633 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-14 03:09:39,634 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-14 03:09:39,634 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-14 03:09:39,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:39,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-14 03:09:39,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:39,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:39,637 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-14 03:09:39,637 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-14 03:09:39,646 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_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4#L18-1true [2023-02-14 03:09:39,646 INFO L750 eck$LassoCheckResult]: Loop: 4#L18-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10#L12true assume !(main_~i~0#1 >= 10); 2#L12-2true assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 7#L15-1true assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4#L18-1true [2023-02-14 03:09:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:39,656 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-14 03:09:39,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:39,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478958707] [2023-02-14 03:09:39,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:39,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:39,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:39,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:39,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2023-02-14 03:09:39,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:39,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048703651] [2023-02-14 03:09:39,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:39,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:39,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:39,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:39,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:39,802 INFO L85 PathProgramCache]: Analyzing trace with hash 889694446, now seen corresponding path program 1 times [2023-02-14 03:09:39,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:39,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464023946] [2023-02-14 03:09:39,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:39,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:39,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:39,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:39,954 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:39,961 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:39,961 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:39,962 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:39,962 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:09:39,962 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:39,962 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:39,962 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:39,962 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration1_Loop [2023-02-14 03:09:39,963 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:39,963 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:39,983 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-14 03:09:40,000 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-14 03:09:40,008 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-14 03:09:40,031 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-14 03:09:40,107 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:40,108 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:09:40,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:40,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:40,114 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-14 03:09:40,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:40,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:40,136 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-14 03:09:40,156 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:40,156 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-14 03:09:40,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:40,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:40,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:40,165 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-14 03:09:40,169 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-14 03:09:40,171 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:40,171 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:40,184 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:40,184 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-14 03:09:40,189 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-14 03:09:40,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:40,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:40,194 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-14 03:09:40,211 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:40,211 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:40,221 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-14 03:09:40,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:40,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:40,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:40,236 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-14 03:09:40,240 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-14 03:09:40,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:09:40,243 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:40,266 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:09:40,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:40,279 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:40,280 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:40,280 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:40,280 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:40,280 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:09:40,280 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:40,280 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:40,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:40,280 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration1_Loop [2023-02-14 03:09:40,280 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:40,281 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:40,283 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-14 03:09:40,287 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-14 03:09:40,291 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-14 03:09:40,294 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-14 03:09:40,348 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:40,352 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:09:40,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:40,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:40,354 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-14 03:09:40,359 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-14 03:09:40,360 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-14 03:09:40,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:40,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:40,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:40,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:40,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:40,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:40,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:40,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:40,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-02-14 03:09:40,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:40,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:40,401 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-14 03:09:40,407 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-14 03:09:40,409 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-14 03:09:40,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:40,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:40,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:40,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:40,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:09:40,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:09:40,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:40,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:40,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:40,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:40,453 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-14 03:09:40,461 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-14 03:09:40,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:40,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:40,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:40,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:40,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:09:40,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:09:40,485 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-14 03:09:40,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:40,511 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-14 03:09:40,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:40,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:40,513 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-14 03:09:40,516 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-14 03:09:40,517 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-14 03:09:40,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:40,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:40,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:40,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:40,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:40,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:40,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:40,541 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:09:40,544 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:09:40,544 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-14 03:09:40,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:40,547 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:40,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-02-14 03:09:40,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:09:40,550 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:09:40,550 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:09:40,551 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2023-02-14 03:09:40,554 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-14 03:09:40,558 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:09:40,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:40,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:40,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:40,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 03:09:40,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:40,620 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-14 03:09:40,648 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-14 03:09:40,650 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-14 03:09:40,718 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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 36 states and 54 transitions. Complement of second has 8 states. [2023-02-14 03:09:40,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-14 03:09:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2023-02-14 03:09:40,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2023-02-14 03:09:40,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:40,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2023-02-14 03:09:40,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:40,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2023-02-14 03:09:40,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:40,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 54 transitions. [2023-02-14 03:09:40,742 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-02-14 03:09:40,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 19 states and 30 transitions. [2023-02-14 03:09:40,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-02-14 03:09:40,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-02-14 03:09:40,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 30 transitions. [2023-02-14 03:09:40,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:40,748 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 30 transitions. [2023-02-14 03:09:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 30 transitions. [2023-02-14 03:09:40,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2023-02-14 03:09:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-14 03:09:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2023-02-14 03:09:40,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2023-02-14 03:09:40,771 INFO L428 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2023-02-14 03:09:40,771 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-14 03:09:40,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2023-02-14 03:09:40,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-02-14 03:09:40,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:40,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:40,773 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-14 03:09:40,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-14 03:09:40,773 INFO L748 eck$LassoCheckResult]: Stem: 100#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 105#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 97#L12 [2023-02-14 03:09:40,773 INFO L750 eck$LassoCheckResult]: Loop: 97#L12 assume !(main_~i~0#1 >= 10); 106#L12-2 assume !(main_~i~0#1 <= 0); 107#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 96#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 97#L12 [2023-02-14 03:09:40,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:40,774 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2023-02-14 03:09:40,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:40,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676225614] [2023-02-14 03:09:40,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:40,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:40,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:40,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:40,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:40,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 1 times [2023-02-14 03:09:40,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:40,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302572956] [2023-02-14 03:09:40,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:40,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:40,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:40,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:40,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1810725983, now seen corresponding path program 1 times [2023-02-14 03:09:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:40,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047909394] [2023-02-14 03:09:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:40,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:40,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047909394] [2023-02-14 03:09:40,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047909394] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:09:40,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:09:40,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 03:09:40,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922077846] [2023-02-14 03:09:40,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:09:40,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-02-14 03:09:40,892 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:40,892 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:40,892 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:40,892 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:40,892 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:09:40,892 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:40,892 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:40,892 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:40,892 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2023-02-14 03:09:40,893 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:40,893 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:40,896 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-14 03:09:40,909 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-14 03:09:40,917 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-14 03:09:40,921 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-14 03:09:40,956 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:40,957 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:09:40,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:40,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:40,962 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-14 03:09:40,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:40,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:40,971 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-14 03:09:40,993 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:40,993 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-14 03:09:41,001 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-14 03:09:41,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:41,003 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-14 03:09:41,005 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-14 03:09:41,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:41,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:41,030 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-14 03:09:41,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:41,032 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-14 03:09:41,047 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-14 03:09:41,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:09:41,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:41,079 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:09:41,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:41,084 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:41,084 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:41,084 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:41,085 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:41,085 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:09:41,085 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,085 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:41,085 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:41,085 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2023-02-14 03:09:41,085 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:41,085 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:41,086 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-14 03:09:41,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-14 03:09:41,110 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-14 03:09:41,112 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-14 03:09:41,166 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:41,166 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:09:41,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:41,169 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-14 03:09:41,180 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-14 03:09:41,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:41,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:41,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:41,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:41,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:09:41,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:09:41,209 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-14 03:09:41,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:41,225 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-14 03:09:41,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:41,226 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-14 03:09:41,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 03:09:41,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:41,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:41,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:41,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:41,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:41,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:41,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:41,250 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-14 03:09:41,261 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:09:41,264 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:09:41,264 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-14 03:09:41,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:41,270 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-14 03:09:41,272 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-14 03:09:41,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:09:41,274 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:09:41,274 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:09:41,274 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2023-02-14 03:09:41,288 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-14 03:09:41,289 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:09:41,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:41,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:41,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:41,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 03:09:41,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:41,370 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-14 03:09:41,371 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-14 03:09:41,372 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:41,397 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 73 transitions. Complement of second has 7 states. [2023-02-14 03:09:41,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:41,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2023-02-14 03:09:41,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 4 letters. [2023-02-14 03:09:41,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:41,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2023-02-14 03:09:41,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:41,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 8 letters. [2023-02-14 03:09:41,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:41,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 73 transitions. [2023-02-14 03:09:41,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-02-14 03:09:41,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 36 states and 59 transitions. [2023-02-14 03:09:41,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-02-14 03:09:41,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-02-14 03:09:41,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 59 transitions. [2023-02-14 03:09:41,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:41,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 59 transitions. [2023-02-14 03:09:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 59 transitions. [2023-02-14 03:09:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2023-02-14 03:09:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 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-14 03:09:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2023-02-14 03:09:41,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 46 transitions. [2023-02-14 03:09:41,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:41,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 03:09:41,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 03:09:41,425 INFO L87 Difference]: Start difference. First operand 28 states and 46 transitions. 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-14 03:09:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:41,439 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. [2023-02-14 03:09:41,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 56 transitions. [2023-02-14 03:09:41,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-14 03:09:41,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 32 states and 49 transitions. [2023-02-14 03:09:41,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-14 03:09:41,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-02-14 03:09:41,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2023-02-14 03:09:41,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:41,442 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-14 03:09:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2023-02-14 03:09:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2023-02-14 03:09:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 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-14 03:09:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2023-02-14 03:09:41,444 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 40 transitions. [2023-02-14 03:09:41,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 03:09:41,445 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2023-02-14 03:09:41,445 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-14 03:09:41,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. [2023-02-14 03:09:41,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-14 03:09:41,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:41,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:41,446 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 03:09:41,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-14 03:09:41,447 INFO L748 eck$LassoCheckResult]: Stem: 272#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 273#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 276#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 277#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 264#L12-2 assume !(main_~i~0#1 <= 0); 265#L15-1 [2023-02-14 03:09:41,447 INFO L750 eck$LassoCheckResult]: Loop: 265#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 274#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 283#L12 assume !(main_~i~0#1 >= 10); 281#L12-2 assume !(main_~i~0#1 <= 0); 265#L15-1 [2023-02-14 03:09:41,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:41,447 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2023-02-14 03:09:41,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:41,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332719837] [2023-02-14 03:09:41,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:41,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:41,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:41,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:41,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:41,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1768758, now seen corresponding path program 1 times [2023-02-14 03:09:41,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:41,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821411567] [2023-02-14 03:09:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:41,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:41,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:41,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:41,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:41,466 INFO L85 PathProgramCache]: Analyzing trace with hash 588716581, now seen corresponding path program 1 times [2023-02-14 03:09:41,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:41,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147135521] [2023-02-14 03:09:41,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:41,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:41,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:41,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:41,513 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:41,513 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:41,513 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:41,513 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:41,513 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:09:41,514 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,514 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:41,514 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:41,514 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2023-02-14 03:09:41,514 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:41,514 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:41,515 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-14 03:09:41,518 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-14 03:09:41,521 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-14 03:09:41,527 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-14 03:09:41,560 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:41,560 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:09:41,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:41,575 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-14 03:09:41,604 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-14 03:09:41,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:41,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:41,625 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:41,625 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:09:41,633 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-14 03:09:41,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:41,635 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:41,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:41,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:41,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-02-14 03:09:41,669 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:41,669 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:09:41,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:41,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:41,676 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-14 03:09:41,680 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-14 03:09:41,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:41,681 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:41,692 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-14 03:09:41,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:41,693 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-14 03:09:41,697 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-14 03:09:41,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:09:41,698 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:41,776 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:09:41,780 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-14 03:09:41,781 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:41,781 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:41,781 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:41,781 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:41,781 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:09:41,781 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,781 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:41,781 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:41,781 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2023-02-14 03:09:41,781 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:41,781 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:41,782 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-14 03:09:41,786 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-14 03:09:41,798 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-14 03:09:41,801 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-14 03:09:41,849 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:41,849 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:09:41,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:41,853 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-14 03:09:41,863 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-14 03:09:41,864 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-14 03:09:41,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:41,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:41,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:41,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:41,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:41,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:41,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:41,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:41,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:41,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:41,902 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-14 03:09:41,916 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-14 03:09:41,917 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-14 03:09:41,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:41,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:41,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:41,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:41,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:41,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:41,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:41,939 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:09:41,942 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-14 03:09:41,942 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-14 03:09:41,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:41,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:41,951 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-14 03:09:41,952 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-14 03:09:41,953 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:09:41,953 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:09:41,953 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:09:41,954 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-14 03:09:41,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:41,961 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:09:41,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:41,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:41,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:41,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 03:09:41,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:42,006 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-14 03:09:42,007 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-14 03:09:42,008 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-14 03:09:42,038 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 58 states and 90 transitions. Complement of second has 7 states. [2023-02-14 03:09:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-14 03:09:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-14 03:09:42,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2023-02-14 03:09:42,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:42,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2023-02-14 03:09:42,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:42,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2023-02-14 03:09:42,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:42,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 90 transitions. [2023-02-14 03:09:42,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-14 03:09:42,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 85 transitions. [2023-02-14 03:09:42,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-02-14 03:09:42,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-02-14 03:09:42,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2023-02-14 03:09:42,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:42,047 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 85 transitions. [2023-02-14 03:09:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2023-02-14 03:09:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2023-02-14 03:09:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 0 states have call successors, (0), 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-14 03:09:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2023-02-14 03:09:42,060 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 79 transitions. [2023-02-14 03:09:42,060 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 79 transitions. [2023-02-14 03:09:42,060 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-14 03:09:42,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 79 transitions. [2023-02-14 03:09:42,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-14 03:09:42,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:42,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:42,067 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-02-14 03:09:42,067 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-14 03:09:42,067 INFO L748 eck$LassoCheckResult]: Stem: 406#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 407#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 412#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 425#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 418#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 419#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 433#L18-1 [2023-02-14 03:09:42,067 INFO L750 eck$LassoCheckResult]: Loop: 433#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 420#L12 assume !(main_~i~0#1 >= 10); 421#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 432#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 433#L18-1 [2023-02-14 03:09:42,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:42,068 INFO L85 PathProgramCache]: Analyzing trace with hash 889692526, now seen corresponding path program 1 times [2023-02-14 03:09:42,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:42,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831211725] [2023-02-14 03:09:42,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:42,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:42,103 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-14 03:09:42,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:42,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831211725] [2023-02-14 03:09:42,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831211725] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:09:42,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:09:42,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 03:09:42,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530346704] [2023-02-14 03:09:42,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:09:42,106 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:42,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:42,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2023-02-14 03:09:42,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:42,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443530449] [2023-02-14 03:09:42,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:42,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:42,121 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-14 03:09:42,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:42,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443530449] [2023-02-14 03:09:42,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443530449] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:09:42,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:09:42,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 03:09:42,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747050310] [2023-02-14 03:09:42,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:09:42,122 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:09:42,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:42,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 03:09:42,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 03:09:42,123 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. cyclomatic complexity: 36 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-14 03:09:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:42,132 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2023-02-14 03:09:42,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 69 transitions. [2023-02-14 03:09:42,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-14 03:09:42,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 60 transitions. [2023-02-14 03:09:42,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-14 03:09:42,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-02-14 03:09:42,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 60 transitions. [2023-02-14 03:09:42,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:42,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 60 transitions. [2023-02-14 03:09:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 60 transitions. [2023-02-14 03:09:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-02-14 03:09:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 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-14 03:09:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2023-02-14 03:09:42,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 59 transitions. [2023-02-14 03:09:42,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 03:09:42,137 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2023-02-14 03:09:42,137 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-14 03:09:42,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2023-02-14 03:09:42,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-14 03:09:42,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:42,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:42,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2023-02-14 03:09:42,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-14 03:09:42,139 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_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 514#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 521#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 519#L12-2 assume !(main_~i~0#1 <= 0); 511#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 512#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 531#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 501#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 502#L15-1 [2023-02-14 03:09:42,139 INFO L750 eck$LassoCheckResult]: Loop: 502#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 517#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 530#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 528#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 502#L15-1 [2023-02-14 03:09:42,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:42,139 INFO L85 PathProgramCache]: Analyzing trace with hash 588716517, now seen corresponding path program 1 times [2023-02-14 03:09:42,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:42,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464993860] [2023-02-14 03:09:42,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:42,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:42,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:42,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464993860] [2023-02-14 03:09:42,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464993860] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:09:42,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:09:42,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 03:09:42,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351417485] [2023-02-14 03:09:42,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:09:42,170 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:42,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1709112, now seen corresponding path program 1 times [2023-02-14 03:09:42,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:42,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676819337] [2023-02-14 03:09:42,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:42,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:42,186 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-14 03:09:42,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:42,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676819337] [2023-02-14 03:09:42,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676819337] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:09:42,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:09:42,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 03:09:42,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204083638] [2023-02-14 03:09:42,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:09:42,187 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:09:42,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:42,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 03:09:42,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 03:09:42,188 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 24 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-14 03:09:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:42,197 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2023-02-14 03:09:42,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2023-02-14 03:09:42,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2023-02-14 03:09:42,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 45 states and 60 transitions. [2023-02-14 03:09:42,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-02-14 03:09:42,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-02-14 03:09:42,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 60 transitions. [2023-02-14 03:09:42,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:42,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 60 transitions. [2023-02-14 03:09:42,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 60 transitions. [2023-02-14 03:09:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2023-02-14 03:09:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 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-14 03:09:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2023-02-14 03:09:42,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 54 transitions. [2023-02-14 03:09:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 03:09:42,202 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2023-02-14 03:09:42,202 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-14 03:09:42,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2023-02-14 03:09:42,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2023-02-14 03:09:42,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:42,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:42,203 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:09:42,203 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-14 03:09:42,203 INFO L748 eck$LassoCheckResult]: Stem: 606#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 607#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 601#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 602#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 597#L12-2 assume !(main_~i~0#1 <= 0); 598#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 608#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 623#L12 assume !(main_~i~0#1 >= 10); 618#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 614#L15-1 [2023-02-14 03:09:42,203 INFO L750 eck$LassoCheckResult]: Loop: 614#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 615#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 620#L12 assume !(main_~i~0#1 >= 10); 619#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 614#L15-1 [2023-02-14 03:09:42,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:42,204 INFO L85 PathProgramCache]: Analyzing trace with hash 588716579, now seen corresponding path program 1 times [2023-02-14 03:09:42,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:42,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584069823] [2023-02-14 03:09:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:42,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:42,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:42,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584069823] [2023-02-14 03:09:42,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584069823] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:42,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750669581] [2023-02-14 03:09:42,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:42,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:42,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:42,235 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:42,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-14 03:09:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:42,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 03:09:42,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:42,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:42,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750669581] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:42,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:42,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-14 03:09:42,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090078947] [2023-02-14 03:09:42,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:42,314 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:42,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1709174, now seen corresponding path program 2 times [2023-02-14 03:09:42,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:42,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958134058] [2023-02-14 03:09:42,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:42,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:42,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:42,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:42,333 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-14 03:09:42,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:42,383 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:42,383 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:42,383 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:42,383 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:42,383 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:09:42,384 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:42,384 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:42,384 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:42,384 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2023-02-14 03:09:42,384 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:42,384 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:42,385 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-14 03:09:42,390 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-14 03:09:42,394 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-14 03:09:42,400 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-14 03:09:42,450 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:42,450 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:09:42,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:42,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:42,453 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-14 03:09:42,457 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-14 03:09:42,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:42,459 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:42,472 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:42,472 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:09:42,476 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-14 03:09:42,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:42,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:42,478 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-14 03:09:42,481 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-14 03:09:42,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:42,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:42,497 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:42,498 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:09:42,504 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-14 03:09:42,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:42,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:42,506 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:42,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-02-14 03:09:42,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:42,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:42,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:42,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:42,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:42,549 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-14 03:09:42,552 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-14 03:09:42,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:09:42,553 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:42,631 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:09:42,637 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-14 03:09:42,638 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:42,638 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:42,638 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:42,638 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:42,638 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:09:42,638 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:42,638 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:42,638 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:42,638 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2023-02-14 03:09:42,638 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:42,638 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:42,639 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-14 03:09:42,646 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-14 03:09:42,654 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-14 03:09:42,656 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-14 03:09:42,710 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:42,710 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:09:42,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:42,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:42,712 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-14 03:09:42,722 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-14 03:09:42,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:42,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:42,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:42,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:42,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:42,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:42,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:42,733 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-14 03:09:42,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:42,748 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-14 03:09:42,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:42,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:42,749 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-14 03:09:42,752 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-14 03:09:42,754 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-14 03:09:42,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:42,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:42,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:42,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:42,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:42,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:42,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:42,780 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:09:42,782 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:09:42,783 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 03:09:42,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:42,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:42,784 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-14 03:09:42,785 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-14 03:09:42,787 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:09:42,787 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:09:42,787 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:09:42,787 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-14 03:09:42,793 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-14 03:09:42,794 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:09:42,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:42,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:42,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:42,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 03:09:42,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:42,843 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-14 03:09:42,844 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-14 03:09:42,844 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 54 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:42,873 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 54 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 101 states and 136 transitions. Complement of second has 7 states. [2023-02-14 03:09:42,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2023-02-14 03:09:42,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 4 letters. [2023-02-14 03:09:42,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:42,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 13 letters. Loop has 4 letters. [2023-02-14 03:09:42,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:42,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 8 letters. [2023-02-14 03:09:42,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:42,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 136 transitions. [2023-02-14 03:09:42,876 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-14 03:09:42,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 91 states and 122 transitions. [2023-02-14 03:09:42,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2023-02-14 03:09:42,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-02-14 03:09:42,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 122 transitions. [2023-02-14 03:09:42,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:42,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2023-02-14 03:09:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 122 transitions. [2023-02-14 03:09:42,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2023-02-14 03:09:42,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 77 states have internal predecessors, (109), 0 states have call successors, (0), 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-14 03:09:42,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2023-02-14 03:09:42,882 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 109 transitions. [2023-02-14 03:09:42,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:42,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 03:09:42,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-14 03:09:42,883 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-14 03:09:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:42,921 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2023-02-14 03:09:42,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 174 transitions. [2023-02-14 03:09:42,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2023-02-14 03:09:42,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 108 states and 137 transitions. [2023-02-14 03:09:42,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2023-02-14 03:09:42,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2023-02-14 03:09:42,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 137 transitions. [2023-02-14 03:09:42,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:42,924 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 137 transitions. [2023-02-14 03:09:42,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 137 transitions. [2023-02-14 03:09:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2023-02-14 03:09:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 85 states have internal predecessors, (111), 0 states have call successors, (0), 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-14 03:09:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2023-02-14 03:09:42,929 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 111 transitions. [2023-02-14 03:09:42,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 03:09:42,930 INFO L428 stractBuchiCegarLoop]: Abstraction has 86 states and 111 transitions. [2023-02-14 03:09:42,930 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-14 03:09:42,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 111 transitions. [2023-02-14 03:09:42,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-14 03:09:42,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:42,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:42,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 03:09:42,931 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-14 03:09:42,931 INFO L748 eck$LassoCheckResult]: Stem: 1075#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1076#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1079#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1088#L12 assume !(main_~i~0#1 >= 10); 1098#L12-2 assume !(main_~i~0#1 <= 0); 1097#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1095#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1092#L12 assume !(main_~i~0#1 >= 10); 1091#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1090#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1070#L18-1 [2023-02-14 03:09:42,932 INFO L750 eck$LassoCheckResult]: Loop: 1070#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1071#L12 assume !(main_~i~0#1 >= 10); 1120#L12-2 assume !(main_~i~0#1 <= 0); 1081#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1070#L18-1 [2023-02-14 03:09:42,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1449615143, now seen corresponding path program 1 times [2023-02-14 03:09:42,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:42,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945482761] [2023-02-14 03:09:42,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:42,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:42,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:42,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 2 times [2023-02-14 03:09:42,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:42,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485700868] [2023-02-14 03:09:42,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:42,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:42,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:42,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash -130036926, now seen corresponding path program 2 times [2023-02-14 03:09:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:42,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112943188] [2023-02-14 03:09:42,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:42,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:42,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:42,984 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:42,984 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:42,984 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:42,984 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:42,984 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:09:42,984 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:42,984 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:42,985 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:42,985 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2023-02-14 03:09:42,985 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:42,985 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:42,986 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-14 03:09:42,991 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-14 03:09:42,994 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-14 03:09:42,996 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:43,028 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:43,028 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:09:43,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:43,029 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:43,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:43,042 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:43,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-02-14 03:09:43,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:43,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:43,069 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:43,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:09:43,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:43,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-02-14 03:09:43,109 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:09:43,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:43,113 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:43,113 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:43,113 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:43,113 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:43,113 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:09:43,113 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,113 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:43,113 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:43,113 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2023-02-14 03:09:43,113 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:43,113 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:43,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-14 03:09:43,121 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-14 03:09:43,124 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-14 03:09:43,126 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-14 03:09:43,161 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:43,161 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:09:43,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:43,163 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:43,182 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-14 03:09:43,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-14 03:09:43,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:43,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:43,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:43,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:43,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:43,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:43,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:43,193 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:09:43,199 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:09:43,200 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-14 03:09:43,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:43,204 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:43,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-02-14 03:09:43,206 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:09:43,206 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:09:43,206 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:09:43,206 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2023-02-14 03:09:43,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:43,212 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:09:43,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:43,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:43,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:43,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 03:09:43,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:43,260 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-14 03:09:43,261 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-14 03:09:43,261 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 111 transitions. cyclomatic complexity: 31 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:43,277 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 111 transitions. cyclomatic complexity: 31. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 115 states and 145 transitions. Complement of second has 7 states. [2023-02-14 03:09:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-14 03:09:43,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2023-02-14 03:09:43,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:43,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-14 03:09:43,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:43,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2023-02-14 03:09:43,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:43,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 145 transitions. [2023-02-14 03:09:43,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-14 03:09:43,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 97 states and 125 transitions. [2023-02-14 03:09:43,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-02-14 03:09:43,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-02-14 03:09:43,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 125 transitions. [2023-02-14 03:09:43,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:43,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 125 transitions. [2023-02-14 03:09:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 125 transitions. [2023-02-14 03:09:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2023-02-14 03:09:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 85 states have internal predecessors, (112), 0 states have call successors, (0), 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-14 03:09:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2023-02-14 03:09:43,285 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 112 transitions. [2023-02-14 03:09:43,285 INFO L428 stractBuchiCegarLoop]: Abstraction has 86 states and 112 transitions. [2023-02-14 03:09:43,285 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-14 03:09:43,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 112 transitions. [2023-02-14 03:09:43,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-14 03:09:43,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:43,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:43,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:09:43,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-14 03:09:43,287 INFO L748 eck$LassoCheckResult]: Stem: 1341#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1342#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1347#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1370#L12 assume !(main_~i~0#1 >= 10); 1368#L12-2 assume !(main_~i~0#1 <= 0); 1367#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1365#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1362#L12 assume !(main_~i~0#1 >= 10); 1361#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1348#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1336#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1338#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1332#L12-2 [2023-02-14 03:09:43,287 INFO L750 eck$LassoCheckResult]: Loop: 1332#L12-2 assume !(main_~i~0#1 <= 0); 1333#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1351#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1416#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1332#L12-2 [2023-02-14 03:09:43,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:43,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1510748164, now seen corresponding path program 1 times [2023-02-14 03:09:43,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:43,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996633650] [2023-02-14 03:09:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:43,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 03:09:43,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:43,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996633650] [2023-02-14 03:09:43,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996633650] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:09:43,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:09:43,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 03:09:43,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907871590] [2023-02-14 03:09:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:09:43,313 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:43,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:43,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 1 times [2023-02-14 03:09:43,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:43,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674280534] [2023-02-14 03:09:43,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:43,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:43,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:43,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:43,348 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:43,348 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:43,348 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:43,348 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:43,348 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:09:43,348 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,348 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:43,349 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:43,349 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2023-02-14 03:09:43,349 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:43,349 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:43,350 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-14 03:09:43,354 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-14 03:09:43,356 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-14 03:09:43,359 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-14 03:09:43,395 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:43,395 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:09:43,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:43,397 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:43,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:43,411 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:43,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-02-14 03:09:43,419 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:43,419 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:09:43,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-02-14 03:09:43,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:43,423 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:43,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-02-14 03:09:43,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:43,428 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:43,440 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:43,441 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:09:43,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-02-14 03:09:43,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:43,445 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:43,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-02-14 03:09:43,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:43,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:43,461 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:43,461 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:09:43,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:43,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:43,466 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:43,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-02-14 03:09:43,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:43,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:43,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:43,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:43,528 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:43,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:09:43,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:43,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-02-14 03:09:43,620 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:09:43,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:43,627 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:43,627 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:43,627 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:43,627 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:43,627 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:09:43,627 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,627 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:43,627 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:43,627 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2023-02-14 03:09:43,627 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:43,628 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:43,628 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-14 03:09:43,634 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-14 03:09:43,637 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-14 03:09:43,648 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-14 03:09:43,692 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:43,692 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:09:43,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:43,694 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:43,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-02-14 03:09:43,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 03:09:43,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:43,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:43,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:43,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:43,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:43,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:43,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:43,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:43,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:43,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:43,718 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:43,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-02-14 03:09:43,722 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-14 03:09:43,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:43,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:43,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:43,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:43,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:09:43,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:09:43,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:43,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:43,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:43,779 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:43,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:43,789 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-14 03:09:43,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-02-14 03:09:43,796 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-14 03:09:43,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:43,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:43,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:43,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:43,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:43,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:43,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:43,800 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:09:43,802 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:09:43,802 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 03:09:43,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:43,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:43,803 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:43,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-02-14 03:09:43,810 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:09:43,810 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:09:43,810 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:09:43,810 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-14 03:09:43,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:43,814 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:09:43,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:43,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:43,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:43,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 03:09:43,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:43,876 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-14 03:09:43,877 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-14 03:09:43,877 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 112 transitions. cyclomatic complexity: 32 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-14 03:09:43,908 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 112 transitions. cyclomatic complexity: 32. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Result 188 states and 256 transitions. Complement of second has 7 states. [2023-02-14 03:09:43,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-14 03:09:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-14 03:09:43,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 4 letters. [2023-02-14 03:09:43,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:43,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2023-02-14 03:09:43,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:43,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 8 letters. [2023-02-14 03:09:43,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:43,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 256 transitions. [2023-02-14 03:09:43,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-14 03:09:43,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 140 states and 182 transitions. [2023-02-14 03:09:43,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-02-14 03:09:43,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2023-02-14 03:09:43,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 182 transitions. [2023-02-14 03:09:43,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:43,914 INFO L218 hiAutomatonCegarLoop]: Abstraction has 140 states and 182 transitions. [2023-02-14 03:09:43,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 182 transitions. [2023-02-14 03:09:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 94. [2023-02-14 03:09:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 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-14 03:09:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2023-02-14 03:09:43,918 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 124 transitions. [2023-02-14 03:09:43,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:43,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 03:09:43,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 03:09:43,918 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:43,933 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2023-02-14 03:09:43,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 132 transitions. [2023-02-14 03:09:43,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2023-02-14 03:09:43,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 103 states and 130 transitions. [2023-02-14 03:09:43,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2023-02-14 03:09:43,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2023-02-14 03:09:43,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 130 transitions. [2023-02-14 03:09:43,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:43,936 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 130 transitions. [2023-02-14 03:09:43,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 130 transitions. [2023-02-14 03:09:43,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2023-02-14 03:09:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 93 states have internal predecessors, (121), 0 states have call successors, (0), 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-14 03:09:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2023-02-14 03:09:43,940 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 121 transitions. [2023-02-14 03:09:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 03:09:43,940 INFO L428 stractBuchiCegarLoop]: Abstraction has 94 states and 121 transitions. [2023-02-14 03:09:43,941 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-14 03:09:43,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 121 transitions. [2023-02-14 03:09:43,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-14 03:09:43,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:43,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:43,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1, 1] [2023-02-14 03:09:43,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-14 03:09:43,948 INFO L748 eck$LassoCheckResult]: Stem: 1885#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1886#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1890#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1899#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1900#L12-2 assume !(main_~i~0#1 <= 0); 1921#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1920#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1919#L12 assume !(main_~i~0#1 >= 10); 1918#L12-2 assume !(main_~i~0#1 <= 0); 1917#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1916#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1915#L12 assume !(main_~i~0#1 >= 10); 1914#L12-2 assume !(main_~i~0#1 <= 0); 1913#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1912#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1911#L12 assume !(main_~i~0#1 >= 10); 1907#L12-2 assume !(main_~i~0#1 <= 0); 1910#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1909#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1906#L12 assume !(main_~i~0#1 >= 10); 1905#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1904#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1892#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1883#L12 assume !(main_~i~0#1 >= 10); 1962#L12-2 assume !(main_~i~0#1 <= 0); 1889#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1882#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1884#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1876#L12-2 [2023-02-14 03:09:43,948 INFO L750 eck$LassoCheckResult]: Loop: 1876#L12-2 assume !(main_~i~0#1 <= 0); 1877#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1896#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1956#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1876#L12-2 [2023-02-14 03:09:43,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:43,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1054469156, now seen corresponding path program 2 times [2023-02-14 03:09:43,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:43,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526849600] [2023-02-14 03:09:43,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:43,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 03:09:44,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:44,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526849600] [2023-02-14 03:09:44,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526849600] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:44,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687231510] [2023-02-14 03:09:44,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 03:09:44,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:44,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:44,029 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:44,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2023-02-14 03:09:44,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 03:09:44,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:44,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 03:09:44,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 03:09:44,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 03:09:44,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687231510] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:44,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:44,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-02-14 03:09:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073556718] [2023-02-14 03:09:44,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:44,176 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:44,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:44,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 2 times [2023-02-14 03:09:44,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:44,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914793699] [2023-02-14 03:09:44,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:44,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:44,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:44,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:44,222 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:44,222 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:44,222 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:44,222 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:44,222 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:09:44,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:44,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:44,223 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:44,223 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration9_Loop [2023-02-14 03:09:44,223 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:44,223 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:44,224 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-14 03:09:44,229 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-14 03:09:44,231 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-14 03:09:44,235 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-14 03:09:44,272 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:44,272 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:09:44,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:44,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:44,274 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:44,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:44,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:44,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-02-14 03:09:44,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-02-14 03:09:44,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:44,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:44,312 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:44,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-02-14 03:09:44,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:09:44,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:44,385 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:09:44,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-02-14 03:09:44,389 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:44,389 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:44,389 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:44,389 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:44,389 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:09:44,389 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:44,389 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:44,389 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:44,389 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration9_Loop [2023-02-14 03:09:44,389 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:44,389 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:44,390 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-14 03:09:44,402 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-14 03:09:44,407 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-14 03:09:44,409 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-14 03:09:44,445 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:44,446 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:09:44,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:44,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:44,447 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:44,457 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-14 03:09:44,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:44,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:44,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:44,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:44,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:44,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:44,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:44,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-02-14 03:09:44,472 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:09:44,475 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:09:44,475 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 03:09:44,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:44,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:44,478 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:44,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-02-14 03:09:44,481 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:09:44,481 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:09:44,481 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:09:44,481 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-14 03:09:44,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:44,484 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:09:44,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:44,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:44,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:44,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 03:09:44,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:44,550 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-14 03:09:44,550 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-14 03:09:44,550 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:44,571 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 148 states and 200 transitions. Complement of second has 7 states. [2023-02-14 03:09:44,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-14 03:09:44,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 28 letters. Loop has 4 letters. [2023-02-14 03:09:44,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:44,573 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:09:44,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:44,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:44,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:44,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 03:09:44,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:44,641 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-14 03:09:44,642 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-14 03:09:44,642 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:44,666 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 173 states and 212 transitions. Complement of second has 7 states. [2023-02-14 03:09:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2023-02-14 03:09:44,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 28 letters. Loop has 4 letters. [2023-02-14 03:09:44,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:44,667 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:09:44,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:44,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:44,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:44,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 03:09:44,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:44,731 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-14 03:09:44,731 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-14 03:09:44,732 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:44,754 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 163 states and 221 transitions. Complement of second has 8 states. [2023-02-14 03:09:44,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2023-02-14 03:09:44,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 4 letters. [2023-02-14 03:09:44,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:44,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 32 letters. Loop has 4 letters. [2023-02-14 03:09:44,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:44,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 8 letters. [2023-02-14 03:09:44,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:44,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 221 transitions. [2023-02-14 03:09:44,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2023-02-14 03:09:44,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 115 states and 147 transitions. [2023-02-14 03:09:44,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-02-14 03:09:44,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-02-14 03:09:44,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 147 transitions. [2023-02-14 03:09:44,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:44,759 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 147 transitions. [2023-02-14 03:09:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 147 transitions. [2023-02-14 03:09:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 61. [2023-02-14 03:09:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.278688524590164) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 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-14 03:09:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2023-02-14 03:09:44,761 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 78 transitions. [2023-02-14 03:09:44,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:44,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 03:09:44,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-14 03:09:44,762 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 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-14 03:09:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:44,858 INFO L93 Difference]: Finished difference Result 195 states and 238 transitions. [2023-02-14 03:09:44,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 238 transitions. [2023-02-14 03:09:44,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 [2023-02-14 03:09:44,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 182 states and 225 transitions. [2023-02-14 03:09:44,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2023-02-14 03:09:44,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2023-02-14 03:09:44,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 225 transitions. [2023-02-14 03:09:44,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:44,874 INFO L218 hiAutomatonCegarLoop]: Abstraction has 182 states and 225 transitions. [2023-02-14 03:09:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 225 transitions. [2023-02-14 03:09:44,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2023-02-14 03:09:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.255952380952381) internal successors, (211), 167 states have internal predecessors, (211), 0 states have call successors, (0), 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-14 03:09:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 211 transitions. [2023-02-14 03:09:44,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:44,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 168 states and 211 transitions. [2023-02-14 03:09:44,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 03:09:44,886 INFO L428 stractBuchiCegarLoop]: Abstraction has 168 states and 211 transitions. [2023-02-14 03:09:44,887 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-14 03:09:44,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 211 transitions. [2023-02-14 03:09:44,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-14 03:09:44,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:44,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:44,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2023-02-14 03:09:44,889 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2023-02-14 03:09:44,890 INFO L748 eck$LassoCheckResult]: Stem: 3216#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 3220#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3224#L12 assume !(main_~i~0#1 >= 10); 3229#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 3227#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3212#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3213#L12 assume !(main_~i~0#1 >= 10); 3320#L12-2 assume !(main_~i~0#1 <= 0); 3321#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3316#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3274#L12 [2023-02-14 03:09:44,890 INFO L750 eck$LassoCheckResult]: Loop: 3274#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 3273#L12-2 assume !(main_~i~0#1 <= 0); 3211#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3214#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3215#L12 assume !(main_~i~0#1 >= 10); 3223#L12-2 assume !(main_~i~0#1 <= 0); 3315#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3314#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3313#L12 assume !(main_~i~0#1 >= 10); 3312#L12-2 assume !(main_~i~0#1 <= 0); 3311#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3310#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3309#L12 assume !(main_~i~0#1 >= 10); 3308#L12-2 assume !(main_~i~0#1 <= 0); 3307#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3306#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3305#L12 assume !(main_~i~0#1 >= 10); 3304#L12-2 assume !(main_~i~0#1 <= 0); 3303#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3302#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3301#L12 assume !(main_~i~0#1 >= 10); 3300#L12-2 assume !(main_~i~0#1 <= 0); 3299#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3298#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3297#L12 assume !(main_~i~0#1 >= 10); 3296#L12-2 assume !(main_~i~0#1 <= 0); 3295#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3294#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3293#L12 assume !(main_~i~0#1 >= 10); 3292#L12-2 assume !(main_~i~0#1 <= 0); 3291#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3290#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3289#L12 assume !(main_~i~0#1 >= 10); 3288#L12-2 assume !(main_~i~0#1 <= 0); 3287#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3286#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3285#L12 assume !(main_~i~0#1 >= 10); 3282#L12-2 assume !(main_~i~0#1 <= 0); 3284#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3283#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3281#L12 assume !(main_~i~0#1 >= 10); 3278#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 3276#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3277#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3279#L12 assume !(main_~i~0#1 >= 10); 3280#L12-2 assume !(main_~i~0#1 <= 0); 3375#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3374#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3347#L12 assume !(main_~i~0#1 >= 10); 3208#L12-2 assume !(main_~i~0#1 <= 0); 3209#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3226#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3348#L12 assume !(main_~i~0#1 >= 10); 3373#L12-2 assume !(main_~i~0#1 <= 0); 3372#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3371#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3370#L12 assume !(main_~i~0#1 >= 10); 3369#L12-2 assume !(main_~i~0#1 <= 0); 3368#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3367#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3366#L12 assume !(main_~i~0#1 >= 10); 3365#L12-2 assume !(main_~i~0#1 <= 0); 3364#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3363#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3362#L12 assume !(main_~i~0#1 >= 10); 3361#L12-2 assume !(main_~i~0#1 <= 0); 3360#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3359#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3358#L12 assume !(main_~i~0#1 >= 10); 3357#L12-2 assume !(main_~i~0#1 <= 0); 3356#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3355#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3354#L12 assume !(main_~i~0#1 >= 10); 3353#L12-2 assume !(main_~i~0#1 <= 0); 3352#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3351#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3350#L12 assume !(main_~i~0#1 >= 10); 3222#L12-2 assume !(main_~i~0#1 <= 0); 3349#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3275#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3274#L12 [2023-02-14 03:09:44,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:44,891 INFO L85 PathProgramCache]: Analyzing trace with hash 474307092, now seen corresponding path program 1 times [2023-02-14 03:09:44,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:44,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995699192] [2023-02-14 03:09:44,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:44,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:44,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:44,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:44,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:44,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1617023097, now seen corresponding path program 1 times [2023-02-14 03:09:44,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:44,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885829723] [2023-02-14 03:09:44,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:44,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:44,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:44,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:44,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:44,930 INFO L85 PathProgramCache]: Analyzing trace with hash -68907892, now seen corresponding path program 3 times [2023-02-14 03:09:44,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:44,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147596807] [2023-02-14 03:09:44,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:44,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-14 03:09:45,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:45,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147596807] [2023-02-14 03:09:45,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147596807] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:45,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349839523] [2023-02-14 03:09:45,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 03:09:45,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:45,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:45,041 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:45,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2023-02-14 03:09:45,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-14 03:09:45,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:45,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 03:09:45,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-14 03:09:45,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-14 03:09:45,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349839523] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:45,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:45,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-02-14 03:09:45,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037177900] [2023-02-14 03:09:45,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:45,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 03:09:45,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-14 03:09:45,595 INFO L87 Difference]: Start difference. First operand 168 states and 211 transitions. cyclomatic complexity: 46 Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-14 03:09:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:45,639 INFO L93 Difference]: Finished difference Result 179 states and 197 transitions. [2023-02-14 03:09:45,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 197 transitions. [2023-02-14 03:09:45,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-14 03:09:45,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 175 states and 193 transitions. [2023-02-14 03:09:45,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2023-02-14 03:09:45,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2023-02-14 03:09:45,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 193 transitions. [2023-02-14 03:09:45,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:45,642 INFO L218 hiAutomatonCegarLoop]: Abstraction has 175 states and 193 transitions. [2023-02-14 03:09:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 193 transitions. [2023-02-14 03:09:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2023-02-14 03:09:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.1011904761904763) internal successors, (185), 167 states have internal predecessors, (185), 0 states have call successors, (0), 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-14 03:09:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2023-02-14 03:09:45,646 INFO L240 hiAutomatonCegarLoop]: Abstraction has 168 states and 185 transitions. [2023-02-14 03:09:45,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 03:09:45,647 INFO L428 stractBuchiCegarLoop]: Abstraction has 168 states and 185 transitions. [2023-02-14 03:09:45,647 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-14 03:09:45,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 185 transitions. [2023-02-14 03:09:45,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-14 03:09:45,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:45,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:45,649 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2023-02-14 03:09:45,649 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2023-02-14 03:09:45,649 INFO L748 eck$LassoCheckResult]: Stem: 4116#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4117#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4121#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4133#L12 assume !(main_~i~0#1 >= 10); 4129#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 4126#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4127#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4262#L12 assume !(main_~i~0#1 >= 10); 4261#L12-2 assume !(main_~i~0#1 <= 0); 4124#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4125#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4260#L12 assume !(main_~i~0#1 >= 10); 4258#L12-2 assume !(main_~i~0#1 <= 0); 4259#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4253#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4122#L12 assume !(main_~i~0#1 >= 10); 4108#L12-2 assume !(main_~i~0#1 <= 0); 4109#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4257#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4256#L12 assume !(main_~i~0#1 >= 10); 4255#L12-2 assume !(main_~i~0#1 <= 0); 4254#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4112#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4113#L12 assume !(main_~i~0#1 >= 10); 4275#L12-2 assume !(main_~i~0#1 <= 0); 4274#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4263#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4176#L12 [2023-02-14 03:09:45,650 INFO L750 eck$LassoCheckResult]: Loop: 4176#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 4175#L12-2 assume !(main_~i~0#1 <= 0); 4120#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4114#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4115#L12 assume !(main_~i~0#1 >= 10); 4110#L12-2 assume !(main_~i~0#1 <= 0); 4111#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4252#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4251#L12 assume !(main_~i~0#1 >= 10); 4250#L12-2 assume !(main_~i~0#1 <= 0); 4249#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4248#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4247#L12 assume !(main_~i~0#1 >= 10); 4246#L12-2 assume !(main_~i~0#1 <= 0); 4245#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4244#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4243#L12 assume !(main_~i~0#1 >= 10); 4242#L12-2 assume !(main_~i~0#1 <= 0); 4241#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4240#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4239#L12 assume !(main_~i~0#1 >= 10); 4238#L12-2 assume !(main_~i~0#1 <= 0); 4237#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4236#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4235#L12 assume !(main_~i~0#1 >= 10); 4234#L12-2 assume !(main_~i~0#1 <= 0); 4233#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4232#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4231#L12 assume !(main_~i~0#1 >= 10); 4230#L12-2 assume !(main_~i~0#1 <= 0); 4229#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4228#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4227#L12 assume !(main_~i~0#1 >= 10); 4226#L12-2 assume !(main_~i~0#1 <= 0); 4225#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4224#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4223#L12 assume !(main_~i~0#1 >= 10); 4220#L12-2 assume !(main_~i~0#1 <= 0); 4222#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4221#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4219#L12 assume !(main_~i~0#1 >= 10); 4218#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 4215#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4217#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4216#L12 assume !(main_~i~0#1 >= 10); 4214#L12-2 assume !(main_~i~0#1 <= 0); 4213#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4212#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4211#L12 assume !(main_~i~0#1 >= 10); 4210#L12-2 assume !(main_~i~0#1 <= 0); 4209#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4207#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4205#L12 assume !(main_~i~0#1 >= 10); 4203#L12-2 assume !(main_~i~0#1 <= 0); 4201#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4199#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4197#L12 assume !(main_~i~0#1 >= 10); 4195#L12-2 assume !(main_~i~0#1 <= 0); 4193#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4191#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4189#L12 assume !(main_~i~0#1 >= 10); 4187#L12-2 assume !(main_~i~0#1 <= 0); 4186#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4177#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4178#L12 assume !(main_~i~0#1 >= 10); 4188#L12-2 assume !(main_~i~0#1 <= 0); 4208#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4206#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4204#L12 assume !(main_~i~0#1 >= 10); 4202#L12-2 assume !(main_~i~0#1 <= 0); 4200#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4198#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4196#L12 assume !(main_~i~0#1 >= 10); 4194#L12-2 assume !(main_~i~0#1 <= 0); 4192#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4190#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4183#L12 assume !(main_~i~0#1 >= 10); 4184#L12-2 assume !(main_~i~0#1 <= 0); 4264#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4185#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4176#L12 [2023-02-14 03:09:45,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:45,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1514411024, now seen corresponding path program 2 times [2023-02-14 03:09:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:45,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949599805] [2023-02-14 03:09:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:45,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:45,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:45,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:45,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:45,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1617023097, now seen corresponding path program 2 times [2023-02-14 03:09:45,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:45,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160969360] [2023-02-14 03:09:45,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:45,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:45,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:45,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:45,693 INFO L85 PathProgramCache]: Analyzing trace with hash -883489176, now seen corresponding path program 4 times [2023-02-14 03:09:45,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:45,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445174301] [2023-02-14 03:09:45,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:45,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-14 03:09:45,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:45,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445174301] [2023-02-14 03:09:45,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445174301] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:45,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665261641] [2023-02-14 03:09:45,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 03:09:45,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:45,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:45,853 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:45,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2023-02-14 03:09:45,901 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 03:09:45,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:45,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 03:09:45,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-14 03:09:45,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-14 03:09:46,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665261641] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:46,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:46,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2023-02-14 03:09:46,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539900381] [2023-02-14 03:09:46,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:46,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:46,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 03:09:46,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-14 03:09:46,463 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. cyclomatic complexity: 21 Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 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-14 03:09:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:46,575 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2023-02-14 03:09:46,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 229 transitions. [2023-02-14 03:09:46,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-14 03:09:46,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 208 states and 223 transitions. [2023-02-14 03:09:46,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2023-02-14 03:09:46,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2023-02-14 03:09:46,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 223 transitions. [2023-02-14 03:09:46,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:46,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 208 states and 223 transitions. [2023-02-14 03:09:46,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 223 transitions. [2023-02-14 03:09:46,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 167. [2023-02-14 03:09:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.089820359281437) internal successors, (182), 166 states have internal predecessors, (182), 0 states have call successors, (0), 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-14 03:09:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2023-02-14 03:09:46,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 182 transitions. [2023-02-14 03:09:46,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 03:09:46,584 INFO L428 stractBuchiCegarLoop]: Abstraction has 167 states and 182 transitions. [2023-02-14 03:09:46,584 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-14 03:09:46,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 182 transitions. [2023-02-14 03:09:46,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-14 03:09:46,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:46,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:46,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2023-02-14 03:09:46,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2023-02-14 03:09:46,589 INFO L748 eck$LassoCheckResult]: Stem: 5151#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 5152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 5153#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5166#L12 assume !(main_~i~0#1 >= 10); 5164#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 5162#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5161#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5204#L12 assume !(main_~i~0#1 >= 10); 5203#L12-2 assume !(main_~i~0#1 <= 0); 5202#L15-1 [2023-02-14 03:09:46,591 INFO L750 eck$LassoCheckResult]: Loop: 5202#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5201#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5200#L12 assume !(main_~i~0#1 >= 10); 5199#L12-2 assume !(main_~i~0#1 <= 0); 5198#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5197#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5196#L12 assume !(main_~i~0#1 >= 10); 5195#L12-2 assume !(main_~i~0#1 <= 0); 5194#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5193#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5192#L12 assume !(main_~i~0#1 >= 10); 5191#L12-2 assume !(main_~i~0#1 <= 0); 5190#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5189#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5188#L12 assume !(main_~i~0#1 >= 10); 5187#L12-2 assume !(main_~i~0#1 <= 0); 5186#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5185#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5184#L12 assume !(main_~i~0#1 >= 10); 5183#L12-2 assume !(main_~i~0#1 <= 0); 5182#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5181#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5180#L12 assume !(main_~i~0#1 >= 10); 5179#L12-2 assume !(main_~i~0#1 <= 0); 5178#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5177#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5176#L12 assume !(main_~i~0#1 >= 10); 5175#L12-2 assume !(main_~i~0#1 <= 0); 5174#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5173#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5172#L12 assume !(main_~i~0#1 >= 10); 5171#L12-2 assume !(main_~i~0#1 <= 0); 5170#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5169#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5168#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 5165#L12-2 assume !(main_~i~0#1 <= 0); 5146#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5149#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5150#L12 assume !(main_~i~0#1 >= 10); 5245#L12-2 assume !(main_~i~0#1 <= 0); 5244#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5243#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5242#L12 assume !(main_~i~0#1 >= 10); 5241#L12-2 assume !(main_~i~0#1 <= 0); 5240#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5239#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5238#L12 assume !(main_~i~0#1 >= 10); 5237#L12-2 assume !(main_~i~0#1 <= 0); 5236#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5235#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5234#L12 assume !(main_~i~0#1 >= 10); 5233#L12-2 assume !(main_~i~0#1 <= 0); 5232#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5231#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5230#L12 assume !(main_~i~0#1 >= 10); 5229#L12-2 assume !(main_~i~0#1 <= 0); 5228#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5227#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5226#L12 assume !(main_~i~0#1 >= 10); 5225#L12-2 assume !(main_~i~0#1 <= 0); 5224#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5223#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5222#L12 assume !(main_~i~0#1 >= 10); 5221#L12-2 assume !(main_~i~0#1 <= 0); 5220#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5219#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5218#L12 assume !(main_~i~0#1 >= 10); 5217#L12-2 assume !(main_~i~0#1 <= 0); 5216#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5215#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5214#L12 assume !(main_~i~0#1 >= 10); 5213#L12-2 assume !(main_~i~0#1 <= 0); 5212#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5211#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5210#L12 assume !(main_~i~0#1 >= 10); 5208#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 5207#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5205#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5206#L12 assume !(main_~i~0#1 >= 10); 5209#L12-2 assume !(main_~i~0#1 <= 0); 5202#L15-1 [2023-02-14 03:09:46,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:46,592 INFO L85 PathProgramCache]: Analyzing trace with hash 644068259, now seen corresponding path program 3 times [2023-02-14 03:09:46,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:46,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402041116] [2023-02-14 03:09:46,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:46,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:46,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:46,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1888138361, now seen corresponding path program 3 times [2023-02-14 03:09:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:46,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376014368] [2023-02-14 03:09:46,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:46,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:46,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:46,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:46,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1126640613, now seen corresponding path program 5 times [2023-02-14 03:09:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:46,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236300692] [2023-02-14 03:09:46,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:46,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:46,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:46,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:47,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:47,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.02 03:09:47 BoogieIcfgContainer [2023-02-14 03:09:47,210 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-14 03:09:47,210 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 03:09:47,210 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 03:09:47,213 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 03:09:47,214 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:09:39" (3/4) ... [2023-02-14 03:09:47,216 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-14 03:09:47,256 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 03:09:47,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 03:09:47,256 INFO L158 Benchmark]: Toolchain (without parser) took 8198.58ms. Allocated memory was 115.3MB in the beginning and 182.5MB in the end (delta: 67.1MB). Free memory was 70.1MB in the beginning and 69.5MB in the end (delta: 649.1kB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2023-02-14 03:09:47,257 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 115.3MB. Free memory was 79.6MB in the beginning and 79.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 03:09:47,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.22ms. Allocated memory is still 115.3MB. Free memory was 69.8MB in the beginning and 60.9MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-14 03:09:47,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.68ms. Allocated memory is still 115.3MB. Free memory was 60.9MB in the beginning and 59.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 03:09:47,257 INFO L158 Benchmark]: Boogie Preprocessor took 13.71ms. Allocated memory is still 115.3MB. Free memory was 59.6MB in the beginning and 58.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 03:09:47,258 INFO L158 Benchmark]: RCFGBuilder took 254.86ms. Allocated memory was 115.3MB in the beginning and 151.0MB in the end (delta: 35.7MB). Free memory was 58.6MB in the beginning and 120.2MB in the end (delta: -61.7MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2023-02-14 03:09:47,258 INFO L158 Benchmark]: BuchiAutomizer took 7687.57ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 120.2MB in the beginning and 72.6MB in the end (delta: 47.7MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2023-02-14 03:09:47,258 INFO L158 Benchmark]: Witness Printer took 45.69ms. Allocated memory is still 182.5MB. Free memory was 72.6MB in the beginning and 69.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 03:09:47,260 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.32ms. Allocated memory is still 115.3MB. Free memory was 79.6MB in the beginning and 79.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.22ms. Allocated memory is still 115.3MB. Free memory was 69.8MB in the beginning and 60.9MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.68ms. Allocated memory is still 115.3MB. Free memory was 60.9MB in the beginning and 59.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.71ms. Allocated memory is still 115.3MB. Free memory was 59.6MB in the beginning and 58.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 254.86ms. Allocated memory was 115.3MB in the beginning and 151.0MB in the end (delta: 35.7MB). Free memory was 58.6MB in the beginning and 120.2MB in the end (delta: -61.7MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 7687.57ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 120.2MB in the beginning and 72.6MB in the end (delta: 47.7MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. * Witness Printer took 45.69ms. Allocated memory is still 182.5MB. Free memory was 72.6MB in the beginning and 69.5MB 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 15 terminating modules (8 trivial, 6 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 167 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.6s and 12 iterations. TraceHistogramMax:20. Analysis of lassos took 6.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 245 StatesRemovedByMinimization, 15 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 [6, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 164 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 538 IncrementalHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 135 mSDtfsCounter, 538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc2 concLT1 SILN0 SILU0 SILI2 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax165 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf94 smp100 dnf100 smp100 tf110 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 18]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i >= 10) VAL [i=0, up=0] [L15] COND TRUE i <= 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up >= 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i >= 10) VAL [i=1, up=1] [L15] COND FALSE !(i <= 0) VAL [i=1, up=1] Loop: [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 18]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i >= 10) VAL [i=0, up=0] [L15] COND TRUE i <= 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up >= 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i >= 10) VAL [i=1, up=1] [L15] COND FALSE !(i <= 0) VAL [i=1, up=1] Loop: [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-02-14 03:09:47,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2023-02-14 03:09:47,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2023-02-14 03:09:47,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:47,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-02-14 03:09:48,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)