./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array12_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/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_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array12_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/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_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/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 b994a1ec31b8c037535d8c99bc15e7231c0aea3fc6bbd2fe006bfaa61a5800c0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:39:28,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:39:28,847 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-29 05:39:28,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:39:28,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:39:28,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:39:28,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:39:28,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:39:28,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:39:28,880 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:39:28,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:39:28,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:39:28,882 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:39:28,882 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 05:39:28,883 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 05:39:28,883 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 05:39:28,884 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 05:39:28,884 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 05:39:28,885 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 05:39:28,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:39:28,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 05:39:28,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:39:28,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:39:28,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 05:39:28,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 05:39:28,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 05:39:28,889 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:39:28,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:39:28,889 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 05:39:28,890 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:39:28,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:39:28,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:39:28,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:39:28,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:39:28,892 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 05:39:28,892 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_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/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_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/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 -> b994a1ec31b8c037535d8c99bc15e7231c0aea3fc6bbd2fe006bfaa61a5800c0 [2023-11-29 05:39:29,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:39:29,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:39:29,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:39:29,145 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:39:29,145 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:39:29,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/termination-15/array12_alloca.i [2023-11-29 05:39:31,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:39:32,108 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:39:32,108 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/sv-benchmarks/c/termination-15/array12_alloca.i [2023-11-29 05:39:32,118 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/data/7226585f3/ec9c1200d49d45ed9d96cf880a8eca08/FLAGdcef77960 [2023-11-29 05:39:32,450 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/data/7226585f3/ec9c1200d49d45ed9d96cf880a8eca08 [2023-11-29 05:39:32,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:39:32,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:39:32,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:39:32,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:39:32,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:39:32,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6043fe8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32, skipping insertion in model container [2023-11-29 05:39:32,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,500 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:39:32,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:39:32,777 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:39:32,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:39:32,846 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:39:32,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32 WrapperNode [2023-11-29 05:39:32,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:39:32,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:39:32,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:39:32,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:39:32,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,884 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-11-29 05:39:32,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:39:32,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:39:32,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:39:32,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:39:32,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,905 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2023-11-29 05:39:32,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:39:32,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:39:32,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:39:32,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:39:32,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32" (1/1) ... [2023-11-29 05:39:32,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:32,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:32,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:32,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 05:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:39:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:39:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:39:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:39:32,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:39:33,055 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:39:33,057 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:39:33,183 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:39:33,191 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:39:33,191 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 05:39:33,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:39:33 BoogieIcfgContainer [2023-11-29 05:39:33,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:39:33,194 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 05:39:33,194 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 05:39:33,198 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 05:39:33,199 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 05:39:33,199 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 05:39:32" (1/3) ... [2023-11-29 05:39:33,200 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fb25083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 05:39:33, skipping insertion in model container [2023-11-29 05:39:33,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 05:39:33,201 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:32" (2/3) ... [2023-11-29 05:39:33,201 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fb25083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 05:39:33, skipping insertion in model container [2023-11-29 05:39:33,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 05:39:33,201 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:39:33" (3/3) ... [2023-11-29 05:39:33,203 INFO L332 chiAutomizerObserver]: Analyzing ICFG array12_alloca.i [2023-11-29 05:39:33,250 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 05:39:33,250 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 05:39:33,250 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 05:39:33,250 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 05:39:33,250 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 05:39:33,250 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 05:39:33,251 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 05:39:33,251 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 05:39:33,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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 05:39:33,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-29 05:39:33,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:33,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:33,278 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-29 05:39:33,278 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 05:39:33,279 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 05:39:33,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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 05:39:33,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-29 05:39:33,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:33,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:33,281 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-29 05:39:33,282 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 05:39:33,289 INFO L748 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 6#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4#L370-3true [2023-11-29 05:39:33,290 INFO L750 eck$LassoCheckResult]: Loop: 4#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12#L372true assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 4#L370-3true [2023-11-29 05:39:33,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:33,296 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2023-11-29 05:39:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:33,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561938330] [2023-11-29 05:39:33,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:33,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:33,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:33,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:33,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:33,443 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2023-11-29 05:39:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:33,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244410594] [2023-11-29 05:39:33,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:33,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:33,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:33,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:33,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:33,473 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2023-11-29 05:39:33,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:33,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980339625] [2023-11-29 05:39:33,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:33,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:33,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:33,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:33,805 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 05:39:33,805 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 05:39:33,805 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 05:39:33,805 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 05:39:33,805 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 05:39:33,806 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:33,806 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 05:39:33,806 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 05:39:33,806 INFO L133 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration1_Lasso [2023-11-29 05:39:33,806 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 05:39:33,806 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 05:39:33,821 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 05:39:33,829 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 05:39:33,833 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 05:39:33,978 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 05:39:33,981 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 05:39:33,984 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 05:39:33,987 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 05:39:33,991 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 05:39:33,994 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 05:39:33,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 05:39:34,000 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 05:39:34,275 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 05:39:34,279 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 05:39:34,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:34,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:34,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:34,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-29 05:39:34,317 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 05:39:34,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:34,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:39:34,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:34,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:34,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:34,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:39:34,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:39:34,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:34,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:39:34,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:34,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:34,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:34,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-29 05:39:34,358 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 05:39:34,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:34,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:34,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:34,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:34,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:39:34,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:39:34,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:34,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-11-29 05:39:34,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:34,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:34,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:34,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-29 05:39:34,393 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 05:39:34,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:34,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:34,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:34,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:34,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:39:34,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:39:34,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:34,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-29 05:39:34,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:34,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:34,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:34,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-29 05:39:34,428 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 05:39:34,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:34,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:34,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:34,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:34,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:39:34,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:39:34,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:34,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-11-29 05:39:34,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:34,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:34,455 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:34,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-29 05:39:34,460 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 05:39:34,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:34,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:34,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:34,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:34,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:39:34,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:39:34,504 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 05:39:34,539 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-11-29 05:39:34,540 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2023-11-29 05:39:34,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:34,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:34,567 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:34,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-29 05:39:34,569 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 05:39:34,583 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 05:39:34,583 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 05:39:34,584 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-11-29 05:39:34,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-11-29 05:39:34,602 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-11-29 05:39:34,611 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~arr~0!base] could not be translated [2023-11-29 05:39:34,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:34,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:39:34,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:34,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:39:34,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:34,695 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 05:39:34,728 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 05:39:34,731 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:39:34,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 48 transitions. Complement of second has 8 states. [2023-11-29 05:39:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 05:39:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:39:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2023-11-29 05:39:34,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 5 letters. Loop has 3 letters. [2023-11-29 05:39:34,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:39:34,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 8 letters. Loop has 3 letters. [2023-11-29 05:39:34,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:39:34,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 5 letters. Loop has 6 letters. [2023-11-29 05:39:34,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:39:34,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 48 transitions. [2023-11-29 05:39:34,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:34,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 12 states and 17 transitions. [2023-11-29 05:39:34,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-29 05:39:34,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-11-29 05:39:34,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2023-11-29 05:39:34,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:34,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-29 05:39:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2023-11-29 05:39:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-29 05:39:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:39:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2023-11-29 05:39:34,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-29 05:39:34,826 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-29 05:39:34,827 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 05:39:34,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2023-11-29 05:39:34,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:34,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:34,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:34,828 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:34,828 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:39:34,828 INFO L748 eck$LassoCheckResult]: Stem: 117#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 118#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 119#L367 assume !(main_~length~0#1 < 1); 111#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 112#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 113#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 114#L370-4 main_~j~0#1 := 0; 115#L378-2 [2023-11-29 05:39:34,828 INFO L750 eck$LassoCheckResult]: Loop: 115#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 116#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 115#L378-2 [2023-11-29 05:39:34,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2023-11-29 05:39:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:34,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7526229] [2023-11-29 05:39:34,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:34,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:34,907 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 05:39:34,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:34,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7526229] [2023-11-29 05:39:34,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7526229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:39:34,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:39:34,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:39:34,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496303299] [2023-11-29 05:39:34,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:39:34,911 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:39:34,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:34,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2023-11-29 05:39:34,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:34,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280054053] [2023-11-29 05:39:34,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:34,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:34,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:34,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:34,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:34,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:39:34,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:39:34,985 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:39:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:35,016 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2023-11-29 05:39:35,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2023-11-29 05:39:35,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:35,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2023-11-29 05:39:35,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-11-29 05:39:35,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-11-29 05:39:35,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2023-11-29 05:39:35,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:35,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-29 05:39:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2023-11-29 05:39:35,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2023-11-29 05:39:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:39:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2023-11-29 05:39:35,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-29 05:39:35,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:39:35,022 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-29 05:39:35,022 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 05:39:35,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2023-11-29 05:39:35,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:35,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:35,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:35,024 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:35,024 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:39:35,024 INFO L748 eck$LassoCheckResult]: Stem: 150#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 152#L367 assume !(main_~length~0#1 < 1); 144#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 145#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 146#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 153#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 155#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 154#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 147#L370-4 main_~j~0#1 := 0; 148#L378-2 [2023-11-29 05:39:35,024 INFO L750 eck$LassoCheckResult]: Loop: 148#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 149#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 148#L378-2 [2023-11-29 05:39:35,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:35,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2023-11-29 05:39:35,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:35,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69410423] [2023-11-29 05:39:35,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:35,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:35,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:35,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:35,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2023-11-29 05:39:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:35,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671835095] [2023-11-29 05:39:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:35,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:35,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:35,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:35,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2023-11-29 05:39:35,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:35,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126654784] [2023-11-29 05:39:35,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:35,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:35,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:35,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126654784] [2023-11-29 05:39:35,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126654784] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:35,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914771879] [2023-11-29 05:39:35,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:35,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:35,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:35,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:35,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:39:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:35,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 05:39:35,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:35,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-11-29 05:39:35,472 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 15 treesize of output 1 [2023-11-29 05:39:35,523 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 15 treesize of output 7 [2023-11-29 05:39:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:35,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:35,599 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 16 treesize of output 14 [2023-11-29 05:39:35,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2023-11-29 05:39:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:35,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914771879] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:35,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:35,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2023-11-29 05:39:35,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477400125] [2023-11-29 05:39:35,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:35,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:35,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:39:35,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:39:35,669 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:39:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:35,784 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2023-11-29 05:39:35,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2023-11-29 05:39:35,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-29 05:39:35,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2023-11-29 05:39:35,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-29 05:39:35,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-29 05:39:35,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2023-11-29 05:39:35,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:35,787 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-11-29 05:39:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2023-11-29 05:39:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2023-11-29 05:39:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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 05:39:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2023-11-29 05:39:35,789 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2023-11-29 05:39:35,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:39:35,793 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2023-11-29 05:39:35,793 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 05:39:35,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2023-11-29 05:39:35,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:35,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:35,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:35,795 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:35,795 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:39:35,796 INFO L748 eck$LassoCheckResult]: Stem: 274#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 276#L367 assume !(main_~length~0#1 < 1); 268#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 269#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 270#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 277#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 282#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 278#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 279#L370-4 main_~j~0#1 := 0; 281#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 271#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 272#L378-2 [2023-11-29 05:39:35,796 INFO L750 eck$LassoCheckResult]: Loop: 272#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 283#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 272#L378-2 [2023-11-29 05:39:35,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2023-11-29 05:39:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:35,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481606367] [2023-11-29 05:39:35,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:35,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:35,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:35,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:35,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:35,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2023-11-29 05:39:35,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:35,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946065408] [2023-11-29 05:39:35,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:35,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:35,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:35,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:35,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:35,830 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2023-11-29 05:39:35,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:35,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959779459] [2023-11-29 05:39:35,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:35,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:35,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:35,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959779459] [2023-11-29 05:39:35,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959779459] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:35,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295197252] [2023-11-29 05:39:35,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:35,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:35,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:35,907 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:35,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:39:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:35,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:39:35,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:36,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:36,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295197252] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:36,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:36,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-29 05:39:36,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452155677] [2023-11-29 05:39:36,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:36,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:36,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:39:36,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:39:36,113 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:39:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:36,227 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2023-11-29 05:39:36,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2023-11-29 05:39:36,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-29 05:39:36,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 51 transitions. [2023-11-29 05:39:36,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-11-29 05:39:36,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-11-29 05:39:36,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2023-11-29 05:39:36,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:36,230 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-29 05:39:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2023-11-29 05:39:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2023-11-29 05:39:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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 05:39:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2023-11-29 05:39:36,235 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-29 05:39:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:39:36,236 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-29 05:39:36,236 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 05:39:36,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2023-11-29 05:39:36,237 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-29 05:39:36,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:36,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:36,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:36,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:39:36,238 INFO L748 eck$LassoCheckResult]: Stem: 441#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 442#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 443#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 434#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 435#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 436#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 466#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 464#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 465#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 463#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 461#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 458#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 437#L370-4 main_~j~0#1 := 0; 438#L378-2 [2023-11-29 05:39:36,238 INFO L750 eck$LassoCheckResult]: Loop: 438#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 450#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 438#L378-2 [2023-11-29 05:39:36,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:36,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2023-11-29 05:39:36,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:36,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542952407] [2023-11-29 05:39:36,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:36,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:36,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:36,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542952407] [2023-11-29 05:39:36,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542952407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:36,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226735079] [2023-11-29 05:39:36,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:36,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:36,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:36,294 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:36,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 05:39:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:36,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:39:36,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:36,402 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:39:36,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226735079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:39:36,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:39:36,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-29 05:39:36,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943724053] [2023-11-29 05:39:36,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:39:36,403 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:39:36,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2023-11-29 05:39:36,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:36,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550247030] [2023-11-29 05:39:36,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:36,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:36,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:36,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:36,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:39:36,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:39:36,459 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:39:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:36,497 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-11-29 05:39:36,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2023-11-29 05:39:36,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:36,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2023-11-29 05:39:36,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-29 05:39:36,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-29 05:39:36,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2023-11-29 05:39:36,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:36,499 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-11-29 05:39:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2023-11-29 05:39:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-29 05:39:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 05:39:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-11-29 05:39:36,502 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-11-29 05:39:36,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:39:36,503 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-11-29 05:39:36,503 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-29 05:39:36,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2023-11-29 05:39:36,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:36,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:36,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:36,505 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:36,505 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:39:36,505 INFO L748 eck$LassoCheckResult]: Stem: 547#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 548#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 549#L367 assume !(main_~length~0#1 < 1); 541#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 542#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 543#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 550#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 553#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 551#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 552#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 560#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 557#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 544#L370-4 main_~j~0#1 := 0; 545#L378-2 [2023-11-29 05:39:36,505 INFO L750 eck$LassoCheckResult]: Loop: 545#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 554#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 545#L378-2 [2023-11-29 05:39:36,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:36,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2023-11-29 05:39:36,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:36,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148155333] [2023-11-29 05:39:36,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:36,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:36,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:36,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:36,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2023-11-29 05:39:36,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:36,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925853111] [2023-11-29 05:39:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:36,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:36,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:36,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:36,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:36,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2023-11-29 05:39:36,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:36,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448840788] [2023-11-29 05:39:36,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:36,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:36,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:36,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448840788] [2023-11-29 05:39:36,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448840788] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:36,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331561274] [2023-11-29 05:39:36,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:36,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:36,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:36,864 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:36,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 05:39:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:36,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 05:39:36,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:36,951 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 15 treesize of output 1 [2023-11-29 05:39:37,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:39:37,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 05:39:37,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:39:37,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 05:39:37,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:39:37,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:39:37,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2023-11-29 05:39:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:37,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:37,253 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 16 treesize of output 14 [2023-11-29 05:39:37,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2023-11-29 05:39:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:39:37,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331561274] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:37,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:37,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 20 [2023-11-29 05:39:37,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621304178] [2023-11-29 05:39:37,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:37,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:37,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 05:39:37,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2023-11-29 05:39:37,324 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 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 05:39:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:37,556 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2023-11-29 05:39:37,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2023-11-29 05:39:37,557 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-29 05:39:37,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2023-11-29 05:39:37,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-11-29 05:39:37,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-11-29 05:39:37,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2023-11-29 05:39:37,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:37,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2023-11-29 05:39:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2023-11-29 05:39:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2023-11-29 05:39:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 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 05:39:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-29 05:39:37,562 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-29 05:39:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:39:37,563 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-29 05:39:37,563 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-29 05:39:37,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2023-11-29 05:39:37,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:37,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:37,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:37,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:37,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:39:37,565 INFO L748 eck$LassoCheckResult]: Stem: 719#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 720#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 721#L367 assume !(main_~length~0#1 < 1); 712#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 713#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 714#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 722#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 727#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 723#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 724#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 725#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 726#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 717#L370-4 main_~j~0#1 := 0; 718#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 715#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 716#L378-2 [2023-11-29 05:39:37,565 INFO L750 eck$LassoCheckResult]: Loop: 716#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 728#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 716#L378-2 [2023-11-29 05:39:37,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:37,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2023-11-29 05:39:37,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:37,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383784728] [2023-11-29 05:39:37,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:37,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:37,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:37,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:37,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:37,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2023-11-29 05:39:37,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:37,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765655462] [2023-11-29 05:39:37,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:37,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:37,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:37,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:37,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:37,596 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2023-11-29 05:39:37,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:37,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136935963] [2023-11-29 05:39:37,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:37,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:37,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:37,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136935963] [2023-11-29 05:39:37,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136935963] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:37,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143665623] [2023-11-29 05:39:37,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:39:37,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:37,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:37,752 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:37,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 05:39:37,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:39:37,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:39:37,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:39:37,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:37,885 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 15 treesize of output 1 [2023-11-29 05:39:37,985 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 15 treesize of output 7 [2023-11-29 05:39:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:37,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:38,058 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 18 treesize of output 16 [2023-11-29 05:39:38,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2023-11-29 05:39:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:38,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143665623] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:38,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:38,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2023-11-29 05:39:38,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294156740] [2023-11-29 05:39:38,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:38,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 05:39:38,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:39:38,126 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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 05:39:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:38,281 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2023-11-29 05:39:38,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2023-11-29 05:39:38,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-29 05:39:38,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2023-11-29 05:39:38,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2023-11-29 05:39:38,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-11-29 05:39:38,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2023-11-29 05:39:38,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:38,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-29 05:39:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2023-11-29 05:39:38,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-11-29 05:39:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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 05:39:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-29 05:39:38,286 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-29 05:39:38,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:39:38,287 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-29 05:39:38,287 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-29 05:39:38,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2023-11-29 05:39:38,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:38,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:38,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:38,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:38,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:39:38,289 INFO L748 eck$LassoCheckResult]: Stem: 892#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 893#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 894#L367 assume !(main_~length~0#1 < 1); 886#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 887#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 888#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 895#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 903#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 896#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 897#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 898#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 900#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 901#L370-4 main_~j~0#1 := 0; 906#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 891#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 890#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 899#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 905#L378-2 [2023-11-29 05:39:38,289 INFO L750 eck$LassoCheckResult]: Loop: 905#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 904#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 905#L378-2 [2023-11-29 05:39:38,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:38,289 INFO L85 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2023-11-29 05:39:38,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:38,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134673741] [2023-11-29 05:39:38,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:38,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:38,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:38,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:38,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:38,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2023-11-29 05:39:38,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:38,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325980299] [2023-11-29 05:39:38,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:38,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:38,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:38,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:38,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2023-11-29 05:39:38,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:38,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411141677] [2023-11-29 05:39:38,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:38,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:38,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:38,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411141677] [2023-11-29 05:39:38,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411141677] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971190124] [2023-11-29 05:39:38,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:39:38,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:38,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:38,431 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:38,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 05:39:38,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 05:39:38,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:39:38,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:39:38,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:38,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:38,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:38,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971190124] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:38,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:38,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-29 05:39:38,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393850327] [2023-11-29 05:39:38,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:38,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:38,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:39:38,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:39:38,669 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 10 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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 05:39:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:38,768 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2023-11-29 05:39:38,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2023-11-29 05:39:38,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:38,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 37 transitions. [2023-11-29 05:39:38,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-29 05:39:38,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-29 05:39:38,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2023-11-29 05:39:38,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:38,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-29 05:39:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2023-11-29 05:39:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-11-29 05:39:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 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 05:39:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-11-29 05:39:38,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-11-29 05:39:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:39:38,774 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-11-29 05:39:38,774 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-29 05:39:38,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2023-11-29 05:39:38,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:38,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:38,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:38,776 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:38,776 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:39:38,776 INFO L748 eck$LassoCheckResult]: Stem: 1087#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1088#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1089#L367 assume !(main_~length~0#1 < 1); 1080#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1081#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1082#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1090#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1093#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1094#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1104#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1105#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1091#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1092#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1103#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1095#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1096#L370-4 main_~j~0#1 := 0; 1086#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1102#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1101#L378-2 [2023-11-29 05:39:38,776 INFO L750 eck$LassoCheckResult]: Loop: 1101#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1100#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1101#L378-2 [2023-11-29 05:39:38,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:38,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1742222883, now seen corresponding path program 1 times [2023-11-29 05:39:38,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:38,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522802105] [2023-11-29 05:39:38,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:38,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:38,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:38,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:38,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:38,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2023-11-29 05:39:38,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:38,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515844923] [2023-11-29 05:39:38,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:38,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:38,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:38,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:38,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash -761053530, now seen corresponding path program 1 times [2023-11-29 05:39:38,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:38,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295271029] [2023-11-29 05:39:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:38,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:39,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295271029] [2023-11-29 05:39:39,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295271029] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:39,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838849358] [2023-11-29 05:39:39,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:39,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:39,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:39,040 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:39,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 05:39:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:39,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 05:39:39,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:39,170 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 15 treesize of output 1 [2023-11-29 05:39:39,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 05:39:39,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 05:39:39,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:39:39,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 05:39:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:39,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:39,524 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 26 treesize of output 24 [2023-11-29 05:39:39,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 38 [2023-11-29 05:39:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:39,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838849358] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:39,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:39,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 25 [2023-11-29 05:39:39,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890966374] [2023-11-29 05:39:39,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:39,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:39,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:39:39,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2023-11-29 05:39:39,620 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 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 05:39:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:40,088 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2023-11-29 05:39:40,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 69 transitions. [2023-11-29 05:39:40,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-29 05:39:40,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 69 transitions. [2023-11-29 05:39:40,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-11-29 05:39:40,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-11-29 05:39:40,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 69 transitions. [2023-11-29 05:39:40,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:40,090 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 69 transitions. [2023-11-29 05:39:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 69 transitions. [2023-11-29 05:39:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2023-11-29 05:39:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 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 05:39:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-11-29 05:39:40,094 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-11-29 05:39:40,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:39:40,095 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-11-29 05:39:40,095 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-29 05:39:40,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2023-11-29 05:39:40,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:40,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:40,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:40,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:40,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:39:40,097 INFO L748 eck$LassoCheckResult]: Stem: 1346#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1347#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1348#L367 assume !(main_~length~0#1 < 1); 1340#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1341#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1342#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1349#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1356#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1357#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1358#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1359#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1350#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1351#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1354#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1355#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1345#L370-4 main_~j~0#1 := 0; 1344#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1352#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1363#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1362#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1361#L378-2 [2023-11-29 05:39:40,097 INFO L750 eck$LassoCheckResult]: Loop: 1361#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1360#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1361#L378-2 [2023-11-29 05:39:40,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:40,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1570400154, now seen corresponding path program 4 times [2023-11-29 05:39:40,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:40,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368793182] [2023-11-29 05:39:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:40,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:40,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:40,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:40,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2023-11-29 05:39:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:40,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649928055] [2023-11-29 05:39:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:40,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:40,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:40,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:40,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025751, now seen corresponding path program 4 times [2023-11-29 05:39:40,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:40,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835841753] [2023-11-29 05:39:40,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:40,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:40,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:40,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835841753] [2023-11-29 05:39:40,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835841753] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:40,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921942137] [2023-11-29 05:39:40,345 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:39:40,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:40,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:40,353 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:40,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 05:39:40,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:39:40,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:39:40,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:39:40,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:40,447 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 19 treesize of output 1 [2023-11-29 05:39:40,517 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 19 treesize of output 7 [2023-11-29 05:39:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:40,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:40,603 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 18 treesize of output 16 [2023-11-29 05:39:40,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2023-11-29 05:39:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:40,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921942137] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:40,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:40,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2023-11-29 05:39:40,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839556620] [2023-11-29 05:39:40,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:40,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:39:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:39:40,670 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 9 Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 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 05:39:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:40,825 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2023-11-29 05:39:40,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2023-11-29 05:39:40,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-29 05:39:40,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2023-11-29 05:39:40,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-11-29 05:39:40,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-11-29 05:39:40,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2023-11-29 05:39:40,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:40,828 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 55 transitions. [2023-11-29 05:39:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2023-11-29 05:39:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2023-11-29 05:39:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 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 05:39:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2023-11-29 05:39:40,831 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-29 05:39:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:39:40,832 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-29 05:39:40,832 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-29 05:39:40,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2023-11-29 05:39:40,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:40,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:40,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:40,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:40,833 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:39:40,833 INFO L748 eck$LassoCheckResult]: Stem: 1569#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1570#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1571#L367 assume !(main_~length~0#1 < 1); 1563#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1564#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1565#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1572#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1580#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1581#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1582#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1583#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1573#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1574#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1576#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1577#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1578#L370-4 main_~j~0#1 := 0; 1588#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1566#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1567#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1575#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1587#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1586#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1585#L378-2 [2023-11-29 05:39:40,833 INFO L750 eck$LassoCheckResult]: Loop: 1585#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1584#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1585#L378-2 [2023-11-29 05:39:40,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:40,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025749, now seen corresponding path program 5 times [2023-11-29 05:39:40,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:40,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948964130] [2023-11-29 05:39:40,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:40,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:40,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:40,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:40,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:40,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2023-11-29 05:39:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:40,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084528311] [2023-11-29 05:39:40,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:40,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:40,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:40,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:40,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:40,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1267385006, now seen corresponding path program 5 times [2023-11-29 05:39:40,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:40,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520507083] [2023-11-29 05:39:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:40,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:40,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:40,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520507083] [2023-11-29 05:39:40,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520507083] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:40,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866508791] [2023-11-29 05:39:40,976 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:39:40,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:40,978 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:40,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 05:39:41,049 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-29 05:39:41,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:39:41,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 05:39:41,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:41,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:41,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866508791] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:41,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:41,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-29 05:39:41,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046397973] [2023-11-29 05:39:41,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:41,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:41,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:39:41,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:39:41,264 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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 05:39:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:41,366 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2023-11-29 05:39:41,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2023-11-29 05:39:41,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:41,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 34 states and 43 transitions. [2023-11-29 05:39:41,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-11-29 05:39:41,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-11-29 05:39:41,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2023-11-29 05:39:41,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:41,368 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-29 05:39:41,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2023-11-29 05:39:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-11-29 05:39:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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 05:39:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-11-29 05:39:41,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-11-29 05:39:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:39:41,372 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-11-29 05:39:41,372 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-29 05:39:41,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2023-11-29 05:39:41,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:41,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:41,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:41,373 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:41,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:39:41,373 INFO L748 eck$LassoCheckResult]: Stem: 1810#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1811#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1812#L367 assume !(main_~length~0#1 < 1); 1804#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1805#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1806#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1813#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1826#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1814#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1815#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1817#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1818#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1825#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1824#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1822#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1823#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1821#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1819#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1809#L370-4 main_~j~0#1 := 0; 1808#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1816#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1830#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1829#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1828#L378-2 [2023-11-29 05:39:41,374 INFO L750 eck$LassoCheckResult]: Loop: 1828#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1827#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1828#L378-2 [2023-11-29 05:39:41,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:41,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1476197922, now seen corresponding path program 2 times [2023-11-29 05:39:41,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:41,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537395888] [2023-11-29 05:39:41,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:41,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:41,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:41,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:41,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:41,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2023-11-29 05:39:41,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:41,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369564723] [2023-11-29 05:39:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:41,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:41,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:41,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:41,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:41,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996709, now seen corresponding path program 2 times [2023-11-29 05:39:41,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:41,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439355084] [2023-11-29 05:39:41,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:41,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:41,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:41,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439355084] [2023-11-29 05:39:41,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439355084] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:41,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115142114] [2023-11-29 05:39:41,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:39:41,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:41,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:41,680 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:41,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 05:39:41,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:39:41,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:39:41,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 05:39:41,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:41,843 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 15 treesize of output 1 [2023-11-29 05:39:41,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:39:41,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 05:39:41,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:39:41,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 05:39:42,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:39:42,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:39:42,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2023-11-29 05:39:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:42,147 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:42,295 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 18 treesize of output 16 [2023-11-29 05:39:42,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2023-11-29 05:39:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:39:42,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115142114] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:42,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:42,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 26 [2023-11-29 05:39:42,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367779407] [2023-11-29 05:39:42,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:42,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:42,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 05:39:42,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2023-11-29 05:39:42,363 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 11 Second operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 27 states have internal predecessors, (53), 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 05:39:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:42,789 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2023-11-29 05:39:42,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2023-11-29 05:39:42,790 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-29 05:39:42,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 58 transitions. [2023-11-29 05:39:42,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-11-29 05:39:42,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-11-29 05:39:42,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 58 transitions. [2023-11-29 05:39:42,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:42,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 58 transitions. [2023-11-29 05:39:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 58 transitions. [2023-11-29 05:39:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 27. [2023-11-29 05:39:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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 05:39:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-11-29 05:39:42,794 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-29 05:39:42,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 05:39:42,797 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-29 05:39:42,797 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-29 05:39:42,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2023-11-29 05:39:42,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:42,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:42,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:42,798 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:42,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:39:42,799 INFO L748 eck$LassoCheckResult]: Stem: 2086#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2087#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2088#L367 assume !(main_~length~0#1 < 1); 2079#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2080#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2081#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2089#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2093#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2090#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2091#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2101#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2100#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2099#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2098#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2097#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2095#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2096#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2094#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2082#L370-4 main_~j~0#1 := 0; 2083#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2084#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2085#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2092#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2105#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2104#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2103#L378-2 [2023-11-29 05:39:42,799 INFO L750 eck$LassoCheckResult]: Loop: 2103#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2102#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2103#L378-2 [2023-11-29 05:39:42,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:42,800 INFO L85 PathProgramCache]: Analyzing trace with hash 893969701, now seen corresponding path program 6 times [2023-11-29 05:39:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:42,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243886497] [2023-11-29 05:39:42,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:42,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:42,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:42,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:42,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2023-11-29 05:39:42,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:42,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065848504] [2023-11-29 05:39:42,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:42,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:42,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:42,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:42,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash 111424808, now seen corresponding path program 6 times [2023-11-29 05:39:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:42,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668230765] [2023-11-29 05:39:42,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:43,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:43,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668230765] [2023-11-29 05:39:43,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668230765] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:43,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784154313] [2023-11-29 05:39:43,039 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 05:39:43,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:43,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:43,042 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:43,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 05:39:43,121 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-29 05:39:43,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:39:43,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 05:39:43,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:43,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 23 treesize of output 1 [2023-11-29 05:39:43,511 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 05:39:43,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2023-11-29 05:39:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:43,513 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:43,899 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 20 treesize of output 18 [2023-11-29 05:39:43,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 20 [2023-11-29 05:39:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:39:43,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784154313] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:43,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:43,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2023-11-29 05:39:43,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26125092] [2023-11-29 05:39:43,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:43,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:43,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 05:39:43,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 05:39:43,990 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 8 Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:39:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:46,341 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-11-29 05:39:46,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2023-11-29 05:39:46,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-29 05:39:46,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2023-11-29 05:39:46,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-11-29 05:39:46,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-29 05:39:46,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2023-11-29 05:39:46,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:46,343 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 47 transitions. [2023-11-29 05:39:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2023-11-29 05:39:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. [2023-11-29 05:39:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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 05:39:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-11-29 05:39:46,344 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-11-29 05:39:46,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 05:39:46,345 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-11-29 05:39:46,345 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-29 05:39:46,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2023-11-29 05:39:46,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 05:39:46,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:39:46,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:39:46,346 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:46,346 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 05:39:46,347 INFO L748 eck$LassoCheckResult]: Stem: 2395#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2396#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2397#L367 assume !(main_~length~0#1 < 1); 2389#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2390#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2391#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2398#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2409#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2399#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2400#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2401#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2402#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2408#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2407#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2406#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2404#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2405#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2403#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2394#L370-4 main_~j~0#1 := 0; 2393#L378-2 [2023-11-29 05:39:46,347 INFO L750 eck$LassoCheckResult]: Loop: 2393#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2392#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2393#L378-2 [2023-11-29 05:39:46,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:46,347 INFO L85 PathProgramCache]: Analyzing trace with hash -49003114, now seen corresponding path program 2 times [2023-11-29 05:39:46,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:46,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517373316] [2023-11-29 05:39:46,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:46,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:46,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:46,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2023-11-29 05:39:46,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:46,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214580977] [2023-11-29 05:39:46,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:46,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:46,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:46,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:46,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash 152649051, now seen corresponding path program 7 times [2023-11-29 05:39:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:46,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100552383] [2023-11-29 05:39:46,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:46,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:46,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:39:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:39:46,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:39:46,931 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 05:39:46,931 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 05:39:46,931 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 05:39:46,931 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 05:39:46,931 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 05:39:46,931 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:46,931 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 05:39:46,931 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 05:39:46,931 INFO L133 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration14_Lasso [2023-11-29 05:39:46,931 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 05:39:46,931 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 05:39:46,942 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 05:39:46,944 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 05:39:46,945 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 05:39:46,947 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 05:39:46,948 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 05:39:46,950 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 05:39:46,951 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 05:39:46,953 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 05:39:46,955 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 05:39:46,956 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 05:39:47,117 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 05:39:47,264 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 05:39:47,264 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 05:39:47,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,265 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-29 05:39:47,268 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 05:39:47,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:39:47,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:39:47,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:39:47,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-11-29 05:39:47,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,284 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-29 05:39:47,286 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 05:39:47,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:39:47,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:39:47,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:39:47,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-11-29 05:39:47,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,301 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-29 05:39:47,304 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 05:39:47,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:39:47,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:39:47,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:39:47,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-11-29 05:39:47,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,319 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-29 05:39:47,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 05:39:47,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:39:47,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:39:47,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:39:47,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-11-29 05:39:47,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,338 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-29 05:39:47,340 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 05:39:47,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:39:47,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:39:47,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:39:47,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-11-29 05:39:47,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,356 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-29 05:39:47,358 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 05:39:47,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:39:47,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:39:47,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:39:47,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-11-29 05:39:47,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,374 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-29 05:39:47,376 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 05:39:47,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:39:47,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:39:47,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:39:47,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-11-29 05:39:47,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,391 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-29 05:39:47,394 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 05:39:47,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:39:47,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:39:47,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-29 05:39:47,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,415 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-29 05:39:47,417 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 05:39:47,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 05:39:47,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 05:39:47,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 05:39:47,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-11-29 05:39:47,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,433 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-29 05:39:47,435 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 05:39:47,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:39:47,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:39:47,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-11-29 05:39:47,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,454 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-29 05:39:47,456 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 05:39:47,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:39:47,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:39:47,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-11-29 05:39:47,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,477 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-29 05:39:47,479 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 05:39:47,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:39:47,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:39:47,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-11-29 05:39:47,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,501 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-29 05:39:47,503 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 05:39:47,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:39:47,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:39:47,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-11-29 05:39:47,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,521 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-29 05:39:47,523 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 05:39:47,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:39:47,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:39:47,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 05:39:47,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-11-29 05:39:47,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,544 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-29 05:39:47,546 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 05:39:47,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 05:39:47,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 05:39:47,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 05:39:47,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 05:39:47,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 05:39:47,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 05:39:47,571 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 05:39:47,600 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2023-11-29 05:39:47,600 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2023-11-29 05:39:47,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:39:47,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:47,601 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:47,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-29 05:39:47,603 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 05:39:47,614 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 05:39:47,614 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 05:39:47,614 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2023-11-29 05:39:47,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-11-29 05:39:47,623 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-11-29 05:39:47,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:47,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:39:47,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:47,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:39:47,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:47,680 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 05:39:47,681 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 05:39:47,681 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:39:47,692 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 29 transitions. Complement of second has 4 states. [2023-11-29 05:39:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-29 05:39:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:39:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2023-11-29 05:39:47,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 2 letters. [2023-11-29 05:39:47,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:39:47,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 21 letters. Loop has 2 letters. [2023-11-29 05:39:47,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:39:47,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2023-11-29 05:39:47,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 05:39:47,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2023-11-29 05:39:47,694 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-29 05:39:47,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2023-11-29 05:39:47,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-11-29 05:39:47,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-11-29 05:39:47,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-11-29 05:39:47,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:39:47,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:39:47,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:39:47,695 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:39:47,695 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-29 05:39:47,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:39:47,695 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-29 05:39:47,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-11-29 05:39:47,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 05:39:47 BoogieIcfgContainer [2023-11-29 05:39:47,702 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-29 05:39:47,702 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:39:47,702 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:39:47,702 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:39:47,703 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:39:33" (3/4) ... [2023-11-29 05:39:47,704 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:39:47,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:39:47,705 INFO L158 Benchmark]: Toolchain (without parser) took 15251.49ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 117.7MB in the beginning and 117.2MB in the end (delta: 451.4kB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2023-11-29 05:39:47,706 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:39:47,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.71ms. Allocated memory is still 157.3MB. Free memory was 117.7MB in the beginning and 116.5MB in the end (delta: 1.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 05:39:47,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.41ms. Allocated memory is still 157.3MB. Free memory was 116.5MB in the beginning and 114.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:39:47,706 INFO L158 Benchmark]: Boogie Preprocessor took 32.98ms. Allocated memory is still 157.3MB. Free memory was 114.3MB in the beginning and 112.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:39:47,707 INFO L158 Benchmark]: RCFGBuilder took 274.86ms. Allocated memory is still 157.3MB. Free memory was 112.3MB in the beginning and 101.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 05:39:47,707 INFO L158 Benchmark]: BuchiAutomizer took 14507.60ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 101.0MB in the beginning and 117.2MB in the end (delta: -16.2MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2023-11-29 05:39:47,707 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 226.5MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:39:47,709 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.15ms. Allocated memory is still 115.3MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.71ms. Allocated memory is still 157.3MB. Free memory was 117.7MB in the beginning and 116.5MB in the end (delta: 1.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.41ms. Allocated memory is still 157.3MB. Free memory was 116.5MB in the beginning and 114.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.98ms. Allocated memory is still 157.3MB. Free memory was 114.3MB in the beginning and 112.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 274.86ms. Allocated memory is still 157.3MB. Free memory was 112.3MB in the beginning and 101.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 14507.60ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 101.0MB in the beginning and 117.2MB in the end (delta: -16.2MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 226.5MB. Free memory is still 117.2MB. 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 #length[~arr~0!base] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (12 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function ((-1 * j) + length) and consists of 3 locations. 12 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.4s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 9.7s. Construction of modules took 2.4s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 117 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 636 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 634 mSDsluCounter, 610 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 483 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1843 IncrementalHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 127 mSDtfsCounter, 1843 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc10 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital129 mio100 ax100 hnf100 lsp96 ukn74 mio100 lsp54 div137 bol100 ite100 ukn100 eq156 hnf92 smp86 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-11-29 05:39:47,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-11-29 05:39:47,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-29 05:39:48,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-29 05:39:48,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 05:39:48,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 05:39:48,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-29 05:39:48,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-29 05:39:49,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-29 05:39:49,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 05:39:49,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 05:39:49,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 05:39:49,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 05:39:50,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb4f2de6-ec4a-49d6-9bad-963caebc2f4b/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