./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/Narrowing.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/Narrowing.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --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 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:55:46,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:55:46,239 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-31 21:55:46,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:55:46,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:55:46,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:55:46,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:55:46,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:55:46,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:55:46,277 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:55:46,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:55:46,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:55:46,279 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:55:46,279 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-31 21:55:46,279 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-31 21:55:46,280 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-31 21:55:46,280 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-31 21:55:46,280 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-31 21:55:46,281 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-31 21:55:46,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:55:46,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-31 21:55:46,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:55:46,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:55:46,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-31 21:55:46,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-31 21:55:46,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-31 21:55:46,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:55:46,290 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 21:55:46,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:55:46,290 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-31 21:55:46,306 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:55:46,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:55:46,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:55:46,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:55:46,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:55:46,308 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-31 21:55:46,308 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac [2024-10-31 21:55:46,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:55:46,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:55:46,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:55:46,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:55:46,724 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:55:46,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/termination-restricted-15/Narrowing.c Unable to find full path for "g++" [2024-10-31 21:55:49,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:55:49,291 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:55:49,291 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2024-10-31 21:55:49,299 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/data/8a4d05379/000603214102460c86a88bbb49ff5dd7/FLAG6316c2cee [2024-10-31 21:55:49,623 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/data/8a4d05379/000603214102460c86a88bbb49ff5dd7 [2024-10-31 21:55:49,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:55:49,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:55:49,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:55:49,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:55:49,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:55:49,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:49,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378ef05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49, skipping insertion in model container [2024-10-31 21:55:49,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:49,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:55:49,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:55:49,907 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:55:49,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:55:49,940 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:55:49,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49 WrapperNode [2024-10-31 21:55:49,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:55:49,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:55:49,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:55:49,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:55:49,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:49,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:49,973 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2024-10-31 21:55:49,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:55:49,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:55:49,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:55:49,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:55:49,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:49,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:49,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:49,994 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-31 21:55:49,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:49,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:49,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:50,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:50,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:50,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:50,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:55:50,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:55:50,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:55:50,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:55:50,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49" (1/1) ... [2024-10-31 21:55:50,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:50,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:50,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:50,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-31 21:55:50,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:55:50,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:55:50,171 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:55:50,173 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:55:50,263 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-31 21:55:50,263 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:55:50,276 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:55:50,276 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:55:50,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:55:50 BoogieIcfgContainer [2024-10-31 21:55:50,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:55:50,278 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-31 21:55:50,278 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-31 21:55:50,282 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-31 21:55:50,283 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 21:55:50,283 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.10 09:55:49" (1/3) ... [2024-10-31 21:55:50,285 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@516e6beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 09:55:50, skipping insertion in model container [2024-10-31 21:55:50,285 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 21:55:50,285 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:49" (2/3) ... [2024-10-31 21:55:50,286 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@516e6beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 09:55:50, skipping insertion in model container [2024-10-31 21:55:50,286 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 21:55:50,286 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:55:50" (3/3) ... [2024-10-31 21:55:50,287 INFO L332 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2024-10-31 21:55:50,376 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-31 21:55:50,377 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-31 21:55:50,377 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-31 21:55:50,377 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-31 21:55:50,377 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-31 21:55:50,378 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-31 21:55:50,378 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-31 21:55:50,378 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-31 21:55:50,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:50,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-31 21:55:50,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:50,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:50,410 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 21:55:50,411 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-31 21:55:50,413 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-31 21:55:50,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:50,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-31 21:55:50,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:50,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:50,415 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 21:55:50,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-31 21:55:50,424 INFO L745 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 4#L26-1true [2024-10-31 21:55:50,425 INFO L747 eck$LassoCheckResult]: Loop: 4#L26-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 11#L14true assume !(0 == main_~i~0#1); 12#L14-2true assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 9#L17-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 7#L20-1true assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10#L23-1true assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4#L26-1true [2024-10-31 21:55:50,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:50,435 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-31 21:55:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:50,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479001954] [2024-10-31 21:55:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:50,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:50,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:50,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:50,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times [2024-10-31 21:55:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:50,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017573975] [2024-10-31 21:55:50,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:50,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:50,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:50,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017573975] [2024-10-31 21:55:50,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017573975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:50,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:50,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:55:50,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516216359] [2024-10-31 21:55:50,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:50,660 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 21:55:50,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:50,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:55:50,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:55:50,703 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:50,737 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2024-10-31 21:55:50,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. [2024-10-31 21:55:50,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-31 21:55:50,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 23 transitions. [2024-10-31 21:55:50,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-31 21:55:50,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-31 21:55:50,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2024-10-31 21:55:50,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 21:55:50,746 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2024-10-31 21:55:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2024-10-31 21:55:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-31 21:55:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2024-10-31 21:55:50,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2024-10-31 21:55:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:55:50,776 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2024-10-31 21:55:50,776 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-31 21:55:50,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2024-10-31 21:55:50,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-31 21:55:50,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:50,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:50,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 21:55:50,778 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-31 21:55:50,778 INFO L745 eck$LassoCheckResult]: Stem: 43#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 44#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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 48#L26-1 [2024-10-31 21:55:50,778 INFO L747 eck$LassoCheckResult]: Loop: 48#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 54#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 51#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 49#L17-1 assume !(1 == main_~up~0#1); 50#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 46#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 48#L26-1 [2024-10-31 21:55:50,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:50,779 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-31 21:55:50,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:50,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529454687] [2024-10-31 21:55:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:50,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:50,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:50,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:50,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1215977394, now seen corresponding path program 1 times [2024-10-31 21:55:50,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:50,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018335254] [2024-10-31 21:55:50,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:50,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:50,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:50,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018335254] [2024-10-31 21:55:50,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018335254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:50,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:50,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:55:50,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443579084] [2024-10-31 21:55:50,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:50,903 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 21:55:50,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:50,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:55:50,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:50,904 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. cyclomatic complexity: 10 Second operand has 4 states, 3 states have (on average 2.0) 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) [2024-10-31 21:55:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:51,007 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2024-10-31 21:55:51,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2024-10-31 21:55:51,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2024-10-31 21:55:51,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2024-10-31 21:55:51,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-10-31 21:55:51,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-10-31 21:55:51,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2024-10-31 21:55:51,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 21:55:51,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2024-10-31 21:55:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2024-10-31 21:55:51,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-31 21:55:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 37 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2024-10-31 21:55:51,018 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2024-10-31 21:55:51,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:55:51,020 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2024-10-31 21:55:51,020 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-31 21:55:51,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2024-10-31 21:55:51,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2024-10-31 21:55:51,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:51,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:51,022 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 21:55:51,022 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-31 21:55:51,023 INFO L745 eck$LassoCheckResult]: Stem: 102#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 103#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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 110#L26-1 [2024-10-31 21:55:51,025 INFO L747 eck$LassoCheckResult]: Loop: 110#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 125#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 119#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 115#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 116#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 121#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 110#L26-1 [2024-10-31 21:55:51,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:51,025 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-31 21:55:51,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:51,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907078753] [2024-10-31 21:55:51,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:51,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:51,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:51,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:51,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:51,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035056, now seen corresponding path program 1 times [2024-10-31 21:55:51,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:51,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52512199] [2024-10-31 21:55:51,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:51,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:51,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:51,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52512199] [2024-10-31 21:55:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52512199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:51,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:51,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:55:51,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256295697] [2024-10-31 21:55:51,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:51,076 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 21:55:51,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:51,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:55:51,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:55:51,078 INFO L87 Difference]: Start difference. First operand 38 states and 61 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:51,103 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2024-10-31 21:55:51,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2024-10-31 21:55:51,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2024-10-31 21:55:51,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2024-10-31 21:55:51,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-10-31 21:55:51,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-10-31 21:55:51,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2024-10-31 21:55:51,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 21:55:51,107 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2024-10-31 21:55:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2024-10-31 21:55:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2024-10-31 21:55:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2024-10-31 21:55:51,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-10-31 21:55:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:55:51,113 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-10-31 21:55:51,114 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-31 21:55:51,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2024-10-31 21:55:51,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-10-31 21:55:51,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:51,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:51,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 21:55:51,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-31 21:55:51,116 INFO L745 eck$LassoCheckResult]: Stem: 184#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 185#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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 188#L26-1 [2024-10-31 21:55:51,116 INFO L747 eck$LassoCheckResult]: Loop: 188#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 199#L14 assume !(0 == main_~i~0#1); 205#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 203#L17-1 assume !(1 == main_~up~0#1); 202#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 200#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 188#L26-1 [2024-10-31 21:55:51,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:51,117 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-31 21:55:51,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:51,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206159215] [2024-10-31 21:55:51,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:51,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:51,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:51,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:51,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:51,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times [2024-10-31 21:55:51,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646420191] [2024-10-31 21:55:51,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:51,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:51,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:51,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:51,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:51,147 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times [2024-10-31 21:55:51,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:51,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301340216] [2024-10-31 21:55:51,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:51,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:51,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:51,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:51,324 INFO L204 LassoAnalysis]: Preferences: [2024-10-31 21:55:51,325 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-31 21:55:51,325 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-31 21:55:51,325 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-31 21:55:51,325 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-31 21:55:51,325 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:51,326 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-31 21:55:51,326 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-31 21:55:51,326 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2024-10-31 21:55:51,326 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-31 21:55:51,327 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-31 21:55:51,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:51,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:51,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:51,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:51,524 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-31 21:55:51,525 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-31 21:55:51,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:51,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:51,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:51,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-31 21:55:51,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-31 21:55:51,532 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-31 21:55:51,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-31 21:55:51,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:51,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:51,564 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:51,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-31 21:55:51,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-31 21:55:51,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-31 21:55:51,614 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-31 21:55:51,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-31 21:55:51,617 INFO L204 LassoAnalysis]: Preferences: [2024-10-31 21:55:51,617 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-31 21:55:51,618 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-31 21:55:51,618 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-31 21:55:51,618 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-31 21:55:51,618 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:51,618 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-31 21:55:51,618 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-31 21:55:51,619 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2024-10-31 21:55:51,619 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-31 21:55:51,619 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-31 21:55:51,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:51,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:51,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:51,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:51,772 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-31 21:55:51,778 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-31 21:55:51,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:51,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:51,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:51,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-31 21:55:51,793 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 [2024-10-31 21:55:51,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 21:55:51,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 21:55:51,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 21:55:51,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 21:55:51,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 21:55:51,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 21:55:51,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 21:55:51,813 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-31 21:55:51,819 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-31 21:55:51,819 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-31 21:55:51,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:51,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:51,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:51,846 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-31 21:55:51,847 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-31 21:55:51,847 INFO L474 LassoAnalysis]: Proved termination. [2024-10-31 21:55:51,848 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-31 21:55:51,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-31 21:55:51,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-31 21:55:51,871 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-31 21:55:51,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 21:55:51,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 21:55:51,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:52,030 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 [2024-10-31 21:55:52,032 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:52,119 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 100 states and 152 transitions. Complement of second has 7 states. [2024-10-31 21:55:52,123 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 [2024-10-31 21:55:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-31 21:55:52,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2024-10-31 21:55:52,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 21:55:52,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2024-10-31 21:55:52,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 21:55:52,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2024-10-31 21:55:52,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 21:55:52,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2024-10-31 21:55:52,135 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2024-10-31 21:55:52,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2024-10-31 21:55:52,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2024-10-31 21:55:52,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-10-31 21:55:52,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2024-10-31 21:55:52,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 21:55:52,142 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2024-10-31 21:55:52,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2024-10-31 21:55:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2024-10-31 21:55:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2024-10-31 21:55:52,155 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2024-10-31 21:55:52,155 INFO L425 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2024-10-31 21:55:52,155 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-31 21:55:52,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2024-10-31 21:55:52,157 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2024-10-31 21:55:52,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:52,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:52,158 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 21:55:52,158 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-31 21:55:52,158 INFO L745 eck$LassoCheckResult]: Stem: 365#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 366#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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 376#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 384#L14 [2024-10-31 21:55:52,158 INFO L747 eck$LassoCheckResult]: Loop: 384#L14 assume !(0 == main_~i~0#1); 435#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 431#L17-1 assume !(1 == main_~up~0#1); 428#L20-1 assume !(0 == main_~up~0#1); 424#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 423#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 384#L14 [2024-10-31 21:55:52,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:52,159 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-10-31 21:55:52,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:52,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184979716] [2024-10-31 21:55:52,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:52,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:52,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times [2024-10-31 21:55:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:52,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657000359] [2024-10-31 21:55:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:52,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:52,185 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times [2024-10-31 21:55:52,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:52,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189522192] [2024-10-31 21:55:52,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:52,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:52,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189522192] [2024-10-31 21:55:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189522192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:52,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:52,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:55:52,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836279790] [2024-10-31 21:55:52,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:52,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:52,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:55:52,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:55:52,282 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. cyclomatic complexity: 54 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) [2024-10-31 21:55:52,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:52,300 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2024-10-31 21:55:52,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2024-10-31 21:55:52,302 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2024-10-31 21:55:52,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2024-10-31 21:55:52,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-10-31 21:55:52,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-10-31 21:55:52,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2024-10-31 21:55:52,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 21:55:52,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2024-10-31 21:55:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2024-10-31 21:55:52,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2024-10-31 21:55:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 64 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2024-10-31 21:55:52,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2024-10-31 21:55:52,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:55:52,320 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2024-10-31 21:55:52,322 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-31 21:55:52,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2024-10-31 21:55:52,323 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2024-10-31 21:55:52,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:52,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:52,327 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-31 21:55:52,327 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-31 21:55:52,328 INFO L745 eck$LassoCheckResult]: Stem: 539#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 540#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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 550#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 568#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 582#L14-2 [2024-10-31 21:55:52,328 INFO L747 eck$LassoCheckResult]: Loop: 582#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 593#L17-1 assume !(1 == main_~up~0#1); 591#L20-1 assume !(0 == main_~up~0#1); 588#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 535#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 536#L14 assume !(0 == main_~i~0#1); 582#L14-2 [2024-10-31 21:55:52,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:52,328 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2024-10-31 21:55:52,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:52,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065239422] [2024-10-31 21:55:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:52,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:52,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times [2024-10-31 21:55:52,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:52,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439731794] [2024-10-31 21:55:52,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:52,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:52,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times [2024-10-31 21:55:52,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:52,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285223597] [2024-10-31 21:55:52,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:52,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:52,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285223597] [2024-10-31 21:55:52,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285223597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:52,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:52,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:55:52,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460203963] [2024-10-31 21:55:52,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:52,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:52,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:55:52,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:55:52,477 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:52,490 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2024-10-31 21:55:52,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2024-10-31 21:55:52,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-31 21:55:52,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2024-10-31 21:55:52,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-31 21:55:52,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-10-31 21:55:52,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2024-10-31 21:55:52,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 21:55:52,492 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2024-10-31 21:55:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2024-10-31 21:55:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2024-10-31 21:55:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-10-31 21:55:52,498 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-10-31 21:55:52,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:55:52,502 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-10-31 21:55:52,502 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-31 21:55:52,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2024-10-31 21:55:52,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-31 21:55:52,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:52,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:52,503 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-31 21:55:52,503 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-31 21:55:52,504 INFO L745 eck$LassoCheckResult]: Stem: 661#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 662#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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 675#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 658#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 676#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 682#L17-1 [2024-10-31 21:55:52,504 INFO L747 eck$LassoCheckResult]: Loop: 682#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 663#L20-1 assume !(0 == main_~up~0#1); 664#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 689#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 690#L14 assume !(0 == main_~i~0#1); 684#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 682#L17-1 [2024-10-31 21:55:52,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:52,504 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2024-10-31 21:55:52,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:52,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760750827] [2024-10-31 21:55:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:52,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:52,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times [2024-10-31 21:55:52,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:52,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097879568] [2024-10-31 21:55:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:52,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:52,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times [2024-10-31 21:55:52,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:52,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930742874] [2024-10-31 21:55:52,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:52,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:52,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-31 21:55:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:52,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:52,690 INFO L204 LassoAnalysis]: Preferences: [2024-10-31 21:55:52,690 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-31 21:55:52,690 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-31 21:55:52,690 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-31 21:55:52,690 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-31 21:55:52,690 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:52,690 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-31 21:55:52,691 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-31 21:55:52,691 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2024-10-31 21:55:52,691 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-31 21:55:52,691 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-31 21:55:52,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:52,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:52,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:52,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:52,863 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-31 21:55:52,863 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-31 21:55:52,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:52,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:52,867 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:52,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-31 21:55:52,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-31 21:55:52,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-31 21:55:52,896 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-31 21:55:52,896 INFO L401 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: [] [2024-10-31 21:55:52,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-31 21:55:52,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:52,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:52,917 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:52,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-31 21:55:52,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-31 21:55:52,920 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-31 21:55:52,945 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-31 21:55:52,945 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-31 21:55:52,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-31 21:55:52,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:52,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:52,967 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:52,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-31 21:55:52,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-31 21:55:52,969 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-31 21:55:52,986 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-31 21:55:52,986 INFO L401 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: [] [2024-10-31 21:55:53,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-31 21:55:53,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:53,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:53,006 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:53,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-31 21:55:53,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-31 21:55:53,010 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-31 21:55:53,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-31 21:55:53,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:53,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:53,045 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:53,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-31 21:55:53,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-31 21:55:53,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-31 21:55:53,321 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-31 21:55:53,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-31 21:55:53,324 INFO L204 LassoAnalysis]: Preferences: [2024-10-31 21:55:53,325 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-31 21:55:53,325 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-31 21:55:53,325 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-31 21:55:53,325 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-31 21:55:53,325 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:53,325 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-31 21:55:53,325 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-31 21:55:53,325 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2024-10-31 21:55:53,325 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-31 21:55:53,325 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-31 21:55:53,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:53,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:53,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:53,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:53,489 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-31 21:55:53,489 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-31 21:55:53,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:53,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:53,491 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:53,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-31 21:55:53,493 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 [2024-10-31 21:55:53,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 21:55:53,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 21:55:53,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 21:55:53,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 21:55:53,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 21:55:53,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 21:55:53,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 21:55:53,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-31 21:55:53,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:53,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:53,538 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:53,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-31 21:55:53,540 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 [2024-10-31 21:55:53,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 21:55:53,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 21:55:53,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 21:55:53,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 21:55:53,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 21:55:53,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 21:55:53,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 21:55:53,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-31 21:55:53,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:53,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:53,582 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:53,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-31 21:55:53,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 21:55:53,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 21:55:53,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 21:55:53,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 21:55:53,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 21:55:53,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 21:55:53,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 21:55:53,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 21:55:53,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 21:55:53,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-31 21:55:53,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:53,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:53,627 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:53,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-31 21:55:53,629 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 [2024-10-31 21:55:53,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 21:55:53,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 21:55:53,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 21:55:53,644 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-31 21:55:53,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 21:55:53,648 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-31 21:55:53,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 21:55:53,657 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-31 21:55:53,662 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-31 21:55:53,662 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-31 21:55:53,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:53,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:53,668 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:53,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-31 21:55:53,670 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-31 21:55:53,670 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-31 21:55:53,671 INFO L474 LassoAnalysis]: Proved termination. [2024-10-31 21:55:53,671 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2024-10-31 21:55:53,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-31 21:55:53,691 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-31 21:55:53,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:53,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 21:55:53,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:53,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 21:55:53,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:53,818 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 [2024-10-31 21:55:53,818 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:53,879 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 124 transitions. Complement of second has 7 states. [2024-10-31 21:55:53,883 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 [2024-10-31 21:55:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2024-10-31 21:55:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2024-10-31 21:55:53,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 21:55:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2024-10-31 21:55:53,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 21:55:53,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2024-10-31 21:55:53,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 21:55:53,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions. [2024-10-31 21:55:53,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-31 21:55:53,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions. [2024-10-31 21:55:53,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-31 21:55:53,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-10-31 21:55:53,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions. [2024-10-31 21:55:53,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 21:55:53,892 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 107 transitions. [2024-10-31 21:55:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions. [2024-10-31 21:55:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-10-31 21:55:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 71 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2024-10-31 21:55:53,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 101 transitions. [2024-10-31 21:55:53,900 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2024-10-31 21:55:53,901 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-31 21:55:53,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2024-10-31 21:55:53,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-31 21:55:53,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:53,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:53,904 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:53,904 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-31 21:55:53,905 INFO L745 eck$LassoCheckResult]: Stem: 851#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 852#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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 863#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 903#L14 assume !(0 == main_~i~0#1); 904#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 861#L17-1 assume !(1 == main_~up~0#1); 862#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 894#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 895#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 917#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 916#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 915#L17-1 [2024-10-31 21:55:53,905 INFO L747 eck$LassoCheckResult]: Loop: 915#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 914#L20-1 assume !(0 == main_~up~0#1); 857#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 858#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 882#L14 assume !(0 == main_~i~0#1); 880#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 915#L17-1 [2024-10-31 21:55:53,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:53,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times [2024-10-31 21:55:53,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:53,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847387223] [2024-10-31 21:55:53,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:53,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:53,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:53,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847387223] [2024-10-31 21:55:53,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847387223] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:55:53,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078909435] [2024-10-31 21:55:53,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:53,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:55:53,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:53,990 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:55:53,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-31 21:55:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:54,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 21:55:54,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:54,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:55:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:54,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078909435] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:55:54,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:55:54,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-31 21:55:54,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886419352] [2024-10-31 21:55:54,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:55:54,098 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-31 21:55:54,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times [2024-10-31 21:55:54,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:54,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793422654] [2024-10-31 21:55:54,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:54,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:54,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:54,188 INFO L204 LassoAnalysis]: Preferences: [2024-10-31 21:55:54,188 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-31 21:55:54,188 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-31 21:55:54,188 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-31 21:55:54,189 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-31 21:55:54,189 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:54,189 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-31 21:55:54,189 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-31 21:55:54,189 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2024-10-31 21:55:54,189 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-31 21:55:54,189 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-31 21:55:54,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:54,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:54,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:54,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:54,362 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-31 21:55:54,366 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-31 21:55:54,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:54,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:54,371 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:54,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-31 21:55:54,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-31 21:55:54,375 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-31 21:55:54,400 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-31 21:55:54,400 INFO L401 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: [] [2024-10-31 21:55:54,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-31 21:55:54,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:54,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:54,420 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:54,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-31 21:55:54,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-31 21:55:54,422 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-31 21:55:54,439 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-31 21:55:54,440 INFO L401 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: [] [2024-10-31 21:55:54,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-31 21:55:54,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:54,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:54,459 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:54,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-31 21:55:54,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-31 21:55:54,465 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-31 21:55:54,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-31 21:55:54,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:54,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:54,502 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:54,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-31 21:55:54,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-31 21:55:54,505 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-31 21:55:54,731 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-31 21:55:54,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-31 21:55:54,735 INFO L204 LassoAnalysis]: Preferences: [2024-10-31 21:55:54,735 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-31 21:55:54,735 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-31 21:55:54,735 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-31 21:55:54,736 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-31 21:55:54,736 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:54,736 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-31 21:55:54,736 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-31 21:55:54,736 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2024-10-31 21:55:54,736 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-31 21:55:54,736 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-31 21:55:54,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:54,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:54,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:54,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 21:55:54,901 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-31 21:55:54,902 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-31 21:55:54,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:54,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:54,904 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:54,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-31 21:55:54,907 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 [2024-10-31 21:55:54,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 21:55:54,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 21:55:54,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 21:55:54,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 21:55:54,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 21:55:54,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 21:55:54,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 21:55:54,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 21:55:54,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-31 21:55:54,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:54,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:54,948 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:54,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-31 21:55:54,951 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 [2024-10-31 21:55:54,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 21:55:54,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 21:55:54,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 21:55:54,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 21:55:54,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 21:55:54,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 21:55:54,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 21:55:54,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-31 21:55:54,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:54,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:54,993 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:54,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-31 21:55:54,999 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 [2024-10-31 21:55:55,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 21:55:55,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 21:55:55,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 21:55:55,011 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-31 21:55:55,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 21:55:55,013 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-31 21:55:55,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 21:55:55,018 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-31 21:55:55,023 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-31 21:55:55,023 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-31 21:55:55,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:55:55,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:55,025 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:55,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-31 21:55:55,027 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-31 21:55:55,028 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-31 21:55:55,028 INFO L474 LassoAnalysis]: Proved termination. [2024-10-31 21:55:55,028 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2024-10-31 21:55:55,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-31 21:55:55,048 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-31 21:55:55,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:55,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 21:55:55,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:55,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 21:55:55,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:55,149 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 [2024-10-31 21:55:55,149 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:55,193 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 96 states and 136 transitions. Complement of second has 7 states. [2024-10-31 21:55:55,193 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 [2024-10-31 21:55:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2024-10-31 21:55:55,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2024-10-31 21:55:55,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 21:55:55,195 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-31 21:55:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:55,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 21:55:55,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:55,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 21:55:55,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:55,293 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-31 21:55:55,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:55,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-31 21:55:55,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-31 21:55:55,398 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 125 states and 174 transitions. Complement of second has 9 states. [2024-10-31 21:55:55,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-31 21:55:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2024-10-31 21:55:55,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2024-10-31 21:55:55,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 21:55:55,402 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-31 21:55:55,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:55,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 21:55:55,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:55,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 21:55:55,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:55,504 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 3 loop predicates [2024-10-31 21:55:55,505 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:55,549 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 113 states and 165 transitions. Complement of second has 8 states. [2024-10-31 21:55:55,551 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 [2024-10-31 21:55:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2024-10-31 21:55:55,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 6 letters. [2024-10-31 21:55:55,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 21:55:55,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 17 letters. Loop has 6 letters. [2024-10-31 21:55:55,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 21:55:55,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 12 letters. [2024-10-31 21:55:55,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 21:55:55,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 165 transitions. [2024-10-31 21:55:55,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2024-10-31 21:55:55,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 85 states and 121 transitions. [2024-10-31 21:55:55,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-31 21:55:55,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-10-31 21:55:55,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 121 transitions. [2024-10-31 21:55:55,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 21:55:55,560 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-10-31 21:55:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 121 transitions. [2024-10-31 21:55:55,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2024-10-31 21:55:55,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.46) internal successors, (73), 49 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-10-31 21:55:55,564 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-10-31 21:55:55,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:55,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:55:55,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:55:55,566 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:55,676 INFO L93 Difference]: Finished difference Result 209 states and 277 transitions. [2024-10-31 21:55:55,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 277 transitions. [2024-10-31 21:55:55,678 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2024-10-31 21:55:55,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 199 states and 266 transitions. [2024-10-31 21:55:55,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-10-31 21:55:55,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-10-31 21:55:55,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 266 transitions. [2024-10-31 21:55:55,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 21:55:55,680 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 266 transitions. [2024-10-31 21:55:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 266 transitions. [2024-10-31 21:55:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2024-10-31 21:55:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.3505747126436782) internal successors, (235), 173 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2024-10-31 21:55:55,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 235 transitions. [2024-10-31 21:55:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 21:55:55,692 INFO L425 stractBuchiCegarLoop]: Abstraction has 174 states and 235 transitions. [2024-10-31 21:55:55,696 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-31 21:55:55,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 235 transitions. [2024-10-31 21:55:55,697 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2024-10-31 21:55:55,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:55,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:55,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-31 21:55:55,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-31 21:55:55,698 INFO L745 eck$LassoCheckResult]: Stem: 1785#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1786#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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 1791#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1869#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1868#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1851#L17-1 [2024-10-31 21:55:55,698 INFO L747 eck$LassoCheckResult]: Loop: 1851#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1864#L20-1 assume !(0 == main_~up~0#1); 1862#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1858#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1853#L14 assume !(0 == main_~i~0#1); 1850#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 1840#L17-1 assume !(1 == main_~up~0#1); 1848#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1849#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1847#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1845#L14 assume !(0 == main_~i~0#1); 1839#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1836#L17-1 assume !(1 == main_~up~0#1); 1834#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1831#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1832#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1843#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1844#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1851#L17-1 [2024-10-31 21:55:55,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:55,698 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 2 times [2024-10-31 21:55:55,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:55,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137757] [2024-10-31 21:55:55,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:55,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:55,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:55,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:55,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times [2024-10-31 21:55:55,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:55,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175066957] [2024-10-31 21:55:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:55,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:55,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:55,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175066957] [2024-10-31 21:55:55,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175066957] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:55:55,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847475643] [2024-10-31 21:55:55,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:55,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:55:55,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:55,946 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:55:55,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-31 21:55:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:55,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-31 21:55:55,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:56,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:55:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:56,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847475643] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:55:56,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:55:56,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2024-10-31 21:55:56,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446884675] [2024-10-31 21:55:56,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:55:56,057 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 21:55:56,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:56,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 21:55:56,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:55:56,058 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. cyclomatic complexity: 69 Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 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) [2024-10-31 21:55:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:56,262 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2024-10-31 21:55:56,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2024-10-31 21:55:56,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-10-31 21:55:56,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 120 transitions. [2024-10-31 21:55:56,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-10-31 21:55:56,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2024-10-31 21:55:56,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 120 transitions. [2024-10-31 21:55:56,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 21:55:56,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 120 transitions. [2024-10-31 21:55:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 120 transitions. [2024-10-31 21:55:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2024-10-31 21:55:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 88 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2024-10-31 21:55:56,273 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 101 transitions. [2024-10-31 21:55:56,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 21:55:56,274 INFO L425 stractBuchiCegarLoop]: Abstraction has 89 states and 101 transitions. [2024-10-31 21:55:56,274 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-31 21:55:56,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 101 transitions. [2024-10-31 21:55:56,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-31 21:55:56,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:56,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:56,280 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1] [2024-10-31 21:55:56,280 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:56,280 INFO L745 eck$LassoCheckResult]: Stem: 2198#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2199#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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2204#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2230#L14 assume !(0 == main_~i~0#1); 2228#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2226#L17-1 assume !(1 == main_~up~0#1); 2224#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2219#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2196#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2197#L14 assume !(0 == main_~i~0#1); 2214#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2207#L17-1 assume !(1 == main_~up~0#1); 2208#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2217#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2248#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2258#L14 assume !(0 == main_~i~0#1); 2256#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2254#L17-1 assume !(1 == main_~up~0#1); 2251#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2246#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2247#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2242#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2243#L14-2 [2024-10-31 21:55:56,281 INFO L747 eck$LassoCheckResult]: Loop: 2243#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2205#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2206#L20-1 assume !(0 == main_~up~0#1); 2274#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2273#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2272#L14 assume !(0 == main_~i~0#1); 2270#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2269#L17-1 assume !(1 == main_~up~0#1); 2253#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2250#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2244#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2245#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2243#L14-2 [2024-10-31 21:55:56,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:56,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2020896569, now seen corresponding path program 2 times [2024-10-31 21:55:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:56,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380389030] [2024-10-31 21:55:56,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:56,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:56,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380389030] [2024-10-31 21:55:56,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380389030] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:55:56,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088247091] [2024-10-31 21:55:56,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-31 21:55:56,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:55:56,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:56,385 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:55:56,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-31 21:55:56,423 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-31 21:55:56,424 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 21:55:56,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 21:55:56,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:56,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:55:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088247091] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:55:56,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:55:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-31 21:55:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493482942] [2024-10-31 21:55:56,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:55:56,547 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-31 21:55:56,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 2 times [2024-10-31 21:55:56,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:56,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056179326] [2024-10-31 21:55:56,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:56,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:56,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:56,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:56,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:56,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 21:55:56,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:55:56,625 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. cyclomatic complexity: 16 Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:56,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:56,805 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2024-10-31 21:55:56,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2024-10-31 21:55:56,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-31 21:55:56,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 151 states and 163 transitions. [2024-10-31 21:55:56,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2024-10-31 21:55:56,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2024-10-31 21:55:56,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 163 transitions. [2024-10-31 21:55:56,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 21:55:56,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 163 transitions. [2024-10-31 21:55:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 163 transitions. [2024-10-31 21:55:56,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2024-10-31 21:55:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.0875912408759123) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-10-31 21:55:56,813 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-10-31 21:55:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-31 21:55:56,814 INFO L425 stractBuchiCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-10-31 21:55:56,814 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-31 21:55:56,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 149 transitions. [2024-10-31 21:55:56,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-31 21:55:56,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:56,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:56,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1] [2024-10-31 21:55:56,816 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:56,817 INFO L745 eck$LassoCheckResult]: Stem: 2604#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2605#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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2616#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2639#L14 assume !(0 == main_~i~0#1); 2636#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2633#L17-1 assume !(1 == main_~up~0#1); 2630#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2625#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2624#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2726#L14 assume !(0 == main_~i~0#1); 2621#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2612#L17-1 assume !(1 == main_~up~0#1); 2613#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2622#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2723#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2722#L14 assume !(0 == main_~i~0#1); 2721#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2720#L17-1 assume !(1 == main_~up~0#1); 2719#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2718#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2717#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2716#L14 assume !(0 == main_~i~0#1); 2715#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2714#L17-1 assume !(1 == main_~up~0#1); 2713#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2712#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2711#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2710#L14 assume !(0 == main_~i~0#1); 2709#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2708#L17-1 assume !(1 == main_~up~0#1); 2707#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2706#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2705#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2704#L14 assume !(0 == main_~i~0#1); 2703#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2702#L17-1 assume !(1 == main_~up~0#1); 2701#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2700#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2656#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2697#L14 assume !(0 == main_~i~0#1); 2669#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2667#L17-1 assume !(1 == main_~up~0#1); 2659#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2654#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2655#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2649#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2650#L14-2 [2024-10-31 21:55:56,817 INFO L747 eck$LassoCheckResult]: Loop: 2650#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2610#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2611#L20-1 assume !(0 == main_~up~0#1); 2665#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2664#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2663#L14 assume !(0 == main_~i~0#1); 2662#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2661#L17-1 assume !(1 == main_~up~0#1); 2660#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2657#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2651#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2652#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2650#L14-2 [2024-10-31 21:55:56,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:56,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1325721725, now seen corresponding path program 3 times [2024-10-31 21:55:56,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:56,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192399494] [2024-10-31 21:55:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:56,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:56,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:56,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192399494] [2024-10-31 21:55:56,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192399494] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:55:56,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638286743] [2024-10-31 21:55:56,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-31 21:55:56,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:55:56,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:56,983 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:55:56,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-31 21:55:57,033 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-31 21:55:57,033 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 21:55:57,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-31 21:55:57,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:57,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:55:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:57,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638286743] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:55:57,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:55:57,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-10-31 21:55:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021842003] [2024-10-31 21:55:57,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:55:57,341 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-31 21:55:57,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:57,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times [2024-10-31 21:55:57,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:57,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124681724] [2024-10-31 21:55:57,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:57,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:57,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:57,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:57,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-31 21:55:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2024-10-31 21:55:57,432 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. cyclomatic complexity: 16 Second operand has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:57,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:57,765 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions. [2024-10-31 21:55:57,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 275 transitions. [2024-10-31 21:55:57,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-31 21:55:57,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 247 states and 259 transitions. [2024-10-31 21:55:57,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2024-10-31 21:55:57,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2024-10-31 21:55:57,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 259 transitions. [2024-10-31 21:55:57,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 21:55:57,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 247 states and 259 transitions. [2024-10-31 21:55:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 259 transitions. [2024-10-31 21:55:57,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2024-10-31 21:55:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 233 states have (on average 1.0515021459227467) internal successors, (245), 232 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 245 transitions. [2024-10-31 21:55:57,776 INFO L240 hiAutomatonCegarLoop]: Abstraction has 233 states and 245 transitions. [2024-10-31 21:55:57,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-31 21:55:57,777 INFO L425 stractBuchiCegarLoop]: Abstraction has 233 states and 245 transitions. [2024-10-31 21:55:57,777 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-31 21:55:57,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 245 transitions. [2024-10-31 21:55:57,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-31 21:55:57,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:57,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:57,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 15, 15, 15, 15, 15, 1, 1, 1] [2024-10-31 21:55:57,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:57,782 INFO L745 eck$LassoCheckResult]: Stem: 3322#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3323#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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 3333#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3348#L14 assume !(0 == main_~i~0#1); 3346#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3345#L17-1 assume !(1 == main_~up~0#1); 3344#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3341#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3340#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3335#L14 assume !(0 == main_~i~0#1); 3336#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3332#L17-1 assume !(1 == main_~up~0#1); 3326#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3327#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3538#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3537#L14 assume !(0 == main_~i~0#1); 3536#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3535#L17-1 assume !(1 == main_~up~0#1); 3534#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3533#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3532#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3531#L14 assume !(0 == main_~i~0#1); 3530#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3529#L17-1 assume !(1 == main_~up~0#1); 3528#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3527#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3526#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3525#L14 assume !(0 == main_~i~0#1); 3524#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3523#L17-1 assume !(1 == main_~up~0#1); 3522#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3521#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3520#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3519#L14 assume !(0 == main_~i~0#1); 3518#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3517#L17-1 assume !(1 == main_~up~0#1); 3516#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3515#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3514#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3513#L14 assume !(0 == main_~i~0#1); 3512#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3511#L17-1 assume !(1 == main_~up~0#1); 3510#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3509#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3508#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3507#L14 assume !(0 == main_~i~0#1); 3506#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3505#L17-1 assume !(1 == main_~up~0#1); 3504#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3503#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3502#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3501#L14 assume !(0 == main_~i~0#1); 3500#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3499#L17-1 assume !(1 == main_~up~0#1); 3498#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3497#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3496#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3495#L14 assume !(0 == main_~i~0#1); 3494#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3493#L17-1 assume !(1 == main_~up~0#1); 3492#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3491#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3490#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3489#L14 assume !(0 == main_~i~0#1); 3488#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3487#L17-1 assume !(1 == main_~up~0#1); 3486#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3485#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3484#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3483#L14 assume !(0 == main_~i~0#1); 3482#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3481#L17-1 assume !(1 == main_~up~0#1); 3480#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3479#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3478#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3477#L14 assume !(0 == main_~i~0#1); 3476#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3475#L17-1 assume !(1 == main_~up~0#1); 3474#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3473#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3472#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3471#L14 assume !(0 == main_~i~0#1); 3470#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3469#L17-1 assume !(1 == main_~up~0#1); 3468#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3467#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3371#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3390#L14 assume !(0 == main_~i~0#1); 3388#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3383#L17-1 assume !(1 == main_~up~0#1); 3375#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3370#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3372#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3366#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3367#L14-2 [2024-10-31 21:55:57,782 INFO L747 eck$LassoCheckResult]: Loop: 3367#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3330#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3331#L20-1 assume !(0 == main_~up~0#1); 3382#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3381#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3380#L14 assume !(0 == main_~i~0#1); 3379#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 3378#L17-1 assume !(1 == main_~up~0#1); 3377#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3374#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3368#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3369#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3367#L14-2 [2024-10-31 21:55:57,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:57,782 INFO L85 PathProgramCache]: Analyzing trace with hash -944359675, now seen corresponding path program 4 times [2024-10-31 21:55:57,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:57,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326556885] [2024-10-31 21:55:57,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:57,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:58,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:58,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326556885] [2024-10-31 21:55:58,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326556885] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:55:58,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20267495] [2024-10-31 21:55:58,250 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-31 21:55:58,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:55:58,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:58,252 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:55:58,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-10-31 21:55:58,324 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-31 21:55:58,324 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 21:55:58,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-31 21:55:58,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:55:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:58,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:55:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:58,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20267495] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:55:58,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:55:58,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 22 [2024-10-31 21:55:58,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641961927] [2024-10-31 21:55:58,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:55:58,926 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-31 21:55:58,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:58,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times [2024-10-31 21:55:58,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:58,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203451980] [2024-10-31 21:55:58,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:58,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:58,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:58,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:59,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:59,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-31 21:55:59,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=307, Unknown=0, NotChecked=0, Total=506 [2024-10-31 21:55:59,005 INFO L87 Difference]: Start difference. First operand 233 states and 245 transitions. cyclomatic complexity: 16 Second operand has 23 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 23 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:59,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:59,276 INFO L93 Difference]: Finished difference Result 303 states and 315 transitions. [2024-10-31 21:55:59,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 315 transitions. [2024-10-31 21:55:59,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-31 21:55:59,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 295 states and 307 transitions. [2024-10-31 21:55:59,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2024-10-31 21:55:59,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2024-10-31 21:55:59,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 307 transitions. [2024-10-31 21:55:59,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 21:55:59,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 307 transitions. [2024-10-31 21:55:59,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 307 transitions. [2024-10-31 21:55:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 281. [2024-10-31 21:55:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 281 states have (on average 1.0427046263345197) internal successors, (293), 280 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 293 transitions. [2024-10-31 21:55:59,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 281 states and 293 transitions. [2024-10-31 21:55:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-31 21:55:59,289 INFO L425 stractBuchiCegarLoop]: Abstraction has 281 states and 293 transitions. [2024-10-31 21:55:59,289 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-31 21:55:59,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 281 states and 293 transitions. [2024-10-31 21:55:59,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-31 21:55:59,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:55:59,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:55:59,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 19, 19, 19, 19, 19, 1, 1, 1] [2024-10-31 21:55:59,293 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:59,293 INFO L745 eck$LassoCheckResult]: Stem: 4460#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4461#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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 4466#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4486#L14 assume !(0 == main_~i~0#1); 4484#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4483#L17-1 assume !(1 == main_~up~0#1); 4482#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4479#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4478#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4474#L14 assume !(0 == main_~i~0#1); 4475#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4469#L17-1 assume !(1 == main_~up~0#1); 4470#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4476#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4621#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4620#L14 assume !(0 == main_~i~0#1); 4619#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4618#L17-1 assume !(1 == main_~up~0#1); 4617#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4616#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4615#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4614#L14 assume !(0 == main_~i~0#1); 4613#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4612#L17-1 assume !(1 == main_~up~0#1); 4611#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4610#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4609#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4608#L14 assume !(0 == main_~i~0#1); 4607#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4606#L17-1 assume !(1 == main_~up~0#1); 4605#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4604#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4603#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4602#L14 assume !(0 == main_~i~0#1); 4601#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4600#L17-1 assume !(1 == main_~up~0#1); 4599#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4598#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4597#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4596#L14 assume !(0 == main_~i~0#1); 4595#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4594#L17-1 assume !(1 == main_~up~0#1); 4593#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4592#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4591#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4590#L14 assume !(0 == main_~i~0#1); 4589#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4588#L17-1 assume !(1 == main_~up~0#1); 4587#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4586#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4585#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4584#L14 assume !(0 == main_~i~0#1); 4583#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4582#L17-1 assume !(1 == main_~up~0#1); 4581#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4580#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4579#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4578#L14 assume !(0 == main_~i~0#1); 4577#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4576#L17-1 assume !(1 == main_~up~0#1); 4575#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4574#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4573#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4572#L14 assume !(0 == main_~i~0#1); 4571#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4570#L17-1 assume !(1 == main_~up~0#1); 4569#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4568#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4567#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4566#L14 assume !(0 == main_~i~0#1); 4565#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4564#L17-1 assume !(1 == main_~up~0#1); 4563#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4562#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4561#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4560#L14 assume !(0 == main_~i~0#1); 4559#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4558#L17-1 assume !(1 == main_~up~0#1); 4557#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4556#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4555#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4554#L14 assume !(0 == main_~i~0#1); 4553#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4552#L17-1 assume !(1 == main_~up~0#1); 4551#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4550#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4549#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4548#L14 assume !(0 == main_~i~0#1); 4547#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4546#L17-1 assume !(1 == main_~up~0#1); 4545#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4544#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4543#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4542#L14 assume !(0 == main_~i~0#1); 4541#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4540#L17-1 assume !(1 == main_~up~0#1); 4539#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4538#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4537#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4536#L14 assume !(0 == main_~i~0#1); 4535#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4534#L17-1 assume !(1 == main_~up~0#1); 4533#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4532#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4531#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4530#L14 assume !(0 == main_~i~0#1); 4529#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4528#L17-1 assume !(1 == main_~up~0#1); 4527#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4526#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4501#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4513#L14 assume !(0 == main_~i~0#1); 4509#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4506#L17-1 assume !(1 == main_~up~0#1); 4503#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4500#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4502#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4511#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4512#L14-2 [2024-10-31 21:55:59,293 INFO L747 eck$LassoCheckResult]: Loop: 4512#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4504#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4505#L20-1 assume !(0 == main_~up~0#1); 4524#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4523#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4522#L14 assume !(0 == main_~i~0#1); 4521#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4520#L17-1 assume !(1 == main_~up~0#1); 4519#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4517#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4514#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4515#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4512#L14-2 [2024-10-31 21:55:59,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:59,294 INFO L85 PathProgramCache]: Analyzing trace with hash 228527177, now seen corresponding path program 5 times [2024-10-31 21:55:59,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:59,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319184752] [2024-10-31 21:55:59,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:59,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:59,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:59,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:59,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:59,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times [2024-10-31 21:55:59,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:59,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727076625] [2024-10-31 21:55:59,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:59,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:59,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:59,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:59,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:59,369 INFO L85 PathProgramCache]: Analyzing trace with hash 210101867, now seen corresponding path program 1 times [2024-10-31 21:55:59,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:59,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990240458] [2024-10-31 21:55:59,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:59,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:59,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:59,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:56:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:56:00,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:56:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:56:00,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 31.10 09:56:00 BoogieIcfgContainer [2024-10-31 21:56:00,912 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-31 21:56:00,913 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:56:00,913 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:56:00,913 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:56:00,914 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:55:50" (3/4) ... [2024-10-31 21:56:00,916 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-31 21:56:01,010 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 21:56:01,010 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:56:01,011 INFO L158 Benchmark]: Toolchain (without parser) took 11384.40ms. Allocated memory was 123.7MB in the beginning and 178.3MB in the end (delta: 54.5MB). Free memory was 92.7MB in the beginning and 46.4MB in the end (delta: 46.2MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. [2024-10-31 21:56:01,011 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 123.7MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:56:01,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.70ms. Allocated memory is still 123.7MB. Free memory was 92.7MB in the beginning and 81.3MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-31 21:56:01,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.65ms. Allocated memory is still 123.7MB. Free memory was 81.3MB in the beginning and 80.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:56:01,012 INFO L158 Benchmark]: Boogie Preprocessor took 37.60ms. Allocated memory is still 123.7MB. Free memory was 80.0MB in the beginning and 78.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:56:01,012 INFO L158 Benchmark]: RCFGBuilder took 263.41ms. Allocated memory is still 123.7MB. Free memory was 78.4MB in the beginning and 69.3MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-31 21:56:01,012 INFO L158 Benchmark]: BuchiAutomizer took 10634.52ms. Allocated memory was 123.7MB in the beginning and 178.3MB in the end (delta: 54.5MB). Free memory was 69.1MB in the beginning and 52.7MB in the end (delta: 16.3MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2024-10-31 21:56:01,013 INFO L158 Benchmark]: Witness Printer took 97.11ms. Allocated memory is still 178.3MB. Free memory was 52.7MB in the beginning and 46.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 21:56:01,014 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.87ms. Allocated memory is still 123.7MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.70ms. Allocated memory is still 123.7MB. Free memory was 92.7MB in the beginning and 81.3MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.65ms. Allocated memory is still 123.7MB. Free memory was 81.3MB in the beginning and 80.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.60ms. Allocated memory is still 123.7MB. Free memory was 80.0MB in the beginning and 78.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 263.41ms. Allocated memory is still 123.7MB. Free memory was 78.4MB in the beginning and 69.3MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 10634.52ms. Allocated memory was 123.7MB in the beginning and 178.3MB in the end (delta: 54.5MB). Free memory was 69.1MB in the beginning and 52.7MB in the end (delta: 16.3MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. * Witness Printer took 97.11ms. Allocated memory is still 178.3MB. Free memory was 52.7MB in the beginning and 46.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 13 terminating modules (10 trivial, 2 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function (((long) -1 * i) + range) and consists of 4 locations. One nondeterministic module has affine ranking function (((long) -1 * i) + range) and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 23 locations. The remainder module has 281 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.4s and 13 iterations. TraceHistogramMax:20. Analysis of lassos took 7.8s. Construction of modules took 0.8s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 155 StatesRemovedByMinimization, 11 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 789 IncrementalHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 169 mSDtfsCounter, 789 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT2 conc2 concLT0 SILN3 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital30 mio100 ax139 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf97 smp57 dnf135 smp95 tf106 neg100 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-31 21:56:01,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-10-31 21:56:01,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-10-31 21:56:01,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-10-31 21:56:01,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-10-31 21:56:01,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-31 21:56:02,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f7c3f37-1455-496f-924b-f04517813e1e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)