./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/eureka_05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9bd2c7ff 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_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/eureka_05.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu --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 32bit --witnessprinter.graph.data.programhash 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:50:19,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:50:19,110 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-19 07:50:19,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:50:19,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:50:19,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:50:19,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:50:19,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:50:19,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:50:19,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:50:19,146 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:50:19,146 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-19 07:50:19,147 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-19 07:50:19,147 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-19 07:50:19,148 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-19 07:50:19,148 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-19 07:50:19,149 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-19 07:50:19,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:50:19,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-19 07:50:19,150 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:50:19,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:50:19,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:50:19,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:50:19,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-19 07:50:19,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-19 07:50:19,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-19 07:50:19,153 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:50:19,154 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:50:19,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:50:19,155 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-19 07:50:19,155 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:50:19,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:50:19,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:50:19,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:50:19,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:50:19,157 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-19 07:50:19,158 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_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/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_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab [2023-11-19 07:50:19,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:50:19,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:50:19,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:50:19,437 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:50:19,437 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:50:19,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/loops/eureka_05.i [2023-11-19 07:50:22,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:50:22,884 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:50:22,885 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/sv-benchmarks/c/loops/eureka_05.i [2023-11-19 07:50:22,893 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/data/3ab6af26b/413a97afa48d49cfa50dfe0e8703839c/FLAG4f1f6c165 [2023-11-19 07:50:22,909 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/data/3ab6af26b/413a97afa48d49cfa50dfe0e8703839c [2023-11-19 07:50:22,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:50:22,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:50:22,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:50:22,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:50:22,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:50:22,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:50:22" (1/1) ... [2023-11-19 07:50:22,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae4276d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:22, skipping insertion in model container [2023-11-19 07:50:22,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:50:22" (1/1) ... [2023-11-19 07:50:22,946 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:50:23,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:50:23,137 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:50:23,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:50:23,173 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:50:23,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:23 WrapperNode [2023-11-19 07:50:23,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:50:23,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:50:23,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:50:23,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:50:23,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:23" (1/1) ... [2023-11-19 07:50:23,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:23" (1/1) ... [2023-11-19 07:50:23,216 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 86 [2023-11-19 07:50:23,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:50:23,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:50:23,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:50:23,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:50:23,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:23" (1/1) ... [2023-11-19 07:50:23,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:23" (1/1) ... [2023-11-19 07:50:23,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:23" (1/1) ... [2023-11-19 07:50:23,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:23" (1/1) ... [2023-11-19 07:50:23,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:23" (1/1) ... [2023-11-19 07:50:23,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:23" (1/1) ... [2023-11-19 07:50:23,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:23" (1/1) ... [2023-11-19 07:50:23,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:23" (1/1) ... [2023-11-19 07:50:23,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:50:23,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:50:23,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:50:23,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:50:23,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:23" (1/1) ... [2023-11-19 07:50:23,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:23,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:23,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:23,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-19 07:50:23,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:50:23,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:50:23,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:50:23,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:50:23,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:50:23,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:50:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:50:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:50:23,470 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:50:23,472 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:50:23,716 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:50:23,739 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:50:23,740 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 07:50:23,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:23 BoogieIcfgContainer [2023-11-19 07:50:23,743 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:50:23,751 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-19 07:50:23,751 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-19 07:50:23,755 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-19 07:50:23,758 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:50:23,758 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 07:50:22" (1/3) ... [2023-11-19 07:50:23,759 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c48ee21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:50:23, skipping insertion in model container [2023-11-19 07:50:23,760 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:50:23,760 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:23" (2/3) ... [2023-11-19 07:50:23,763 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c48ee21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:50:23, skipping insertion in model container [2023-11-19 07:50:23,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:50:23,763 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:23" (3/3) ... [2023-11-19 07:50:23,764 INFO L332 chiAutomizerObserver]: Analyzing ICFG eureka_05.i [2023-11-19 07:50:23,813 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-19 07:50:23,813 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-19 07:50:23,814 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-19 07:50:23,814 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-19 07:50:23,814 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-19 07:50:23,814 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-19 07:50:23,814 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-19 07:50:23,814 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-19 07:50:23,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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-19 07:50:23,834 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2023-11-19 07:50:23,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:50:23,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:50:23,839 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:50:23,839 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:50:23,839 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-19 07:50:23,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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-19 07:50:23,842 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2023-11-19 07:50:23,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:50:23,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:50:23,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:50:23,842 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:50:23,849 INFO L748 eck$LassoCheckResult]: Stem: 18#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem9#1, main_#t~post8#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 6#L44-3true [2023-11-19 07:50:23,849 INFO L750 eck$LassoCheckResult]: Loop: 6#L44-3true assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 19#L44-2true main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 6#L44-3true [2023-11-19 07:50:23,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:23,855 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-19 07:50:23,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:23,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008807351] [2023-11-19 07:50:23,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:23,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:23,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:23,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:23,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:23,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-19 07:50:23,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:23,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663374653] [2023-11-19 07:50:23,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:23,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:24,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:24,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:24,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:24,018 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-19 07:50:24,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:24,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050832004] [2023-11-19 07:50:24,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:24,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:24,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:24,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:24,648 INFO L210 LassoAnalysis]: Preferences: [2023-11-19 07:50:24,649 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-19 07:50:24,649 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-19 07:50:24,649 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-19 07:50:24,650 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-19 07:50:24,650 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:24,650 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-19 07:50:24,651 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-19 07:50:24,651 INFO L133 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration1_Lasso [2023-11-19 07:50:24,651 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-19 07:50:24,651 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-19 07:50:24,675 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-19 07:50:24,687 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-19 07:50:24,691 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-19 07:50:24,694 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-19 07:50:25,209 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-19 07:50:25,213 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-19 07:50:25,215 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-19 07:50:25,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-19 07:50:25,594 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-19 07:50:25,598 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-19 07:50:25,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:25,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:25,603 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:25,609 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-19 07:50:25,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-19 07:50:25,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:25,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:25,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:25,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:25,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:25,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:25,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:25,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:25,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:25,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:25,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:25,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-19 07:50:25,735 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-19 07:50:25,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:25,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:50:25,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:25,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:25,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:25,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:50:25,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:50:25,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:25,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:25,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:25,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:25,782 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:25,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-19 07:50:25,791 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-19 07:50:25,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:25,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:50:25,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:25,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:25,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:25,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:50:25,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:50:25,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:25,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:25,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:25,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:25,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:25,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-19 07:50:25,842 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-19 07:50:25,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:25,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:25,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:25,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:25,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:25,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:25,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:25,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:25,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:25,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:25,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:25,920 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-19 07:50:25,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:25,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:25,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:25,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:25,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-19 07:50:25,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:25,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:25,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:25,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:25,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:25,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:25,980 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:25,992 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-19 07:50:26,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:26,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:26,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:26,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:26,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:26,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:26,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-19 07:50:26,026 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:26,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:26,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:26,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:26,049 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:26,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-19 07:50:26,059 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-19 07:50:26,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:26,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:26,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:26,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:26,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:26,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:26,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:26,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:26,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:26,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:26,120 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:26,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-19 07:50:26,123 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-19 07:50:26,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:26,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:26,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:26,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:26,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:26,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:26,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:26,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:26,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:26,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:26,178 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:26,211 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-19 07:50:26,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:26,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:26,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:26,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:26,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-19 07:50:26,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:26,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:26,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:26,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:26,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:26,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:26,265 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:26,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-19 07:50:26,275 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-19 07:50:26,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:26,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:26,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:26,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:26,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:26,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:26,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:26,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:26,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:26,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:26,326 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:26,336 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-19 07:50:26,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:26,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:26,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:26,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:26,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:26,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:26,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-19 07:50:26,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:26,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:26,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:26,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:26,396 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:26,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-19 07:50:26,399 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-19 07:50:26,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:26,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:26,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:26,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:26,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:26,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:26,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:26,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:26,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:26,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:26,447 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:26,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-19 07:50:26,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-19 07:50:26,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:26,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:26,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:26,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:26,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:26,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:26,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:26,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:26,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:26,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:26,506 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:26,516 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-19 07:50:26,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:26,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:26,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:26,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:26,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:26,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:26,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-19 07:50:26,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:26,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:26,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:26,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:26,573 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:26,584 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-19 07:50:26,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:26,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:26,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:26,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:26,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:26,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:26,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-19 07:50:26,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:26,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:26,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:26,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:26,642 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:26,656 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-19 07:50:26,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-19 07:50:26,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:26,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:26,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:26,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:26,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:26,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:26,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:26,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:26,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:26,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:26,710 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:26,717 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-19 07:50:26,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:26,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:50:26,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:26,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:26,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:26,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:50:26,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:50:26,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-19 07:50:26,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:50:26,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:26,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:26,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:26,772 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:26,776 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-19 07:50:26,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-19 07:50:26,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:50:26,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:50:26,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:50:26,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:50:26,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:50:26,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:50:26,815 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-19 07:50:26,852 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-11-19 07:50:26,852 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-11-19 07:50:26,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:50:26,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:26,894 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:26,905 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-19 07:50:26,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-19 07:50:26,924 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-19 07:50:26,924 INFO L513 LassoAnalysis]: Proved termination. [2023-11-19 07:50:26,925 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~#array~1#1.base)_1) = 2*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~#array~1#1.base)_1 Supporting invariants [] [2023-11-19 07:50:26,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:26,960 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2023-11-19 07:50:26,968 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#array~1!base] could not be translated [2023-11-19 07:50:26,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:27,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 07:50:27,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:50:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:27,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 07:50:27,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:50:27,078 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-19 07:50:27,115 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-19 07:50:27,118 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:27,183 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 52 states and 77 transitions. Complement of second has 8 states. [2023-11-19 07:50:27,185 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-19 07:50:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2023-11-19 07:50:27,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-19 07:50:27,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 07:50:27,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-19 07:50:27,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 07:50:27,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-19 07:50:27,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 07:50:27,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 77 transitions. [2023-11-19 07:50:27,200 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-11-19 07:50:27,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 20 states and 27 transitions. [2023-11-19 07:50:27,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-11-19 07:50:27,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-11-19 07:50:27,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2023-11-19 07:50:27,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:50:27,207 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2023-11-19 07:50:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2023-11-19 07:50:27,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-19 07:50:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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-19 07:50:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2023-11-19 07:50:27,239 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2023-11-19 07:50:27,239 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2023-11-19 07:50:27,239 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-19 07:50:27,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2023-11-19 07:50:27,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-11-19 07:50:27,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:50:27,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:50:27,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-19 07:50:27,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-19 07:50:27,242 INFO L748 eck$LassoCheckResult]: Stem: 153#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem9#1, main_#t~post8#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 140#L44-3 assume !(main_~i~1#1 >= 0); 141#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~post2#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_#t~post1#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 139#L30-3 [2023-11-19 07:50:27,242 INFO L750 eck$LassoCheckResult]: Loop: 139#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 151#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 152#L32-4 call SelectionSort_#t~mem5#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int(SelectionSort_#t~mem6#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 138#L30-2 SelectionSort_#t~post1#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post1#1;havoc SelectionSort_#t~post1#1; 139#L30-3 [2023-11-19 07:50:27,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:27,243 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2023-11-19 07:50:27,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:27,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742199450] [2023-11-19 07:50:27,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:27,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:27,314 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-19 07:50:27,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:27,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742199450] [2023-11-19 07:50:27,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742199450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:50:27,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:50:27,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:50:27,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603682254] [2023-11-19 07:50:27,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:50:27,320 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:50:27,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 1 times [2023-11-19 07:50:27,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:27,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564128217] [2023-11-19 07:50:27,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:27,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:27,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:27,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:27,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:50:27,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:50:27,481 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:27,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:27,498 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2023-11-19 07:50:27,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2023-11-19 07:50:27,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-19 07:50:27,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2023-11-19 07:50:27,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2023-11-19 07:50:27,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2023-11-19 07:50:27,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2023-11-19 07:50:27,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:50:27,501 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-19 07:50:27,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2023-11-19 07:50:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2023-11-19 07:50:27,503 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-19 07:50:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-19 07:50:27,503 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-19 07:50:27,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:50:27,505 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-19 07:50:27,505 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-19 07:50:27,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2023-11-19 07:50:27,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-19 07:50:27,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:50:27,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:50:27,507 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-19 07:50:27,507 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-19 07:50:27,507 INFO L748 eck$LassoCheckResult]: Stem: 196#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem9#1, main_#t~post8#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 182#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 183#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 184#L44-3 assume !(main_~i~1#1 >= 0); 185#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~post2#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_#t~post1#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 181#L30-3 [2023-11-19 07:50:27,507 INFO L750 eck$LassoCheckResult]: Loop: 181#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 194#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 195#L32-4 call SelectionSort_#t~mem5#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int(SelectionSort_#t~mem6#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 180#L30-2 SelectionSort_#t~post1#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post1#1;havoc SelectionSort_#t~post1#1; 181#L30-3 [2023-11-19 07:50:27,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:27,508 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2023-11-19 07:50:27,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:27,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714930934] [2023-11-19 07:50:27,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:27,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:27,564 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-19 07:50:27,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:27,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714930934] [2023-11-19 07:50:27,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714930934] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:50:27,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003755875] [2023-11-19 07:50:27,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:27,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:50:27,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:27,567 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:50:27,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-19 07:50:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:27,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 07:50:27,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:50:27,647 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-19 07:50:27,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:50:27,665 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-19 07:50:27,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003755875] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:50:27,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:50:27,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-11-19 07:50:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673381836] [2023-11-19 07:50:27,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:50:27,667 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:50:27,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:27,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 2 times [2023-11-19 07:50:27,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:27,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599299984] [2023-11-19 07:50:27,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:27,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:27,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:27,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:27,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:27,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:50:27,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:50:27,815 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:27,859 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-11-19 07:50:27,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2023-11-19 07:50:27,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-19 07:50:27,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2023-11-19 07:50:27,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-11-19 07:50:27,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-11-19 07:50:27,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2023-11-19 07:50:27,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:50:27,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-19 07:50:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2023-11-19 07:50:27,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-11-19 07:50:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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-19 07:50:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-11-19 07:50:27,869 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-11-19 07:50:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:50:27,872 INFO L428 stractBuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-11-19 07:50:27,872 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-19 07:50:27,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2023-11-19 07:50:27,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-19 07:50:27,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:50:27,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:50:27,875 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2023-11-19 07:50:27,875 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-19 07:50:27,876 INFO L748 eck$LassoCheckResult]: Stem: 280#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 277#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem9#1, main_#t~post8#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 265#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 266#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 267#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 268#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 285#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 284#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 283#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 282#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 281#L44-3 assume !(main_~i~1#1 >= 0); 269#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~post2#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_#t~post1#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 264#L30-3 [2023-11-19 07:50:27,876 INFO L750 eck$LassoCheckResult]: Loop: 264#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 278#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 279#L32-4 call SelectionSort_#t~mem5#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int(SelectionSort_#t~mem6#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 263#L30-2 SelectionSort_#t~post1#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post1#1;havoc SelectionSort_#t~post1#1; 264#L30-3 [2023-11-19 07:50:27,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2023-11-19 07:50:27,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:27,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561968478] [2023-11-19 07:50:27,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:27,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:28,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-11-19 07:50:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:28,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:28,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561968478] [2023-11-19 07:50:28,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561968478] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:50:28,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600903450] [2023-11-19 07:50:28,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:50:28,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:50:28,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:28,113 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:50:28,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-19 07:50:28,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:50:28,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:50:28,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 07:50:28,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:50:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:28,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:50:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:28,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600903450] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:50:28,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:50:28,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2023-11-19 07:50:28,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54983073] [2023-11-19 07:50:28,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:50:28,251 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:50:28,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 3 times [2023-11-19 07:50:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:28,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445342264] [2023-11-19 07:50:28,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:28,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:28,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:28,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:28,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:28,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:50:28,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:50:28,406 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-19 07:50:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:28,468 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-11-19 07:50:28,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2023-11-19 07:50:28,470 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-19 07:50:28,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 45 transitions. [2023-11-19 07:50:28,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-11-19 07:50:28,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-11-19 07:50:28,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 45 transitions. [2023-11-19 07:50:28,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:50:28,472 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-11-19 07:50:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 45 transitions. [2023-11-19 07:50:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2023-11-19 07:50:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-11-19 07:50:28,475 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-19 07:50:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:50:28,476 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-19 07:50:28,476 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-19 07:50:28,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2023-11-19 07:50:28,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-19 07:50:28,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:50:28,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:50:28,478 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2023-11-19 07:50:28,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-19 07:50:28,478 INFO L748 eck$LassoCheckResult]: Stem: 420#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 417#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem9#1, main_#t~post8#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 405#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 406#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 407#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 408#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 427#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 426#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 425#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 424#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 423#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 422#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 421#L44-3 assume !(main_~i~1#1 >= 0); 409#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~post2#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_#t~post1#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 404#L30-3 [2023-11-19 07:50:28,478 INFO L750 eck$LassoCheckResult]: Loop: 404#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 418#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 419#L32-4 call SelectionSort_#t~mem5#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int(SelectionSort_#t~mem6#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 403#L30-2 SelectionSort_#t~post1#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post1#1;havoc SelectionSort_#t~post1#1; 404#L30-3 [2023-11-19 07:50:28,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:28,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2023-11-19 07:50:28,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:28,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567899510] [2023-11-19 07:50:28,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:28,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:28,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:28,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:28,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:28,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 4 times [2023-11-19 07:50:28,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:28,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993305790] [2023-11-19 07:50:28,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:28,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:28,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:28,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:28,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:28,568 INFO L85 PathProgramCache]: Analyzing trace with hash -743535747, now seen corresponding path program 1 times [2023-11-19 07:50:28,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:28,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467154523] [2023-11-19 07:50:28,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:28,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-19 07:50:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:28,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467154523] [2023-11-19 07:50:28,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467154523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:50:28,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:50:28,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:50:28,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699747723] [2023-11-19 07:50:28,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:50:28,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:28,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:50:28,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:50:28,815 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:28,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:28,862 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-11-19 07:50:28,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2023-11-19 07:50:28,863 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:50:28,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2023-11-19 07:50:28,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-11-19 07:50:28,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-11-19 07:50:28,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2023-11-19 07:50:28,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:50:28,865 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-11-19 07:50:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2023-11-19 07:50:28,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2023-11-19 07:50:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 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-19 07:50:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-19 07:50:28,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-19 07:50:28,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:50:28,869 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-19 07:50:28,869 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-19 07:50:28,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2023-11-19 07:50:28,870 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-19 07:50:28,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:50:28,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:50:28,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2023-11-19 07:50:28,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 07:50:28,871 INFO L748 eck$LassoCheckResult]: Stem: 492#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 489#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem9#1, main_#t~post8#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 476#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 477#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 478#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 479#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 500#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 499#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 498#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 497#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 496#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 495#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 494#L44-3 assume !(main_~i~1#1 >= 0); 480#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~post2#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_#t~post1#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 481#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 491#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 486#L33 [2023-11-19 07:50:28,872 INFO L750 eck$LassoCheckResult]: Loop: 486#L33 assume SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1; 487#L32-2 SelectionSort_#t~post2#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post2#1;havoc SelectionSort_#t~post2#1; 490#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 486#L33 [2023-11-19 07:50:28,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:28,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425501, now seen corresponding path program 1 times [2023-11-19 07:50:28,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:28,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833125355] [2023-11-19 07:50:28,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:28,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:28,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:28,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:28,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:28,918 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 1 times [2023-11-19 07:50:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:28,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013316988] [2023-11-19 07:50:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:28,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:28,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:28,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:28,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:28,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1574719937, now seen corresponding path program 1 times [2023-11-19 07:50:28,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:28,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237894238] [2023-11-19 07:50:28,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:28,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:29,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:29,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237894238] [2023-11-19 07:50:29,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237894238] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:50:29,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058018425] [2023-11-19 07:50:29,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:29,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:50:29,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:29,871 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:50:29,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-19 07:50:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:29,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-19 07:50:29,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:50:30,034 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:50:30,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-11-19 07:50:30,091 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 16 [2023-11-19 07:50:30,142 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 16 [2023-11-19 07:50:30,204 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 16 [2023-11-19 07:50:30,238 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 16 [2023-11-19 07:50:30,278 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 16 [2023-11-19 07:50:30,426 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 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-19 07:50:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:50:30,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:50:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:50:30,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058018425] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:50:30,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:50:30,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 23 [2023-11-19 07:50:30,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909516178] [2023-11-19 07:50:30,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:50:30,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:30,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-19 07:50:30,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=454, Unknown=6, NotChecked=0, Total=552 [2023-11-19 07:50:30,863 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 23 states have internal predecessors, (41), 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-19 07:50:31,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:31,379 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2023-11-19 07:50:31,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2023-11-19 07:50:31,380 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2023-11-19 07:50:31,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 41 transitions. [2023-11-19 07:50:31,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-11-19 07:50:31,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-19 07:50:31,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2023-11-19 07:50:31,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:50:31,381 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-11-19 07:50:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2023-11-19 07:50:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2023-11-19 07:50:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 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-19 07:50:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-11-19 07:50:31,383 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-19 07:50:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:50:31,387 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-19 07:50:31,387 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-19 07:50:31,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2023-11-19 07:50:31,389 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-19 07:50:31,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:50:31,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:50:31,389 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:50:31,389 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 07:50:31,390 INFO L748 eck$LassoCheckResult]: Stem: 709#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 706#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem9#1, main_#t~post8#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 693#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 694#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 695#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 696#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 710#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 717#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 716#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 715#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 714#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 713#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 712#L44-3 assume !(main_~i~1#1 >= 0); 697#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~post2#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_#t~post1#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 698#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 708#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 703#L33 assume !(SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1);havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1; 704#L32-2 [2023-11-19 07:50:31,390 INFO L750 eck$LassoCheckResult]: Loop: 704#L32-2 SelectionSort_#t~post2#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post2#1;havoc SelectionSort_#t~post2#1; 707#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 718#L33 assume SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1; 704#L32-2 [2023-11-19 07:50:31,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1638583016, now seen corresponding path program 1 times [2023-11-19 07:50:31,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:31,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61800707] [2023-11-19 07:50:31,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:31,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:31,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:31,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:31,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:31,464 INFO L85 PathProgramCache]: Analyzing trace with hash 68297, now seen corresponding path program 2 times [2023-11-19 07:50:31,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:31,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628545114] [2023-11-19 07:50:31,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:31,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:31,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:31,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:31,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:31,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1571618174, now seen corresponding path program 1 times [2023-11-19 07:50:31,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:31,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017798756] [2023-11-19 07:50:31,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:31,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:50:32,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:32,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017798756] [2023-11-19 07:50:32,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017798756] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:50:32,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529575496] [2023-11-19 07:50:32,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:32,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:50:32,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:32,018 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:50:32,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-19 07:50:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:32,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-19 07:50:32,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:50:32,149 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:50:32,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-11-19 07:50:32,195 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 16 [2023-11-19 07:50:32,225 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 16 [2023-11-19 07:50:32,255 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 16 [2023-11-19 07:50:32,284 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 16 [2023-11-19 07:50:32,315 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 16 [2023-11-19 07:50:32,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:50:32,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 32 [2023-11-19 07:50:32,674 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:50:32,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:50:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:50:33,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529575496] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:50:33,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:50:33,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-11-19 07:50:33,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510183230] [2023-11-19 07:50:33,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:50:33,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:33,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-19 07:50:33,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=704, Unknown=4, NotChecked=0, Total=812 [2023-11-19 07:50:33,292 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:33,908 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2023-11-19 07:50:33,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2023-11-19 07:50:33,909 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2023-11-19 07:50:33,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2023-11-19 07:50:33,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-11-19 07:50:33,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-11-19 07:50:33,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2023-11-19 07:50:33,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:50:33,911 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2023-11-19 07:50:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2023-11-19 07:50:33,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2023-11-19 07:50:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 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-19 07:50:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-11-19 07:50:33,914 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-19 07:50:33,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:50:33,915 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-19 07:50:33,915 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-19 07:50:33,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2023-11-19 07:50:33,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-19 07:50:33,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:50:33,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:50:33,917 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:50:33,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-19 07:50:33,917 INFO L748 eck$LassoCheckResult]: Stem: 943#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 939#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem9#1, main_#t~post8#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 926#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 927#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 928#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 929#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 944#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 951#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 950#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 949#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 948#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 947#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 946#L44-3 assume !(main_~i~1#1 >= 0); 930#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~post2#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_#t~post1#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 931#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 941#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 942#L33 assume !(SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1);havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1; 954#L32-2 SelectionSort_#t~post2#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post2#1;havoc SelectionSort_#t~post2#1; 953#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 945#L32-4 [2023-11-19 07:50:33,918 INFO L750 eck$LassoCheckResult]: Loop: 945#L32-4 call SelectionSort_#t~mem5#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int(SelectionSort_#t~mem6#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 924#L30-2 SelectionSort_#t~post1#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post1#1;havoc SelectionSort_#t~post1#1; 925#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 940#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 945#L32-4 [2023-11-19 07:50:33,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1574718017, now seen corresponding path program 1 times [2023-11-19 07:50:33,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:33,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608990785] [2023-11-19 07:50:33,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:33,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-19 07:50:33,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:33,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608990785] [2023-11-19 07:50:33,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608990785] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:50:33,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541959183] [2023-11-19 07:50:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:33,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:50:33,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:33,993 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:50:34,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-19 07:50:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:34,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:50:34,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:50:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-19 07:50:34,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:50:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-19 07:50:34,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541959183] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:50:34,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:50:34,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-11-19 07:50:34,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262603621] [2023-11-19 07:50:34,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:50:34,206 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:50:34,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2248553, now seen corresponding path program 5 times [2023-11-19 07:50:34,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:34,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227791928] [2023-11-19 07:50:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:34,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:34,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:34,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:34,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:34,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 07:50:34,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:50:34,347 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:34,514 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2023-11-19 07:50:34,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 61 transitions. [2023-11-19 07:50:34,515 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2023-11-19 07:50:34,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 61 transitions. [2023-11-19 07:50:34,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2023-11-19 07:50:34,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-11-19 07:50:34,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 61 transitions. [2023-11-19 07:50:34,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:50:34,516 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 61 transitions. [2023-11-19 07:50:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 61 transitions. [2023-11-19 07:50:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2023-11-19 07:50:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 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-19 07:50:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-11-19 07:50:34,520 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-11-19 07:50:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:50:34,523 INFO L428 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-11-19 07:50:34,523 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-19 07:50:34,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2023-11-19 07:50:34,524 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:50:34,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:50:34,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:50:34,525 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2023-11-19 07:50:34,525 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 07:50:34,526 INFO L748 eck$LassoCheckResult]: Stem: 1164#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 1161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem9#1, main_#t~post8#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 1148#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1149#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1150#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1151#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1176#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1175#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1174#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1173#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1172#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1169#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1168#L44-3 assume !(main_~i~1#1 >= 0); 1152#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~post2#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_#t~post1#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 1153#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 1190#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1189#L33 assume !(SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1);havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1; 1188#L32-2 SelectionSort_#t~post2#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post2#1;havoc SelectionSort_#t~post2#1; 1187#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1186#L33 assume !(SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1);havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1; 1185#L32-2 SelectionSort_#t~post2#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post2#1;havoc SelectionSort_#t~post2#1; 1184#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1183#L33 assume !(SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1);havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1; 1182#L32-2 SelectionSort_#t~post2#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post2#1;havoc SelectionSort_#t~post2#1; 1181#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1179#L33 [2023-11-19 07:50:34,526 INFO L750 eck$LassoCheckResult]: Loop: 1179#L33 assume SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1; 1180#L32-2 SelectionSort_#t~post2#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post2#1;havoc SelectionSort_#t~post2#1; 1178#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1179#L33 [2023-11-19 07:50:34,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:34,526 INFO L85 PathProgramCache]: Analyzing trace with hash 649240641, now seen corresponding path program 1 times [2023-11-19 07:50:34,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:34,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904728375] [2023-11-19 07:50:34,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:34,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:34,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:34,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:34,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:34,576 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 3 times [2023-11-19 07:50:34,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:34,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587455991] [2023-11-19 07:50:34,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:34,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:34,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:34,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:34,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:34,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1290237019, now seen corresponding path program 2 times [2023-11-19 07:50:34,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:34,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938761577] [2023-11-19 07:50:34,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:34,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-19 07:50:34,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:34,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938761577] [2023-11-19 07:50:34,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938761577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:50:34,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:50:34,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:50:34,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256220449] [2023-11-19 07:50:34,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:50:34,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:34,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:50:34,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:50:34,884 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 12 Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:34,987 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2023-11-19 07:50:34,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 53 transitions. [2023-11-19 07:50:34,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-19 07:50:34,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 53 transitions. [2023-11-19 07:50:34,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2023-11-19 07:50:34,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2023-11-19 07:50:34,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 53 transitions. [2023-11-19 07:50:34,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:50:34,989 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-11-19 07:50:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 53 transitions. [2023-11-19 07:50:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-19 07:50:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 45 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-19 07:50:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-11-19 07:50:34,993 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-11-19 07:50:34,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:50:34,994 INFO L428 stractBuchiCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-11-19 07:50:34,994 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-19 07:50:34,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 53 transitions. [2023-11-19 07:50:34,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-19 07:50:34,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:50:34,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:50:34,996 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:50:34,996 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 07:50:34,996 INFO L748 eck$LassoCheckResult]: Stem: 1282#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 1279#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem9#1, main_#t~post8#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 1266#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1267#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1268#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1269#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1296#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1295#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1293#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1291#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1289#L44-3 assume !!(main_~i~1#1 >= 0);call write~int(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1285#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1284#L44-3 assume !(main_~i~1#1 >= 0); 1270#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~post2#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_#t~post1#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 1271#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 1281#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1276#L33 assume !(SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1);havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1; 1277#L32-2 SelectionSort_#t~post2#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post2#1;havoc SelectionSort_#t~post2#1; 1280#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1309#L33 assume !(SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1);havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1; 1308#L32-2 SelectionSort_#t~post2#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post2#1;havoc SelectionSort_#t~post2#1; 1307#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1306#L33 assume !(SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1);havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1; 1305#L32-2 SelectionSort_#t~post2#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post2#1;havoc SelectionSort_#t~post2#1; 1304#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1303#L33 assume !(SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1);havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1; 1302#L32-2 SelectionSort_#t~post2#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post2#1;havoc SelectionSort_#t~post2#1; 1301#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 1283#L32-4 call SelectionSort_#t~mem5#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int(SelectionSort_#t~mem6#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1264#L30-2 SelectionSort_#t~post1#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post1#1;havoc SelectionSort_#t~post1#1; 1265#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 1300#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1299#L33 assume !(SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1);havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1; 1298#L32-2 SelectionSort_#t~post2#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post2#1;havoc SelectionSort_#t~post2#1; 1297#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1292#L33 [2023-11-19 07:50:34,996 INFO L750 eck$LassoCheckResult]: Loop: 1292#L33 assume SelectionSort_#t~mem3#1 < SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem4#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1; 1294#L32-2 SelectionSort_#t~post2#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post2#1;havoc SelectionSort_#t~post2#1; 1287#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem3#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem4#1 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1292#L33 [2023-11-19 07:50:34,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash -264183975, now seen corresponding path program 1 times [2023-11-19 07:50:34,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:34,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211842395] [2023-11-19 07:50:34,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:34,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:35,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:35,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:35,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:35,043 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 4 times [2023-11-19 07:50:35,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:35,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951067603] [2023-11-19 07:50:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:35,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:35,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:50:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:50:35,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:50:35,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:35,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1924678077, now seen corresponding path program 1 times [2023-11-19 07:50:35,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:35,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080708700] [2023-11-19 07:50:35,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:35,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-19 07:50:36,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:36,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080708700] [2023-11-19 07:50:36,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080708700] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:50:36,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404971992] [2023-11-19 07:50:36,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:36,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:50:36,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:36,015 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:50:36,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a9d0037-be1c-408e-9ffc-42b4b2dc65ac/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-19 07:50:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:36,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-19 07:50:36,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:50:36,179 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:50:36,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-11-19 07:50:36,227 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 16 [2023-11-19 07:50:36,265 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 16 [2023-11-19 07:50:36,291 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 16 [2023-11-19 07:50:36,328 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 16 [2023-11-19 07:50:36,361 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 16 [2023-11-19 07:50:36,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2023-11-19 07:50:37,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:50:37,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 32 [2023-11-19 07:50:37,365 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-19 07:50:37,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:51:04,214 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_SelectionSort_~rh~0#1_30| Int) (v_ArrVal_265 Int) (v_ArrVal_264 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| v_ArrVal_264) |c_~#array~0.base|))) (let ((.cse1 (select (store .cse0 |c_~#array~0.offset| v_ArrVal_265) (+ |c_~#array~0.offset| (* |v_ULTIMATE.start_SelectionSort_~rh~0#1_30| 4)))) (.cse2 (select .cse0 (+ |c_~#array~0.offset| 12)))) (or (< (select .cse0 (+ |c_~#array~0.offset| 8)) .cse1) (< .cse2 (select .cse0 |c_~#array~0.offset|)) (< .cse1 (+ .cse2 1)))))) is different from false [2023-11-19 07:51:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 18 trivial. 9 not checked. [2023-11-19 07:51:04,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404971992] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:51:04,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:51:04,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 44 [2023-11-19 07:51:04,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507616859] [2023-11-19 07:51:04,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:51:04,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:04,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-19 07:51:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1708, Unknown=4, NotChecked=84, Total=1980 [2023-11-19 07:51:04,645 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. cyclomatic complexity: 10 Second operand has 45 states, 45 states have (on average 1.8) internal successors, (81), 44 states have internal predecessors, (81), 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-19 07:51:19,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]