./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:22:44,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:22:44,487 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-29 02:22:44,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:22:44,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:22:44,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:22:44,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:22:44,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:22:44,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:22:44,519 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:22:44,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:22:44,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:22:44,521 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:22:44,521 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 02:22:44,522 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 02:22:44,522 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 02:22:44,523 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 02:22:44,523 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 02:22:44,524 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 02:22:44,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:22:44,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 02:22:44,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:22:44,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:22:44,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 02:22:44,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 02:22:44,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 02:22:44,527 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:22:44,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:22:44,528 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 02:22:44,529 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:22:44,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:22:44,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:22:44,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:22:44,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:22:44,531 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 02:22:44,531 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_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/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_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 [2023-11-29 02:22:44,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:22:44,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:22:44,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:22:44,768 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:22:44,768 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:22:44,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2023-11-29 02:22:47,506 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:22:47,709 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:22:47,709 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2023-11-29 02:22:47,722 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/data/802681f3e/eb00f8298e7f4bf4bf02d2a420c95884/FLAGa2b7282b4 [2023-11-29 02:22:47,735 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/data/802681f3e/eb00f8298e7f4bf4bf02d2a420c95884 [2023-11-29 02:22:47,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:22:47,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:22:47,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:22:47,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:22:47,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:22:47,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:22:47" (1/1) ... [2023-11-29 02:22:47,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f39f027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:47, skipping insertion in model container [2023-11-29 02:22:47,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:22:47" (1/1) ... [2023-11-29 02:22:47,786 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:22:48,003 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:22:48,013 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:22:48,045 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:22:48,068 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:22:48,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48 WrapperNode [2023-11-29 02:22:48,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:22:48,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:22:48,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:22:48,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:22:48,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48" (1/1) ... [2023-11-29 02:22:48,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48" (1/1) ... [2023-11-29 02:22:48,102 INFO L138 Inliner]: procedures = 109, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2023-11-29 02:22:48,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:22:48,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:22:48,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:22:48,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:22:48,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48" (1/1) ... [2023-11-29 02:22:48,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48" (1/1) ... [2023-11-29 02:22:48,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48" (1/1) ... [2023-11-29 02:22:48,128 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [5, 4]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2023-11-29 02:22:48,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48" (1/1) ... [2023-11-29 02:22:48,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48" (1/1) ... [2023-11-29 02:22:48,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48" (1/1) ... [2023-11-29 02:22:48,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48" (1/1) ... [2023-11-29 02:22:48,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48" (1/1) ... [2023-11-29 02:22:48,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48" (1/1) ... [2023-11-29 02:22:48,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:22:48,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:22:48,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:22:48,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:22:48,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48" (1/1) ... [2023-11-29 02:22:48,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:22:48,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:22:48,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:22:48,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 02:22:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 02:22:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 02:22:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:22:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:22:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:22:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:22:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:22:48,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:22:48,311 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:22:48,313 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:22:48,402 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:22:48,411 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:22:48,411 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:22:48,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:22:48 BoogieIcfgContainer [2023-11-29 02:22:48,413 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:22:48,414 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 02:22:48,414 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 02:22:48,419 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 02:22:48,419 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 02:22:48,420 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 02:22:47" (1/3) ... [2023-11-29 02:22:48,421 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@737a7bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 02:22:48, skipping insertion in model container [2023-11-29 02:22:48,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 02:22:48,421 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:22:48" (2/3) ... [2023-11-29 02:22:48,422 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@737a7bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 02:22:48, skipping insertion in model container [2023-11-29 02:22:48,422 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 02:22:48,422 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:22:48" (3/3) ... [2023-11-29 02:22:48,424 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2023-11-29 02:22:48,471 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 02:22:48,471 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 02:22:48,472 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 02:22:48,472 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 02:22:48,472 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 02:22:48,472 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 02:22:48,472 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 02:22:48,473 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 02:22:48,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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-29 02:22:48,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-29 02:22:48,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 02:22:48,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 02:22:48,496 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 02:22:48,496 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-29 02:22:48,496 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 02:22:48,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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-29 02:22:48,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-29 02:22:48,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 02:22:48,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 02:22:48,498 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 02:22:48,498 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-29 02:22:48,505 INFO L748 eck$LassoCheckResult]: Stem: 7#$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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 4#L552-3true [2023-11-29 02:22:48,505 INFO L750 eck$LassoCheckResult]: Loop: 4#L552-3true goto; 3#main_Loop~3#1true call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 9#L552-1true assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 11#L554true assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int#1(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 4#L552-3true [2023-11-29 02:22:48,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:48,510 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-29 02:22:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:48,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735915794] [2023-11-29 02:22:48,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:48,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:48,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:22:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:48,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:22:48,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:48,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2023-11-29 02:22:48,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:48,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143503563] [2023-11-29 02:22:48,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:48,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:48,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:22:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:48,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:22:48,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2023-11-29 02:22:48,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:48,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885498679] [2023-11-29 02:22:48,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:48,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:22:49,045 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-29 02:22:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:22:49,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885498679] [2023-11-29 02:22:49,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885498679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:22:49,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:22:49,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:22:49,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773599557] [2023-11-29 02:22:49,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:22:49,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:22:49,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:22:49,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:22:49,236 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:22:49,267 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2023-11-29 02:22:49,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2023-11-29 02:22:49,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-29 02:22:49,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2023-11-29 02:22:49,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-11-29 02:22:49,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2023-11-29 02:22:49,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2023-11-29 02:22:49,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:22:49,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-29 02:22:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2023-11-29 02:22:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-29 02:22:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 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-29 02:22:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-29 02:22:49,300 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-29 02:22:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:22:49,305 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-29 02:22:49,305 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 02:22:49,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2023-11-29 02:22:49,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-29 02:22:49,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 02:22:49,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 02:22:49,307 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:22:49,307 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 02:22:49,307 INFO L748 eck$LassoCheckResult]: Stem: 40#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 41#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 39#L552-3 goto; 37#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 38#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 42#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 43#main_Loop~3#1 [2023-11-29 02:22:49,307 INFO L750 eck$LassoCheckResult]: Loop: 43#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 46#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 44#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 43#main_Loop~3#1 [2023-11-29 02:22:49,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:49,308 INFO L85 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2023-11-29 02:22:49,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:49,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682797607] [2023-11-29 02:22:49,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:49,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:49,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:22:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:49,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:22:49,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2023-11-29 02:22:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:49,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999342285] [2023-11-29 02:22:49,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:49,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:22:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:49,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:22:49,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2023-11-29 02:22:49,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:49,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116678694] [2023-11-29 02:22:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:49,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:49,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:22:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:49,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:22:49,839 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 02:22:49,839 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 02:22:49,839 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 02:22:49,840 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 02:22:49,840 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 02:22:49,840 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:22:49,840 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 02:22:49,840 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 02:22:49,840 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2023-11-29 02:22:49,840 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 02:22:49,840 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 02:22:49,857 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-29 02:22:50,129 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-29 02:22:50,131 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-29 02:22:50,134 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-29 02:22:50,138 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-29 02:22:50,141 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-29 02:22:50,144 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-29 02:22:50,149 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-29 02:22:50,151 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-29 02:22:50,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 02:22:50,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 02:22:50,161 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-29 02:22:50,165 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-29 02:22:50,168 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-29 02:22:50,432 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 02:22:50,437 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 02:22:50,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:22:50,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:22:50,440 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:22:50,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-29 02:22:50,445 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-29 02:22:50,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 02:22:50,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 02:22:50,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 02:22:50,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 02:22:50,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 02:22:50,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 02:22:50,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 02:22:50,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:22:50,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:22:50,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:22:50,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:22:50,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-29 02:22:50,489 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-29 02:22:50,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 02:22:50,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 02:22:50,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 02:22:50,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 02:22:50,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 02:22:50,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 02:22:50,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 02:22:50,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-11-29 02:22:50,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:22:50,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:22:50,514 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:22:50,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-29 02:22:50,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 02:22:50,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 02:22:50,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 02:22:50,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 02:22:50,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 02:22:50,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 02:22:50,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 02:22:50,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 02:22:50,575 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2023-11-29 02:22:50,575 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-11-29 02:22:50,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:22:50,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:22:50,601 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:22:50,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-29 02:22:50,604 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 02:22:50,615 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 02:22:50,616 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 02:22:50,616 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 + 19 Supporting invariants [] [2023-11-29 02:22:50,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-29 02:22:50,649 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2023-11-29 02:22:50,656 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#0[~i~0!base][~i~0!offset] could not be translated [2023-11-29 02:22:50,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:22:50,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:22:50,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:22:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:22:50,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 02:22:50,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:22:50,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2023-11-29 02:22:50,786 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-29 02:22:50,789 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-29 02:22:50,790 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:50,834 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 20 transitions. Complement of second has 6 states. [2023-11-29 02:22:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 02:22:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2023-11-29 02:22:50,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2023-11-29 02:22:50,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 02:22:50,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2023-11-29 02:22:50,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 02:22:50,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2023-11-29 02:22:50,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 02:22:50,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2023-11-29 02:22:50,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-29 02:22:50,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2023-11-29 02:22:50,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-29 02:22:50,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-29 02:22:50,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2023-11-29 02:22:50,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 02:22:50,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-11-29 02:22:50,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2023-11-29 02:22:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2023-11-29 02:22:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-29 02:22:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-11-29 02:22:50,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-29 02:22:50,844 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-29 02:22:50,844 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 02:22:50,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2023-11-29 02:22:50,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-29 02:22:50,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 02:22:50,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 02:22:50,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2023-11-29 02:22:50,846 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-29 02:22:50,846 INFO L748 eck$LassoCheckResult]: Stem: 159#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 160#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 161#L552-3 goto; 168#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 167#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 166#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 165#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 154#L552-1 [2023-11-29 02:22:50,846 INFO L750 eck$LassoCheckResult]: Loop: 154#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 162#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int#1(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 157#L552-3 goto; 153#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 154#L552-1 [2023-11-29 02:22:50,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2023-11-29 02:22:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:50,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226667854] [2023-11-29 02:22:50,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:50,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:22:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:50,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:22:50,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:50,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2023-11-29 02:22:50,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:50,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173559673] [2023-11-29 02:22:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:50,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:50,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:22:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:50,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:22:50,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:50,889 INFO L85 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2023-11-29 02:22:50,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:50,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004396329] [2023-11-29 02:22:50,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:50,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:22:51,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-11-29 02:22:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:22:51,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:22:51,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004396329] [2023-11-29 02:22:51,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004396329] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:22:51,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423259282] [2023-11-29 02:22:51,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:51,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:22:51,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:22:51,114 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:22:51,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 02:22:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:22:51,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 02:22:51,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:22:51,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:22:51,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-11-29 02:22:51,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 02:22:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:22:51,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:22:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:22:51,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423259282] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:22:51,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:22:51,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2023-11-29 02:22:51,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427548005] [2023-11-29 02:22:51,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:22:51,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:22:51,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:22:51,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:22:51,399 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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-29 02:22:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:22:51,462 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2023-11-29 02:22:51,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2023-11-29 02:22:51,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-29 02:22:51,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 26 transitions. [2023-11-29 02:22:51,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-29 02:22:51,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-29 02:22:51,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2023-11-29 02:22:51,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 02:22:51,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-11-29 02:22:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2023-11-29 02:22:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-29 02:22:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-11-29 02:22:51,467 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-11-29 02:22:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:22:51,468 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-11-29 02:22:51,468 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 02:22:51,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2023-11-29 02:22:51,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-29 02:22:51,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 02:22:51,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 02:22:51,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2023-11-29 02:22:51,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-29 02:22:51,470 INFO L748 eck$LassoCheckResult]: Stem: 286#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 287#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 288#L552-3 goto; 297#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 296#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 292#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 278#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 279#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 291#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 280#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 281#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 301#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 300#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 299#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 298#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 294#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 289#L552-1 [2023-11-29 02:22:51,470 INFO L750 eck$LassoCheckResult]: Loop: 289#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 290#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int#1(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 282#L552-3 goto; 283#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 289#L552-1 [2023-11-29 02:22:51,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:51,471 INFO L85 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 4 times [2023-11-29 02:22:51,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:51,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029705269] [2023-11-29 02:22:51,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:51,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:51,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:22:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:51,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:22:51,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2023-11-29 02:22:51,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:51,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635494435] [2023-11-29 02:22:51,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:51,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:51,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:22:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:51,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:22:51,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:51,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 2 times [2023-11-29 02:22:51,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:51,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122000341] [2023-11-29 02:22:51,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:51,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:22:52,034 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:22:52,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:22:52,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122000341] [2023-11-29 02:22:52,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122000341] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:22:52,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784861047] [2023-11-29 02:22:52,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:22:52,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:22:52,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:22:52,037 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:22:52,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 02:22:52,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:22:52,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:22:52,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 02:22:52,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:22:52,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:22:52,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-11-29 02:22:52,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:22:52,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:22:52,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:22:52,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 02:22:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:22:52,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:22:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:22:52,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784861047] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:22:52,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:22:52,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 17 [2023-11-29 02:22:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788026823] [2023-11-29 02:22:52,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:22:52,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:22:52,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 02:22:52,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2023-11-29 02:22:52,447 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 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-29 02:22:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:22:52,611 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2023-11-29 02:22:52,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 56 transitions. [2023-11-29 02:22:52,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-29 02:22:52,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 44 transitions. [2023-11-29 02:22:52,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-29 02:22:52,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-29 02:22:52,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2023-11-29 02:22:52,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 02:22:52,615 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 44 transitions. [2023-11-29 02:22:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2023-11-29 02:22:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-29 02:22:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2023-11-29 02:22:52,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 44 transitions. [2023-11-29 02:22:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 02:22:52,621 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2023-11-29 02:22:52,621 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 02:22:52,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2023-11-29 02:22:52,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-29 02:22:52,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 02:22:52,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 02:22:52,624 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2023-11-29 02:22:52,624 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-29 02:22:52,625 INFO L748 eck$LassoCheckResult]: Stem: 514#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 515#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 516#L552-3 goto; 526#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 525#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 520#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 506#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 507#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 547#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 508#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 509#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 519#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 521#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 546#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 545#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 544#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 543#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 542#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 541#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 540#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 539#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 538#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 537#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 536#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 535#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 534#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 533#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 532#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 531#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 530#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 529#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 528#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 527#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 523#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 517#L552-1 [2023-11-29 02:22:52,625 INFO L750 eck$LassoCheckResult]: Loop: 517#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int#0(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 518#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int#1(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 510#L552-3 goto; 511#main_Loop~3#1 call main_#t~mem4#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 517#L552-1 [2023-11-29 02:22:52,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:52,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 5 times [2023-11-29 02:22:52,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:52,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814632075] [2023-11-29 02:22:52,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:52,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:52,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:22:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:52,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:22:52,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:52,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2023-11-29 02:22:52,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:52,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638009512] [2023-11-29 02:22:52,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:52,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:52,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:22:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:52,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:22:52,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 3 times [2023-11-29 02:22:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:52,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703349329] [2023-11-29 02:22:52,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:52,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:52,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:22:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:22:52,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:23:00,565 WARN L293 SmtUtils]: Spent 7.69s on a formula simplification. DAG size of input: 202 DAG size of output: 167 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 02:23:00,728 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 02:23:00,728 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 02:23:00,728 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 02:23:00,728 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 02:23:00,728 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 02:23:00,728 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:23:00,728 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 02:23:00,728 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 02:23:00,728 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration5_Lasso [2023-11-29 02:23:00,728 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 02:23:00,728 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 02:23:00,731 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-29 02:23:00,734 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-29 02:23:00,986 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-29 02:23:00,989 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-29 02:23:00,990 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-29 02:23:00,993 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-29 02:23:00,995 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-29 02:23:00,997 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-29 02:23:00,999 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-29 02:23:01,002 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-29 02:23:01,004 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-29 02:23:01,006 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-29 02:23:01,266 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 02:23:01,266 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 02:23:01,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:23:01,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:23:01,272 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:23:01,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-29 02:23:01,273 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-29 02:23:01,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 02:23:01,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 02:23:01,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 02:23:01,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 02:23:01,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 02:23:01,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 02:23:01,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 02:23:01,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 02:23:01,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-11-29 02:23:01,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:23:01,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:23:01,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:23:01,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-29 02:23:01,297 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-29 02:23:01,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 02:23:01,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 02:23:01,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 02:23:01,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 02:23:01,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 02:23:01,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 02:23:01,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 02:23:01,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-29 02:23:01,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:23:01,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:23:01,319 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:23:01,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-29 02:23:01,322 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-29 02:23:01,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 02:23:01,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 02:23:01,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 02:23:01,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 02:23:01,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 02:23:01,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 02:23:01,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 02:23:01,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-11-29 02:23:01,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:23:01,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:23:01,353 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:23:01,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 02:23:01,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-29 02:23:01,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 02:23:01,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 02:23:01,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 02:23:01,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 02:23:01,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 02:23:01,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 02:23:01,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 02:23:01,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-29 02:23:01,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:23:01,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:23:01,379 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:23:01,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-29 02:23:01,385 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-29 02:23:01,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 02:23:01,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 02:23:01,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 02:23:01,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 02:23:01,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 02:23:01,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 02:23:01,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 02:23:01,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-11-29 02:23:01,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:23:01,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:23:01,404 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:23:01,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-29 02:23:01,406 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-29 02:23:01,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 02:23:01,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 02:23:01,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 02:23:01,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 02:23:01,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 02:23:01,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 02:23:01,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 02:23:01,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-11-29 02:23:01,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:23:01,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:23:01,425 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:23:01,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-29 02:23:01,427 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-29 02:23:01,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 02:23:01,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 02:23:01,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 02:23:01,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 02:23:01,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 02:23:01,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 02:23:01,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 02:23:01,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-11-29 02:23:01,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:23:01,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:23:01,453 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:23:01,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-29 02:23:01,455 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-29 02:23:01,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 02:23:01,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 02:23:01,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 02:23:01,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 02:23:01,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 02:23:01,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 02:23:01,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 02:23:01,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-11-29 02:23:01,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:23:01,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:23:01,478 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:23:01,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-29 02:23:01,481 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-29 02:23:01,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 02:23:01,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 02:23:01,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 02:23:01,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 02:23:01,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 02:23:01,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 02:23:01,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 02:23:01,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-29 02:23:01,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:23:01,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:23:01,503 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:23:01,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-29 02:23:01,506 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-29 02:23:01,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 02:23:01,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 02:23:01,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 02:23:01,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 02:23:01,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 02:23:01,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 02:23:01,530 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 02:23:01,543 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-11-29 02:23:01,543 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-11-29 02:23:01,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 02:23:01,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:23:01,544 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 02:23:01,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-29 02:23:01,557 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 02:23:01,568 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-29 02:23:01,568 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 02:23:01,568 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem4#1) = -41*ULTIMATE.start_main_#t~mem4#1 + 790 Supporting invariants [41*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_2 - 40*ULTIMATE.start_main_#t~mem4#1 >= 0] [2023-11-29 02:23:01,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-11-29 02:23:01,604 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2023-11-29 02:23:01,607 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated [2023-11-29 02:23:01,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:23:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:23:01,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 02:23:01,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:23:01,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:23:01,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-11-29 02:23:01,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:01,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:01,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:01,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:01,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:01,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:01,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:01,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:01,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:23:02,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 02:23:02,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:23:02,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 25 [2023-11-29 02:23:02,127 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-29 02:23:02,128 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2023-11-29 02:23:02,128 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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-29 02:23:02,166 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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 43 states and 45 transitions. Complement of second has 6 states. [2023-11-29 02:23:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-29 02:23:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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-29 02:23:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2023-11-29 02:23:02,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2023-11-29 02:23:02,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 02:23:02,168 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 02:23:02,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:23:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:23:02,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 02:23:02,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:23:02,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:23:02,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-11-29 02:23:02,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:23:02,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 02:23:02,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:23:02,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 25 [2023-11-29 02:23:02,703 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-29 02:23:02,704 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2023-11-29 02:23:02,704 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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-29 02:23:02,744 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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 43 states and 45 transitions. Complement of second has 6 states. [2023-11-29 02:23:02,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-29 02:23:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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-29 02:23:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2023-11-29 02:23:02,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2023-11-29 02:23:02,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 02:23:02,746 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 02:23:02,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:23:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:23:02,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 02:23:02,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:23:02,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:23:02,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-11-29 02:23:02,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:02,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:03,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:03,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:03,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-29 02:23:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:23:03,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 02:23:03,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:23:03,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 25 [2023-11-29 02:23:03,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-11-29 02:23:03,211 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-29 02:23:03,212 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2023-11-29 02:23:03,212 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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-29 02:23:03,508 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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 59 states and 62 transitions. Complement of second has 45 states. [2023-11-29 02:23:03,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 12 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 02:23:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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-29 02:23:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2023-11-29 02:23:03,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 34 letters. Loop has 4 letters. [2023-11-29 02:23:03,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 02:23:03,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 38 letters. Loop has 4 letters. [2023-11-29 02:23:03,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 02:23:03,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 34 letters. Loop has 8 letters. [2023-11-29 02:23:03,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 02:23:03,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 62 transitions. [2023-11-29 02:23:03,513 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-29 02:23:03,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 0 states and 0 transitions. [2023-11-29 02:23:03,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-11-29 02:23:03,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-11-29 02:23:03,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-11-29 02:23:03,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:23:03,514 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 02:23:03,514 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 02:23:03,514 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 02:23:03,514 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-29 02:23:03,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-11-29 02:23:03,514 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-29 02:23:03,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-11-29 02:23:03,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 02:23:03 BoogieIcfgContainer [2023-11-29 02:23:03,520 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-29 02:23:03,520 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:23:03,520 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:23:03,521 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:23:03,521 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:22:48" (3/4) ... [2023-11-29 02:23:03,522 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 02:23:03,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:23:03,524 INFO L158 Benchmark]: Toolchain (without parser) took 15784.95ms. Allocated memory was 174.1MB in the beginning and 306.2MB in the end (delta: 132.1MB). Free memory was 127.1MB in the beginning and 241.4MB in the end (delta: -114.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2023-11-29 02:23:03,524 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:23:03,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.12ms. Allocated memory is still 174.1MB. Free memory was 127.1MB in the beginning and 111.3MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 02:23:03,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.47ms. Allocated memory is still 174.1MB. Free memory was 111.3MB in the beginning and 109.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:23:03,525 INFO L158 Benchmark]: Boogie Preprocessor took 37.31ms. Allocated memory is still 174.1MB. Free memory was 109.8MB in the beginning and 107.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:23:03,525 INFO L158 Benchmark]: RCFGBuilder took 271.41ms. Allocated memory is still 174.1MB. Free memory was 107.7MB in the beginning and 97.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 02:23:03,525 INFO L158 Benchmark]: BuchiAutomizer took 15106.01ms. Allocated memory was 174.1MB in the beginning and 306.2MB in the end (delta: 132.1MB). Free memory was 96.7MB in the beginning and 241.4MB in the end (delta: -144.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:23:03,526 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 306.2MB. Free memory is still 241.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:23:03,527 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.18ms. Allocated memory is still 113.2MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.12ms. Allocated memory is still 174.1MB. Free memory was 127.1MB in the beginning and 111.3MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.47ms. Allocated memory is still 174.1MB. Free memory was 111.3MB in the beginning and 109.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.31ms. Allocated memory is still 174.1MB. Free memory was 109.8MB in the beginning and 107.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 271.41ms. Allocated memory is still 174.1MB. Free memory was 107.7MB in the beginning and 97.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 15106.01ms. Allocated memory was 174.1MB in the beginning and 306.2MB in the end (delta: 132.1MB). Free memory was 96.7MB in the beginning and 241.4MB in the end (delta: -144.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 306.2MB. Free memory is still 241.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#0[~i~0!base][~i~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 15 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.0s and 6 iterations. TraceHistogramMax:11. Analysis of lassos took 12.5s. Construction of modules took 0.2s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 45 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital161 mio100 ax111 hnf100 lsp87 ukn77 mio100 lsp24 div100 bol100 ite100 ukn100 eq179 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-11-29 02:23:03,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 02:23:03,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 02:23:03,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5fec006-389f-4ed1-9a93-ebff38fd32e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE