./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 e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/Narrowing.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:53:17,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:53:17,612 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-06 22:53:17,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:53:17,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:53:17,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:53:17,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:53:17,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:53:17,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:53:17,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:53:17,647 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:53:17,647 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-06 22:53:17,648 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-06 22:53:17,648 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-06 22:53:17,649 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-06 22:53:17,650 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-06 22:53:17,650 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-06 22:53:17,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:53:17,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-06 22:53:17,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:53:17,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:53:17,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-06 22:53:17,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-06 22:53:17,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-06 22:53:17,654 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:53:17,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:53:17,655 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-06 22:53:17,655 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:53:17,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:53:17,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:53:17,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:53:17,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:53:17,658 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-06 22:53:17,659 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_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/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_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac [2023-11-06 22:53:17,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:53:17,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:53:17,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:53:17,939 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:53:17,940 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:53:17,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2023-11-06 22:53:21,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:53:21,321 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:53:21,321 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2023-11-06 22:53:21,328 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/data/bfb2f2c47/a79ab2b23eb14b65ad22136d82df3c2f/FLAG8384fee25 [2023-11-06 22:53:21,344 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/data/bfb2f2c47/a79ab2b23eb14b65ad22136d82df3c2f [2023-11-06 22:53:21,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:53:21,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:53:21,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:53:21,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:53:21,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:53:21,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:21" (1/1) ... [2023-11-06 22:53:21,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fec3ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21, skipping insertion in model container [2023-11-06 22:53:21,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:21" (1/1) ... [2023-11-06 22:53:21,380 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:53:21,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:53:21,532 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:53:21,544 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:53:21,559 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:53:21,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21 WrapperNode [2023-11-06 22:53:21,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:53:21,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:53:21,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:53:21,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:53:21,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21" (1/1) ... [2023-11-06 22:53:21,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21" (1/1) ... [2023-11-06 22:53:21,586 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2023-11-06 22:53:21,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:53:21,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:53:21,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:53:21,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:53:21,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21" (1/1) ... [2023-11-06 22:53:21,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21" (1/1) ... [2023-11-06 22:53:21,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21" (1/1) ... [2023-11-06 22:53:21,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21" (1/1) ... [2023-11-06 22:53:21,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21" (1/1) ... [2023-11-06 22:53:21,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21" (1/1) ... [2023-11-06 22:53:21,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21" (1/1) ... [2023-11-06 22:53:21,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21" (1/1) ... [2023-11-06 22:53:21,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:53:21,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:53:21,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:53:21,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:53:21,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21" (1/1) ... [2023-11-06 22:53:21,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:21,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:21,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:21,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-06 22:53:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:53:21,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:53:21,785 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:53:21,788 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:53:21,876 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:53:21,883 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:53:21,883 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:53:21,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:21 BoogieIcfgContainer [2023-11-06 22:53:21,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:53:21,887 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-06 22:53:21,887 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-06 22:53:21,890 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-06 22:53:21,891 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:53:21,891 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.11 10:53:21" (1/3) ... [2023-11-06 22:53:21,893 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ee101be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:53:21, skipping insertion in model container [2023-11-06 22:53:21,893 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:53:21,893 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:21" (2/3) ... [2023-11-06 22:53:21,893 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ee101be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:53:21, skipping insertion in model container [2023-11-06 22:53:21,893 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:53:21,894 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:21" (3/3) ... [2023-11-06 22:53:21,895 INFO L332 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2023-11-06 22:53:21,957 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-06 22:53:21,957 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-06 22:53:21,957 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-06 22:53:21,957 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-06 22:53:21,958 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-06 22:53:21,958 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-06 22:53:21,958 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-06 22:53:21,958 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-06 22:53:21,963 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) [2023-11-06 22:53:21,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-06 22:53:21,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:21,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:21,987 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:53:21,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:53:21,988 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-06 22:53:21,988 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) [2023-11-06 22:53:21,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-06 22:53:21,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:21,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:21,991 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:53:21,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:53:21,999 INFO L748 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~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 [2023-11-06 22:53:21,999 INFO L750 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 [2023-11-06 22:53:22,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-06 22:53:22,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:22,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261317958] [2023-11-06 22:53:22,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:22,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:22,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:22,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:22,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times [2023-11-06 22:53:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:22,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044955554] [2023-11-06 22:53:22,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:22,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:22,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044955554] [2023-11-06 22:53:22,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044955554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:22,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:22,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:53:22,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496298821] [2023-11-06 22:53:22,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:22,212 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:53:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:22,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:53:22,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:53:22,253 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) [2023-11-06 22:53:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:22,314 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2023-11-06 22:53:22,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. [2023-11-06 22:53:22,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-11-06 22:53:22,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 23 transitions. [2023-11-06 22:53:22,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-06 22:53:22,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-06 22:53:22,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2023-11-06 22:53:22,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:53:22,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-11-06 22:53:22,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2023-11-06 22:53:22,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-06 22:53:22,346 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) [2023-11-06 22:53:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2023-11-06 22:53:22,347 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-11-06 22:53:22,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:53:22,353 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-11-06 22:53:22,353 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-06 22:53:22,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2023-11-06 22:53:22,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-11-06 22:53:22,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:22,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:22,355 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:53:22,355 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:53:22,355 INFO L748 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 [2023-11-06 22:53:22,355 INFO L750 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 [2023-11-06 22:53:22,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-06 22:53:22,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:22,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32794869] [2023-11-06 22:53:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:22,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:22,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:22,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:22,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:22,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1215977394, now seen corresponding path program 1 times [2023-11-06 22:53:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:22,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130696696] [2023-11-06 22:53:22,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:22,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:22,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:22,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130696696] [2023-11-06 22:53:22,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130696696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:22,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:22,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:53:22,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990967542] [2023-11-06 22:53:22,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:22,461 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:53:22,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:22,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:53:22,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:53:22,462 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) [2023-11-06 22:53:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:22,539 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2023-11-06 22:53:22,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2023-11-06 22:53:22,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-11-06 22:53:22,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2023-11-06 22:53:22,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2023-11-06 22:53:22,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-11-06 22:53:22,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2023-11-06 22:53:22,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:53:22,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-11-06 22:53:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2023-11-06 22:53:22,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-06 22:53:22,556 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) [2023-11-06 22:53:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2023-11-06 22:53:22,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-11-06 22:53:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:53:22,564 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-11-06 22:53:22,565 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-06 22:53:22,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2023-11-06 22:53:22,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-11-06 22:53:22,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:22,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:22,571 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:53:22,571 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:53:22,571 INFO L748 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 [2023-11-06 22:53:22,572 INFO L750 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 [2023-11-06 22:53:22,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:22,575 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-06 22:53:22,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:22,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155624024] [2023-11-06 22:53:22,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:22,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:22,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:22,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:22,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:22,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035056, now seen corresponding path program 1 times [2023-11-06 22:53:22,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:22,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819911815] [2023-11-06 22:53:22,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:22,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:22,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:22,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819911815] [2023-11-06 22:53:22,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819911815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:22,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:22,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:53:22,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404710213] [2023-11-06 22:53:22,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:22,638 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:53:22,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:22,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:53:22,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:53:22,640 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) [2023-11-06 22:53:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:22,657 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2023-11-06 22:53:22,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2023-11-06 22:53:22,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-11-06 22:53:22,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2023-11-06 22:53:22,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2023-11-06 22:53:22,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-11-06 22:53:22,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2023-11-06 22:53:22,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:53:22,662 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2023-11-06 22:53:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2023-11-06 22:53:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-11-06 22:53:22,666 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) [2023-11-06 22:53:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2023-11-06 22:53:22,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-11-06 22:53:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:53:22,669 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-11-06 22:53:22,669 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-06 22:53:22,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2023-11-06 22:53:22,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2023-11-06 22:53:22,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:22,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:22,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:53:22,671 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:53:22,672 INFO L748 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 [2023-11-06 22:53:22,672 INFO L750 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 [2023-11-06 22:53:22,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:22,673 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-06 22:53:22,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:22,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934922678] [2023-11-06 22:53:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:22,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:22,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:22,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:22,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:22,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times [2023-11-06 22:53:22,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:22,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841126558] [2023-11-06 22:53:22,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:22,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:22,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:22,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:22,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:22,703 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times [2023-11-06 22:53:22,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:22,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230338084] [2023-11-06 22:53:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:22,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:22,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:22,850 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:53:22,851 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:53:22,851 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:53:22,851 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:53:22,851 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:53:22,852 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:22,852 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:53:22,852 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:53:22,852 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2023-11-06 22:53:22,852 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:53:22,853 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:53:22,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:22,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:22,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:22,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:23,005 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:53:23,006 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:53:23,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:23,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:23,011 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:23,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-06 22:53:23,019 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:53:23,019 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:53:23,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:23,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:23,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:23,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:23,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:53:23,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:53:23,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-06 22:53:23,110 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:53:23,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:23,119 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:53:23,119 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:53:23,120 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:53:23,120 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:53:23,120 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:53:23,120 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:23,120 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:53:23,120 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:53:23,120 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2023-11-06 22:53:23,120 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:53:23,120 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:53:23,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:23,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:23,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:23,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:23,250 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:53:23,254 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:53:23,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:23,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:23,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:23,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-06 22:53:23,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:53:23,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:53:23,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:53:23,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:53:23,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:53:23,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:53:23,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:53:23,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:53:23,292 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:53:23,297 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:53:23,297 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-11-06 22:53:23,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:23,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:23,327 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:23,329 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:53:23,330 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:53:23,330 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:53:23,331 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-11-06 22:53:23,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-06 22:53:23,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-06 22:53:23,337 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:53:23,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:23,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:53:23,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:23,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:53:23,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:23,494 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-06 22:53:23,496 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) [2023-11-06 22:53:23,604 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. [2023-11-06 22:53:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-06 22:53:23,608 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) [2023-11-06 22:53:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-11-06 22:53:23,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2023-11-06 22:53:23,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:53:23,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2023-11-06 22:53:23,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:53:23,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2023-11-06 22:53:23,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:53:23,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2023-11-06 22:53:23,627 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2023-11-06 22:53:23,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2023-11-06 22:53:23,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2023-11-06 22:53:23,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2023-11-06 22:53:23,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2023-11-06 22:53:23,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:53:23,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2023-11-06 22:53:23,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2023-11-06 22:53:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2023-11-06 22:53:23,647 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) [2023-11-06 22:53:23,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2023-11-06 22:53:23,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2023-11-06 22:53:23,651 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2023-11-06 22:53:23,651 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-06 22:53:23,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2023-11-06 22:53:23,653 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2023-11-06 22:53:23,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:23,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:23,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-06 22:53:23,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:53:23,659 INFO L748 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 [2023-11-06 22:53:23,659 INFO L750 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 [2023-11-06 22:53:23,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2023-11-06 22:53:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:23,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261682026] [2023-11-06 22:53:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:23,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:23,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:23,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:23,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times [2023-11-06 22:53:23,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:23,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109838107] [2023-11-06 22:53:23,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:23,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:23,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:23,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:23,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times [2023-11-06 22:53:23,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:23,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639146175] [2023-11-06 22:53:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:23,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:23,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:23,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639146175] [2023-11-06 22:53:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639146175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:23,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:53:23,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309244559] [2023-11-06 22:53:23,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:23,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:23,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:53:23,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:53:23,779 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) [2023-11-06 22:53:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:23,812 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2023-11-06 22:53:23,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2023-11-06 22:53:23,814 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2023-11-06 22:53:23,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2023-11-06 22:53:23,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-11-06 22:53:23,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-11-06 22:53:23,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2023-11-06 22:53:23,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:53:23,816 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2023-11-06 22:53:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2023-11-06 22:53:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2023-11-06 22:53:23,820 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) [2023-11-06 22:53:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2023-11-06 22:53:23,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2023-11-06 22:53:23,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:53:23,830 INFO L428 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2023-11-06 22:53:23,830 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-06 22:53:23,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2023-11-06 22:53:23,831 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-11-06 22:53:23,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:23,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:23,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-06 22:53:23,832 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:53:23,832 INFO L748 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 [2023-11-06 22:53:23,832 INFO L750 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 [2023-11-06 22:53:23,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2023-11-06 22:53:23,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:23,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996079520] [2023-11-06 22:53:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:23,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:23,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:23,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:23,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:23,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times [2023-11-06 22:53:23,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:23,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659007534] [2023-11-06 22:53:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:23,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:23,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:23,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:23,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:23,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times [2023-11-06 22:53:23,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:23,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189380554] [2023-11-06 22:53:23,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:23,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:23,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:23,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189380554] [2023-11-06 22:53:23,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189380554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:23,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:23,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:53:23,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620596834] [2023-11-06 22:53:23,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:23,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:53:23,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:53:23,966 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) [2023-11-06 22:53:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:23,982 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2023-11-06 22:53:23,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2023-11-06 22:53:23,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-06 22:53:23,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2023-11-06 22:53:23,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-11-06 22:53:23,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-11-06 22:53:23,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2023-11-06 22:53:23,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:53:23,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2023-11-06 22:53:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2023-11-06 22:53:23,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2023-11-06 22:53:23,999 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) [2023-11-06 22:53:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2023-11-06 22:53:23,999 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2023-11-06 22:53:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:53:24,002 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2023-11-06 22:53:24,003 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-06 22:53:24,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2023-11-06 22:53:24,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-06 22:53:24,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:24,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:24,005 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-06 22:53:24,005 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:53:24,005 INFO L748 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 [2023-11-06 22:53:24,005 INFO L750 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 [2023-11-06 22:53:24,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2023-11-06 22:53:24,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:24,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222656222] [2023-11-06 22:53:24,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:24,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:24,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:24,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:24,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:24,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times [2023-11-06 22:53:24,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:24,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740713906] [2023-11-06 22:53:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:24,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:24,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:24,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:24,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times [2023-11-06 22:53:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:24,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781932305] [2023-11-06 22:53:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:24,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:24,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:24,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:24,146 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:53:24,146 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:53:24,146 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:53:24,147 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:53:24,147 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:53:24,147 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:24,147 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:53:24,148 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:53:24,148 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2023-11-06 22:53:24,152 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:53:24,152 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:53:24,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:24,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:24,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:24,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:24,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:24,333 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:53:24,333 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:53:24,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:24,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:24,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:24,352 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:53:24,352 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:53:24,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-06 22:53:24,375 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:53:24,375 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:53:24,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:24,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:24,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:24,382 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:24,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-06 22:53:24,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:53:24,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:53:24,407 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:53:24,407 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:53:24,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:24,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:24,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:24,415 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:24,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-06 22:53:24,418 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:53:24,418 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:53:24,443 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:53:24,443 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:53:24,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:24,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:24,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:24,454 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:24,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:53:24,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:53:24,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-06 22:53:24,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:24,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:24,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:24,497 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:24,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-06 22:53:24,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:53:24,501 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:53:24,785 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:53:24,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-11-06 22:53:24,793 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:53:24,793 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:53:24,793 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:53:24,793 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:53:24,793 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:53:24,794 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:24,794 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:53:24,794 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:53:24,794 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2023-11-06 22:53:24,794 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:53:24,794 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:53:24,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:24,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:24,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:24,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:24,948 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:53:24,948 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:53:24,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:24,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:24,950 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:24,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-06 22:53:24,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:53:24,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:53:24,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:53:24,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:53:24,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:53:24,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:53:24,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:53:24,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:53:25,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:25,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:25,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:25,003 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:25,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:53:25,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:53:25,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:53:25,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:53:25,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:53:25,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:53:25,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:53:25,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-06 22:53:25,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:53:25,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:25,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:25,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:25,055 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:25,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:53:25,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-06 22:53:25,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:53:25,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:53:25,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:53:25,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:53:25,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:53:25,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:53:25,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:53:25,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:53:25,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:25,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:25,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:25,100 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:25,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-06 22:53:25,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:53:25,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:53:25,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:53:25,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:53:25,120 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-06 22:53:25,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:53:25,125 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-06 22:53:25,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:53:25,136 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:53:25,139 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:53:25,139 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:53:25,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:25,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:25,141 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:25,151 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:53:25,151 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:53:25,151 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:53:25,151 INFO L515 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 [] [2023-11-06 22:53:25,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-06 22:53:25,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-11-06 22:53:25,160 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:53:25,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:53:25,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:53:25,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:25,266 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-06 22:53:25,266 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) [2023-11-06 22:53:25,325 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. [2023-11-06 22:53:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-06 22:53:25,327 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) [2023-11-06 22:53:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2023-11-06 22:53:25,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2023-11-06 22:53:25,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:53:25,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2023-11-06 22:53:25,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:53:25,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2023-11-06 22:53:25,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:53:25,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions. [2023-11-06 22:53:25,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-06 22:53:25,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions. [2023-11-06 22:53:25,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-06 22:53:25,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-11-06 22:53:25,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions. [2023-11-06 22:53:25,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:53:25,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 107 transitions. [2023-11-06 22:53:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions. [2023-11-06 22:53:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2023-11-06 22:53:25,345 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) [2023-11-06 22:53:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2023-11-06 22:53:25,346 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 101 transitions. [2023-11-06 22:53:25,346 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2023-11-06 22:53:25,346 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-06 22:53:25,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2023-11-06 22:53:25,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-06 22:53:25,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:25,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:25,348 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:25,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:53:25,348 INFO L748 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 [2023-11-06 22:53:25,348 INFO L750 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 [2023-11-06 22:53:25,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:25,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times [2023-11-06 22:53:25,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:25,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778751326] [2023-11-06 22:53:25,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:25,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:25,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:25,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778751326] [2023-11-06 22:53:25,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778751326] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:25,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800749752] [2023-11-06 22:53:25,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:25,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:25,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:25,441 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:25,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 22:53:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:53:25,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:25,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:25,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800749752] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:25,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:25,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-11-06 22:53:25,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202759934] [2023-11-06 22:53:25,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:25,533 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:53:25,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:25,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times [2023-11-06 22:53:25,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:25,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898415905] [2023-11-06 22:53:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:25,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:25,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:25,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:25,597 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:53:25,597 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:53:25,597 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:53:25,597 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:53:25,598 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:53:25,598 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:25,598 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:53:25,598 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:53:25,598 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2023-11-06 22:53:25,598 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:53:25,598 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:53:25,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:25,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:25,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:25,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:25,736 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:53:25,736 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:53:25,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:25,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:25,744 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:25,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-06 22:53:25,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:53:25,751 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:53:25,785 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:53:25,785 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:53:25,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:25,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:25,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:25,796 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:25,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:53:25,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:53:25,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-06 22:53:25,826 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:53:25,826 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:53:25,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:25,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:25,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:25,836 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:25,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:53:25,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:53:25,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-06 22:53:25,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:25,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:25,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:25,878 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:25,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:53:25,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:53:25,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-06 22:53:26,183 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:53:26,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:26,187 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:53:26,187 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:53:26,188 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:53:26,188 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:53:26,188 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:53:26,188 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:26,188 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:53:26,188 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:53:26,188 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2023-11-06 22:53:26,188 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:53:26,188 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:53:26,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:26,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:26,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:26,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:53:26,343 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:53:26,343 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:53:26,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:26,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:26,347 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:26,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-06 22:53:26,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:53:26,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:53:26,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:53:26,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:53:26,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:53:26,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:53:26,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:53:26,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:53:26,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:53:26,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:26,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:26,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:26,377 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:26,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-06 22:53:26,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:53:26,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:53:26,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:53:26,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:53:26,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:53:26,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:53:26,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:53:26,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:53:26,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:26,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:26,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:26,444 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:26,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:53:26,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:53:26,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:53:26,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:53:26,466 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-06 22:53:26,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:53:26,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-06 22:53:26,469 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-06 22:53:26,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:53:26,488 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:53:26,498 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:53:26,498 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:53:26,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:53:26,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:26,502 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:26,506 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:53:26,506 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:53:26,506 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:53:26,507 INFO L515 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 [] [2023-11-06 22:53:26,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-06 22:53:26,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:26,517 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:53:26,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:53:26,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:53:26,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:26,599 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-06 22:53:26,599 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) [2023-11-06 22:53:26,640 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. [2023-11-06 22:53:26,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-06 22:53:26,643 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) [2023-11-06 22:53:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2023-11-06 22:53:26,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2023-11-06 22:53:26,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:53:26,644 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-06 22:53:26,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:26,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:26,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:53:26,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:53:26,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:26,783 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 [2023-11-06 22:53:26,784 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) [2023-11-06 22:53:26,839 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. [2023-11-06 22:53:26,839 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 [2023-11-06 22:53:26,841 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) [2023-11-06 22:53:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2023-11-06 22:53:26,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2023-11-06 22:53:26,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:53:26,842 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-06 22:53:26,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:53:26,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:53:26,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:26,939 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 [2023-11-06 22:53:26,939 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) [2023-11-06 22:53:27,000 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. [2023-11-06 22:53:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-06 22:53:27,003 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) [2023-11-06 22:53:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2023-11-06 22:53:27,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 6 letters. [2023-11-06 22:53:27,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:53:27,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 17 letters. Loop has 6 letters. [2023-11-06 22:53:27,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:53:27,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 12 letters. [2023-11-06 22:53:27,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:53:27,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 165 transitions. [2023-11-06 22:53:27,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-11-06 22:53:27,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 85 states and 121 transitions. [2023-11-06 22:53:27,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-11-06 22:53:27,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2023-11-06 22:53:27,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 121 transitions. [2023-11-06 22:53:27,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:53:27,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 121 transitions. [2023-11-06 22:53:27,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 121 transitions. [2023-11-06 22:53:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2023-11-06 22:53:27,015 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) [2023-11-06 22:53:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2023-11-06 22:53:27,020 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 73 transitions. [2023-11-06 22:53:27,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:27,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:53:27,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:53:27,022 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) [2023-11-06 22:53:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:27,136 INFO L93 Difference]: Finished difference Result 209 states and 277 transitions. [2023-11-06 22:53:27,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 277 transitions. [2023-11-06 22:53:27,141 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2023-11-06 22:53:27,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 199 states and 266 transitions. [2023-11-06 22:53:27,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2023-11-06 22:53:27,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2023-11-06 22:53:27,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 266 transitions. [2023-11-06 22:53:27,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:53:27,145 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 266 transitions. [2023-11-06 22:53:27,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 266 transitions. [2023-11-06 22:53:27,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2023-11-06 22:53:27,169 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) [2023-11-06 22:53:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2023-11-06 22:53:27,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 235 transitions. [2023-11-06 22:53:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:53:27,178 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 235 transitions. [2023-11-06 22:53:27,178 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-06 22:53:27,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 235 transitions. [2023-11-06 22:53:27,180 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2023-11-06 22:53:27,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:27,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:27,182 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-06 22:53:27,182 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-06 22:53:27,182 INFO L748 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 [2023-11-06 22:53:27,182 INFO L750 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 [2023-11-06 22:53:27,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:27,183 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 2 times [2023-11-06 22:53:27,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:27,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103325053] [2023-11-06 22:53:27,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:27,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:27,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:27,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:27,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:27,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times [2023-11-06 22:53:27,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:27,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113657826] [2023-11-06 22:53:27,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:27,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:27,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:27,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113657826] [2023-11-06 22:53:27,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113657826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226927855] [2023-11-06 22:53:27,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:27,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:27,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:27,405 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:27,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-06 22:53:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:27,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:53:27,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:27,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:27,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226927855] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:27,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:27,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2023-11-06 22:53:27,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351006444] [2023-11-06 22:53:27,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:27,527 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:53:27,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:27,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:53:27,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:53:27,528 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) [2023-11-06 22:53:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:27,705 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2023-11-06 22:53:27,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2023-11-06 22:53:27,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-11-06 22:53:27,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 120 transitions. [2023-11-06 22:53:27,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2023-11-06 22:53:27,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2023-11-06 22:53:27,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 120 transitions. [2023-11-06 22:53:27,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:53:27,708 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 120 transitions. [2023-11-06 22:53:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 120 transitions. [2023-11-06 22:53:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2023-11-06 22:53:27,710 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) [2023-11-06 22:53:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2023-11-06 22:53:27,711 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 101 transitions. [2023-11-06 22:53:27,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:53:27,712 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 101 transitions. [2023-11-06 22:53:27,712 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-06 22:53:27,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 101 transitions. [2023-11-06 22:53:27,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-06 22:53:27,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:27,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:27,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1] [2023-11-06 22:53:27,715 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:27,715 INFO L748 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 [2023-11-06 22:53:27,715 INFO L750 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 [2023-11-06 22:53:27,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:27,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2020896569, now seen corresponding path program 2 times [2023-11-06 22:53:27,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:27,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020429939] [2023-11-06 22:53:27,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:27,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:27,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:27,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020429939] [2023-11-06 22:53:27,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020429939] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:27,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922827053] [2023-11-06 22:53:27,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:53:27,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:27,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:27,776 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:27,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-06 22:53:27,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:53:27,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:53:27,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:53:27,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:27,865 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:27,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:27,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922827053] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:27,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:27,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-06 22:53:27,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303983452] [2023-11-06 22:53:27,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:27,927 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:53:27,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 2 times [2023-11-06 22:53:27,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:27,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081523121] [2023-11-06 22:53:27,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:27,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:27,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:27,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:28,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:28,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:53:28,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:53:28,009 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) [2023-11-06 22:53:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:28,175 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2023-11-06 22:53:28,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2023-11-06 22:53:28,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-06 22:53:28,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 151 states and 163 transitions. [2023-11-06 22:53:28,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2023-11-06 22:53:28,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2023-11-06 22:53:28,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 163 transitions. [2023-11-06 22:53:28,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:53:28,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 163 transitions. [2023-11-06 22:53:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 163 transitions. [2023-11-06 22:53:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2023-11-06 22:53:28,182 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) [2023-11-06 22:53:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2023-11-06 22:53:28,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 149 transitions. [2023-11-06 22:53:28,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:53:28,184 INFO L428 stractBuchiCegarLoop]: Abstraction has 137 states and 149 transitions. [2023-11-06 22:53:28,184 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-06 22:53:28,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 149 transitions. [2023-11-06 22:53:28,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-06 22:53:28,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:28,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:28,192 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1] [2023-11-06 22:53:28,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:28,194 INFO L748 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 [2023-11-06 22:53:28,194 INFO L750 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 [2023-11-06 22:53:28,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1325721725, now seen corresponding path program 3 times [2023-11-06 22:53:28,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:28,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243311869] [2023-11-06 22:53:28,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:28,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:28,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:28,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243311869] [2023-11-06 22:53:28,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243311869] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:28,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748390572] [2023-11-06 22:53:28,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:53:28,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:28,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:28,416 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:28,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-06 22:53:28,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-06 22:53:28,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:53:28,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:53:28,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:28,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:28,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748390572] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:28,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:28,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-06 22:53:28,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059380604] [2023-11-06 22:53:28,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:28,712 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:53:28,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:28,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times [2023-11-06 22:53:28,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:28,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656944186] [2023-11-06 22:53:28,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:28,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:28,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:28,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:28,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:28,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:53:28,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:53:28,794 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) [2023-11-06 22:53:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:29,091 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions. [2023-11-06 22:53:29,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 275 transitions. [2023-11-06 22:53:29,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-06 22:53:29,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 247 states and 259 transitions. [2023-11-06 22:53:29,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2023-11-06 22:53:29,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2023-11-06 22:53:29,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 259 transitions. [2023-11-06 22:53:29,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:53:29,097 INFO L218 hiAutomatonCegarLoop]: Abstraction has 247 states and 259 transitions. [2023-11-06 22:53:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 259 transitions. [2023-11-06 22:53:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2023-11-06 22:53:29,102 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) [2023-11-06 22:53:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 245 transitions. [2023-11-06 22:53:29,103 INFO L240 hiAutomatonCegarLoop]: Abstraction has 233 states and 245 transitions. [2023-11-06 22:53:29,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:53:29,104 INFO L428 stractBuchiCegarLoop]: Abstraction has 233 states and 245 transitions. [2023-11-06 22:53:29,104 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-06 22:53:29,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 245 transitions. [2023-11-06 22:53:29,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-06 22:53:29,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:29,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:29,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 15, 15, 15, 15, 15, 1, 1, 1] [2023-11-06 22:53:29,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:29,110 INFO L748 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 [2023-11-06 22:53:29,110 INFO L750 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 [2023-11-06 22:53:29,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:29,110 INFO L85 PathProgramCache]: Analyzing trace with hash -944359675, now seen corresponding path program 4 times [2023-11-06 22:53:29,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:29,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944253210] [2023-11-06 22:53:29,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:29,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:29,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:29,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944253210] [2023-11-06 22:53:29,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944253210] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:29,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106161678] [2023-11-06 22:53:29,572 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:53:29,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:29,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:29,576 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:29,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-06 22:53:29,657 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:53:29,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:53:29,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:53:29,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:29,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:30,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106161678] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:30,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:30,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 22 [2023-11-06 22:53:30,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144935666] [2023-11-06 22:53:30,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:30,194 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:53:30,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times [2023-11-06 22:53:30,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:30,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883404349] [2023-11-06 22:53:30,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:30,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:30,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:30,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:30,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:30,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 22:53:30,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=307, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:53:30,263 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) [2023-11-06 22:53:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:30,518 INFO L93 Difference]: Finished difference Result 303 states and 315 transitions. [2023-11-06 22:53:30,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 315 transitions. [2023-11-06 22:53:30,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-06 22:53:30,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 295 states and 307 transitions. [2023-11-06 22:53:30,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2023-11-06 22:53:30,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2023-11-06 22:53:30,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 307 transitions. [2023-11-06 22:53:30,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:53:30,525 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 307 transitions. [2023-11-06 22:53:30,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 307 transitions. [2023-11-06 22:53:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 281. [2023-11-06 22:53:30,531 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) [2023-11-06 22:53:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 293 transitions. [2023-11-06 22:53:30,532 INFO L240 hiAutomatonCegarLoop]: Abstraction has 281 states and 293 transitions. [2023-11-06 22:53:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 22:53:30,533 INFO L428 stractBuchiCegarLoop]: Abstraction has 281 states and 293 transitions. [2023-11-06 22:53:30,534 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-06 22:53:30,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 281 states and 293 transitions. [2023-11-06 22:53:30,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-06 22:53:30,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:53:30,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:53:30,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 19, 19, 19, 19, 19, 1, 1, 1] [2023-11-06 22:53:30,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:30,542 INFO L748 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 [2023-11-06 22:53:30,543 INFO L750 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 [2023-11-06 22:53:30,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash 228527177, now seen corresponding path program 5 times [2023-11-06 22:53:30,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:30,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38715245] [2023-11-06 22:53:30,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:30,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:30,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:30,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:30,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:30,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times [2023-11-06 22:53:30,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:30,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927168574] [2023-11-06 22:53:30,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:30,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:30,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:30,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:30,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash 210101867, now seen corresponding path program 1 times [2023-11-06 22:53:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:30,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196052187] [2023-11-06 22:53:30,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:30,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:30,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:30,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:32,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:32,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.11 10:53:32 BoogieIcfgContainer [2023-11-06 22:53:32,284 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-06 22:53:32,284 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:53:32,284 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:53:32,285 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:53:32,285 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:21" (3/4) ... [2023-11-06 22:53:32,287 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-06 22:53:32,374 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:53:32,374 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:53:32,399 INFO L158 Benchmark]: Toolchain (without parser) took 11049.66ms. Allocated memory was 184.5MB in the beginning and 285.2MB in the end (delta: 100.7MB). Free memory was 138.5MB in the beginning and 251.3MB in the end (delta: -112.8MB). Peak memory consumption was 122.9MB. Max. memory is 16.1GB. [2023-11-06 22:53:32,399 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 109.1MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:53:32,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.18ms. Allocated memory is still 184.5MB. Free memory was 138.5MB in the beginning and 129.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:53:32,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.59ms. Allocated memory is still 184.5MB. Free memory was 129.2MB in the beginning and 127.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:53:32,400 INFO L158 Benchmark]: Boogie Preprocessor took 19.98ms. Allocated memory is still 184.5MB. Free memory was 127.4MB in the beginning and 126.7MB in the end (delta: 654.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:53:32,401 INFO L158 Benchmark]: RCFGBuilder took 278.25ms. Allocated memory is still 184.5MB. Free memory was 126.7MB in the beginning and 117.5MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:53:32,402 INFO L158 Benchmark]: BuchiAutomizer took 10396.98ms. Allocated memory was 184.5MB in the beginning and 237.0MB in the end (delta: 52.4MB). Free memory was 117.5MB in the beginning and 76.1MB in the end (delta: 41.5MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2023-11-06 22:53:32,402 INFO L158 Benchmark]: Witness Printer took 113.65ms. Allocated memory was 237.0MB in the beginning and 285.2MB in the end (delta: 48.2MB). Free memory was 76.1MB in the beginning and 251.3MB in the end (delta: -175.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 22:53:32,405 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.33ms. Allocated memory is still 109.1MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.18ms. Allocated memory is still 184.5MB. Free memory was 138.5MB in the beginning and 129.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.59ms. Allocated memory is still 184.5MB. Free memory was 129.2MB in the beginning and 127.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.98ms. Allocated memory is still 184.5MB. Free memory was 127.4MB in the beginning and 126.7MB in the end (delta: 654.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 278.25ms. Allocated memory is still 184.5MB. Free memory was 126.7MB in the beginning and 117.5MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 10396.98ms. Allocated memory was 184.5MB in the beginning and 237.0MB in the end (delta: 52.4MB). Free memory was 117.5MB in the beginning and 76.1MB in the end (delta: 41.5MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. * Witness Printer took 113.65ms. Allocated memory was 237.0MB in the beginning and 285.2MB in the end (delta: 48.2MB). Free memory was 76.1MB in the beginning and 251.3MB in the end (delta: -175.2MB). 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 ((-1 * i) + range) and consists of 4 locations. One nondeterministic module has affine ranking function ((-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.2s and 13 iterations. TraceHistogramMax:20. Analysis of lassos took 7.6s. Construction of modules took 0.7s. 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, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 0.7s 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: 44ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s 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! [2023-11-06 22:53:32,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-11-06 22:53:32,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:32,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-11-06 22:53:33,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-11-06 22:53:33,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-06 22:53:33,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_941ca3b5-db5f-40b7-a7c7-29ba828a6494/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)