./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/NonTermination3-1.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_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/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_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination3-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/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_81279c65-4eef-4abc-aaba-f34ab1d592cb/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 fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:21:21,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:21:21,659 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-06 22:21:21,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:21:21,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:21:21,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:21:21,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:21:21,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:21:21,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:21:21,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:21:21,718 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:21:21,718 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-06 22:21:21,719 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-06 22:21:21,720 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-06 22:21:21,721 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-06 22:21:21,721 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-06 22:21:21,721 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-06 22:21:21,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:21:21,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-06 22:21:21,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:21:21,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:21:21,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-06 22:21:21,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-06 22:21:21,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-06 22:21:21,725 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:21:21,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:21:21,726 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-06 22:21:21,726 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:21:21,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:21:21,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:21:21,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:21:21,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:21:21,729 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-06 22:21:21,729 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_81279c65-4eef-4abc-aaba-f34ab1d592cb/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_81279c65-4eef-4abc-aaba-f34ab1d592cb/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 -> fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c [2023-11-06 22:21:22,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:21:22,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:21:22,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:21:22,047 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:21:22,047 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:21:22,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2023-11-06 22:21:25,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:21:25,301 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:21:25,301 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2023-11-06 22:21:25,308 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/data/281fa5adb/b665b311908742bf9d4b2f4a09627495/FLAG0dfd7c19a [2023-11-06 22:21:25,323 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/data/281fa5adb/b665b311908742bf9d4b2f4a09627495 [2023-11-06 22:21:25,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:21:25,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:21:25,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:21:25,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:21:25,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:21:25,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:21:25" (1/1) ... [2023-11-06 22:21:25,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7d2d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:25, skipping insertion in model container [2023-11-06 22:21:25,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:21:25" (1/1) ... [2023-11-06 22:21:25,364 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:21:25,507 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:21:25,513 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:21:25,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:21:25,545 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:21:25,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:25 WrapperNode [2023-11-06 22:21:25,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:21:25,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:21:25,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:21:25,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:21:25,555 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:21:25" (1/1) ... [2023-11-06 22:21:25,561 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:21:25" (1/1) ... [2023-11-06 22:21:25,580 INFO L138 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2023-11-06 22:21:25,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:21:25,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:21:25,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:21:25,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:21:25,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:25" (1/1) ... [2023-11-06 22:21:25,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:25" (1/1) ... [2023-11-06 22:21:25,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:25" (1/1) ... [2023-11-06 22:21:25,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:25" (1/1) ... [2023-11-06 22:21:25,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:25" (1/1) ... [2023-11-06 22:21:25,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:25" (1/1) ... [2023-11-06 22:21:25,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:25" (1/1) ... [2023-11-06 22:21:25,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:25" (1/1) ... [2023-11-06 22:21:25,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:21:25,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:21:25,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:21:25,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:21:25,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:25" (1/1) ... [2023-11-06 22:21:25,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:21:25,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:25,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/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:21:25,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/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:21:25,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:21:25,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:21:25,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:21:25,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:21:25,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:21:25,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:21:25,776 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:21:25,778 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:21:25,908 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:21:25,914 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:21:25,914 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:21:25,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:25 BoogieIcfgContainer [2023-11-06 22:21:25,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:21:25,917 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-06 22:21:25,918 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-06 22:21:25,924 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-06 22:21:25,925 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:21:25,926 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.11 10:21:25" (1/3) ... [2023-11-06 22:21:25,927 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5823a8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:21:25, skipping insertion in model container [2023-11-06 22:21:25,928 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:21:25,929 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:25" (2/3) ... [2023-11-06 22:21:25,930 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5823a8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:21:25, skipping insertion in model container [2023-11-06 22:21:25,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:21:25,930 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:25" (3/3) ... [2023-11-06 22:21:25,932 INFO L332 chiAutomizerObserver]: Analyzing ICFG NonTermination3-1.c [2023-11-06 22:21:25,994 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-06 22:21:25,994 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-06 22:21:25,995 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-06 22:21:25,995 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-06 22:21:25,995 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-06 22:21:25,995 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-06 22:21:25,995 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-06 22:21:25,996 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-06 22:21:26,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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:21:26,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-06 22:21:26,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:21:26,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:21:26,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:21:26,026 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:21:26,026 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-06 22:21:26,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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:21:26,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-06 22:21:26,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:21:26,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:21:26,029 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:21:26,029 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:21:26,037 INFO L748 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 7#L13-3true [2023-11-06 22:21:26,038 INFO L750 eck$LassoCheckResult]: Loop: 7#L13-3true assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 5#L13-2true main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 7#L13-3true [2023-11-06 22:21:26,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:26,044 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-06 22:21:26,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:26,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307984049] [2023-11-06 22:21:26,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:26,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:26,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:21:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:26,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:21:26,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:26,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-06 22:21:26,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:26,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307743011] [2023-11-06 22:21:26,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:26,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:26,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:21:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:26,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:21:26,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-06 22:21:26,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:26,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239690125] [2023-11-06 22:21:26,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:26,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:26,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:21:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:26,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:21:26,589 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:21:26,590 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:21:26,590 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:21:26,590 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:21:26,590 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:21:26,591 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:21:26,593 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:21:26,593 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:21:26,593 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-1.c_Iteration1_Lasso [2023-11-06 22:21:26,593 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:21:26,594 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:21:26,617 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:21:26,762 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:21:26,767 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:21:26,771 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:21:26,775 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:21:26,777 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:21:26,782 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:21:26,785 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:21:26,790 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:21:26,935 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:21:26,940 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:21:26,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:21:26,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:26,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/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:21:26,961 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:21:26,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:21:26,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:21:26,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:21:26,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:21:26,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/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:21:26,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:21:26,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:21:26,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:21:27,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/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:21:27,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:21:27,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:27,005 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/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:21:27,021 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:21:27,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:21:27,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:21:27,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:21:27,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:21:27,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/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:21:27,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:21:27,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:21:27,103 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:21:27,155 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-11-06 22:21:27,155 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-11-06 22:21:27,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:21:27,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:27,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/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:21:27,190 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:21:27,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/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:21:27,227 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-06 22:21:27,227 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:21:27,228 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~n~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2023-11-06 22:21:27,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/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:21:27,249 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-11-06 22:21:27,259 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#a~0!base] could not be translated [2023-11-06 22:21:27,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:27,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:21:27,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:21:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:27,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:21:27,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:21:27,368 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:21:27,413 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-06 22:21:27,415 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:27,482 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 33 transitions. Complement of second has 8 states. [2023-11-06 22:21:27,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-06 22:21:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2023-11-06 22:21:27,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-06 22:21:27,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:21:27,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-06 22:21:27,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:21:27,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-06 22:21:27,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:21:27,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 33 transitions. [2023-11-06 22:21:27,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-06 22:21:27,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 9 states and 12 transitions. [2023-11-06 22:21:27,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-11-06 22:21:27,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2023-11-06 22:21:27,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2023-11-06 22:21:27,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:27,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2023-11-06 22:21:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2023-11-06 22:21:27,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-11-06 22:21:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2023-11-06 22:21:27,547 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2023-11-06 22:21:27,548 INFO L428 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2023-11-06 22:21:27,548 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-06 22:21:27,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2023-11-06 22:21:27,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-06 22:21:27,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:21:27,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:21:27,551 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-06 22:21:27,551 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-06 22:21:27,551 INFO L748 eck$LassoCheckResult]: Stem: 82#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 83#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 80#L13-3 assume !(main_~n~0#1 < 10); 81#L13-4 havoc main_~n~0#1; 86#L17-5 [2023-11-06 22:21:27,552 INFO L750 eck$LassoCheckResult]: Loop: 86#L17-5 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 84#L17-1 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 85#L17-3 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 86#L17-5 [2023-11-06 22:21:27,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2023-11-06 22:21:27,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:27,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875993393] [2023-11-06 22:21:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:27,634 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:21:27,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:27,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875993393] [2023-11-06 22:21:27,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875993393] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:27,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:27,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:21:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690503375] [2023-11-06 22:21:27,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:27,654 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:21:27,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:27,655 INFO L85 PathProgramCache]: Analyzing trace with hash 50748, now seen corresponding path program 1 times [2023-11-06 22:21:27,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:27,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482144083] [2023-11-06 22:21:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:27,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:27,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:21:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:27,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:21:27,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:27,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:21:27,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:21:27,825 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:27,840 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2023-11-06 22:21:27,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2023-11-06 22:21:27,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-06 22:21:27,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 12 transitions. [2023-11-06 22:21:27,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-11-06 22:21:27,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2023-11-06 22:21:27,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2023-11-06 22:21:27,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:27,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-11-06 22:21:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2023-11-06 22:21:27,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2023-11-06 22:21:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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:21:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2023-11-06 22:21:27,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2023-11-06 22:21:27,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:21:27,846 INFO L428 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2023-11-06 22:21:27,846 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-06 22:21:27,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2023-11-06 22:21:27,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-06 22:21:27,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:21:27,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:21:27,848 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:21:27,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-06 22:21:27,848 INFO L748 eck$LassoCheckResult]: Stem: 107#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 105#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 103#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 104#L13-3 assume !(main_~n~0#1 < 10); 106#L13-4 havoc main_~n~0#1; 109#L17-5 [2023-11-06 22:21:27,848 INFO L750 eck$LassoCheckResult]: Loop: 109#L17-5 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 110#L17-1 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 111#L17-3 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 109#L17-5 [2023-11-06 22:21:27,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:27,849 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2023-11-06 22:21:27,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:27,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139571336] [2023-11-06 22:21:27,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:27,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:21:27,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:27,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139571336] [2023-11-06 22:21:27,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139571336] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:21:27,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47935414] [2023-11-06 22:21:27,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:27,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:21:27,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:27,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:21:27,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:21:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:27,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:21:27,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:21:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:21:27,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:21:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:21:27,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47935414] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:21:27,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:21:27,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-06 22:21:27,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143419267] [2023-11-06 22:21:27,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:21:27,993 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:21:27,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash 50748, now seen corresponding path program 2 times [2023-11-06 22:21:27,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:27,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558294648] [2023-11-06 22:21:27,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:27,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:28,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:21:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:28,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:21:28,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:28,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:21:28,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:21:28,177 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:21:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:28,226 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-11-06 22:21:28,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2023-11-06 22:21:28,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-06 22:21:28,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2023-11-06 22:21:28,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-11-06 22:21:28,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2023-11-06 22:21:28,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2023-11-06 22:21:28,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:28,238 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-11-06 22:21:28,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2023-11-06 22:21:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-06 22:21:28,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 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:21:28,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-11-06 22:21:28,243 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-11-06 22:21:28,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:21:28,245 INFO L428 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-11-06 22:21:28,247 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-06 22:21:28,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2023-11-06 22:21:28,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-06 22:21:28,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:21:28,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:21:28,251 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2023-11-06 22:21:28,251 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-06 22:21:28,251 INFO L748 eck$LassoCheckResult]: Stem: 172#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 173#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 169#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 170#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 171#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 167#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 168#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 181#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 180#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 179#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 178#L13-3 assume !(main_~n~0#1 < 10); 174#L13-4 havoc main_~n~0#1; 175#L17-5 [2023-11-06 22:21:28,251 INFO L750 eck$LassoCheckResult]: Loop: 175#L17-5 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 176#L17-1 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 177#L17-3 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 175#L17-5 [2023-11-06 22:21:28,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2023-11-06 22:21:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:28,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964774724] [2023-11-06 22:21:28,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:28,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:21:28,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:28,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964774724] [2023-11-06 22:21:28,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964774724] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:21:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886962467] [2023-11-06 22:21:28,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:21:28,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:21:28,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:28,420 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:21:28,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:21:28,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:21:28,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:21:28,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:21:28,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:21:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:21:28,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:21:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:21:28,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886962467] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:21:28,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:21:28,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-06 22:21:28,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866761609] [2023-11-06 22:21:28,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:21:28,581 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:21:28,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash 50748, now seen corresponding path program 3 times [2023-11-06 22:21:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:28,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657009039] [2023-11-06 22:21:28,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:28,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:28,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:21:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:28,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:21:28,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:28,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:21:28,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:21:28,731 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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:21:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:28,784 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2023-11-06 22:21:28,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2023-11-06 22:21:28,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-06 22:21:28,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 29 transitions. [2023-11-06 22:21:28,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-11-06 22:21:28,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2023-11-06 22:21:28,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2023-11-06 22:21:28,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:21:28,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-11-06 22:21:28,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2023-11-06 22:21:28,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-06 22:21:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 26 states have internal predecessors, (29), 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:21:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-11-06 22:21:28,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-11-06 22:21:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:21:28,793 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-11-06 22:21:28,793 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-06 22:21:28,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2023-11-06 22:21:28,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-06 22:21:28,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:21:28,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:21:28,796 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2023-11-06 22:21:28,796 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-06 22:21:28,796 INFO L748 eck$LassoCheckResult]: Stem: 293#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 294#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 295#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 296#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 297#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 291#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 292#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 317#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 316#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 315#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 314#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 313#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 312#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 311#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 310#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 309#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 308#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 307#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 306#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 305#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 304#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 303#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 302#L13-3 assume !(main_~n~0#1 < 10); 298#L13-4 havoc main_~n~0#1; 299#L17-5 [2023-11-06 22:21:28,796 INFO L750 eck$LassoCheckResult]: Loop: 299#L17-5 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 300#L17-1 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 301#L17-3 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 299#L17-5 [2023-11-06 22:21:28,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:28,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2023-11-06 22:21:28,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:28,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611720769] [2023-11-06 22:21:28,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:28,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:28,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:21:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:28,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:21:28,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:28,860 INFO L85 PathProgramCache]: Analyzing trace with hash 50748, now seen corresponding path program 4 times [2023-11-06 22:21:28,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:28,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125797981] [2023-11-06 22:21:28,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:28,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:28,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:21:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:28,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:21:28,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:28,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1328177118, now seen corresponding path program 1 times [2023-11-06 22:21:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:28,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40217834] [2023-11-06 22:21:28,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:28,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:28,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:21:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:28,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:21:29,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:21:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:33,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:21:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:21:33,562 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-06 22:21:33,590 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-06 22:21:33,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.11 10:21:33 BoogieIcfgContainer [2023-11-06 22:21:33,593 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-06 22:21:33,594 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:21:33,594 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:21:33,594 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:21:33,594 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:25" (3/4) ... [2023-11-06 22:21:33,596 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-06 22:21:33,607 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-06 22:21:33,665 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:21:33,670 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:21:33,671 INFO L158 Benchmark]: Toolchain (without parser) took 8343.45ms. Allocated memory is still 195.0MB. Free memory was 150.0MB in the beginning and 101.9MB in the end (delta: 48.1MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2023-11-06 22:21:33,671 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:21:33,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.15ms. Allocated memory is still 195.0MB. Free memory was 150.0MB in the beginning and 140.3MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:21:33,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.88ms. Allocated memory is still 195.0MB. Free memory was 140.3MB in the beginning and 138.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:21:33,677 INFO L158 Benchmark]: Boogie Preprocessor took 36.95ms. Allocated memory is still 195.0MB. Free memory was 138.8MB in the beginning and 137.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:21:33,677 INFO L158 Benchmark]: RCFGBuilder took 297.65ms. Allocated memory is still 195.0MB. Free memory was 137.4MB in the beginning and 126.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:21:33,678 INFO L158 Benchmark]: BuchiAutomizer took 7675.62ms. Allocated memory is still 195.0MB. Free memory was 126.9MB in the beginning and 104.0MB in the end (delta: 22.9MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2023-11-06 22:21:33,678 INFO L158 Benchmark]: Witness Printer took 76.59ms. Allocated memory is still 195.0MB. Free memory was 104.0MB in the beginning and 101.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:21:33,680 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.26ms. Allocated memory is still 121.6MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.15ms. Allocated memory is still 195.0MB. Free memory was 150.0MB in the beginning and 140.3MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.88ms. Allocated memory is still 195.0MB. Free memory was 140.3MB in the beginning and 138.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.95ms. Allocated memory is still 195.0MB. Free memory was 138.8MB in the beginning and 137.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 297.65ms. Allocated memory is still 195.0MB. Free memory was 137.4MB in the beginning and 126.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 7675.62ms. Allocated memory is still 195.0MB. Free memory was 126.9MB in the beginning and 104.0MB in the end (delta: 22.9MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Witness Printer took 76.59ms. Allocated memory is still 195.0MB. Free memory was 104.0MB in the beginning and 101.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[~#a~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function NULL and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 27 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 5 iterations. TraceHistogramMax:10. Analysis of lassos took 7.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 27 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax100 hnf100 lsp100 ukn59 mio100 lsp62 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 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. [2023-11-06 22:21:33,703 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-06 22:21:33,713 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not Nontermination argument in form of an infinite program execution. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=10] [L13] COND FALSE !(n < 10) VAL [a={2:0}, n=10] Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution [2023-11-06 22:21:33,728 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-06 22:21:33,736 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=10] [L13] COND FALSE !(n < 10) VAL [a={2:0}, n=10] Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:21:33,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:21:33,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:21:34,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81279c65-4eef-4abc-aaba-f34ab1d592cb/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)