./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:07:50,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:07:50,165 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:07:50,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:07:50,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:07:50,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:07:50,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:07:50,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:07:50,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:07:50,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:07:50,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:07:50,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:07:50,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:07:50,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:07:50,201 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:07:50,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:07:50,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:07:50,202 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:07:50,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:07:50,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:07:50,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:07:50,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:07:50,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:07:50,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:07:50,205 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:07:50,205 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:07:50,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:07:50,206 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:07:50,206 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:07:50,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:07:50,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:07:50,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:07:50,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:07:50,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:07:50,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:07:50,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:07:50,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:07:50,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:07:50,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:07:50,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:07:50,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:07:50,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:07:50,216 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/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_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX 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(G ! call(reach_error())) ) 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2024-11-08 18:07:50,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:07:50,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:07:50,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:07:50,572 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:07:50,572 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:07:50,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c Unable to find full path for "g++" [2024-11-08 18:07:52,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:07:52,832 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:07:52,832 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2024-11-08 18:07:52,841 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/data/95668d4e7/4fc108fefd2d4dc18bef749e66367e83/FLAG9076b54ae [2024-11-08 18:07:52,856 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/data/95668d4e7/4fc108fefd2d4dc18bef749e66367e83 [2024-11-08 18:07:52,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:07:52,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:07:52,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:07:52,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:07:52,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:07:52,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:07:52" (1/1) ... [2024-11-08 18:07:52,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76bb816f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:52, skipping insertion in model container [2024-11-08 18:07:52,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:07:52" (1/1) ... [2024-11-08 18:07:52,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:07:53,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c[2637,2650] [2024-11-08 18:07:53,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:07:53,146 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:07:53,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c[2637,2650] [2024-11-08 18:07:53,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:07:53,197 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:07:53,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53 WrapperNode [2024-11-08 18:07:53,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:07:53,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:07:53,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:07:53,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:07:53,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53" (1/1) ... [2024-11-08 18:07:53,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53" (1/1) ... [2024-11-08 18:07:53,261 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 181 [2024-11-08 18:07:53,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:07:53,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:07:53,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:07:53,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:07:53,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53" (1/1) ... [2024-11-08 18:07:53,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53" (1/1) ... [2024-11-08 18:07:53,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53" (1/1) ... [2024-11-08 18:07:53,295 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-08 18:07:53,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53" (1/1) ... [2024-11-08 18:07:53,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53" (1/1) ... [2024-11-08 18:07:53,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53" (1/1) ... [2024-11-08 18:07:53,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53" (1/1) ... [2024-11-08 18:07:53,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53" (1/1) ... [2024-11-08 18:07:53,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53" (1/1) ... [2024-11-08 18:07:53,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:07:53,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:07:53,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:07:53,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:07:53,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53" (1/1) ... [2024-11-08 18:07:53,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:07:53,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:07:53,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:07:53,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:07:53,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:07:53,422 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 18:07:53,422 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 18:07:53,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 18:07:53,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 18:07:53,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 18:07:53,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 18:07:53,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:07:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 18:07:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 18:07:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 18:07:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 18:07:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:07:53,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:07:53,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 18:07:53,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 18:07:53,427 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 18:07:53,548 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:07:53,550 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:07:54,015 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 18:07:54,016 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:07:54,451 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:07:54,452 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:07:54,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:07:54 BoogieIcfgContainer [2024-11-08 18:07:54,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:07:54,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:07:54,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:07:54,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:07:54,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:07:52" (1/3) ... [2024-11-08 18:07:54,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151b71b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:07:54, skipping insertion in model container [2024-11-08 18:07:54,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:07:53" (2/3) ... [2024-11-08 18:07:54,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151b71b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:07:54, skipping insertion in model container [2024-11-08 18:07:54,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:07:54" (3/3) ... [2024-11-08 18:07:54,468 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2024-11-08 18:07:54,487 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:07:54,488 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:07:54,488 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 18:07:54,554 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 18:07:54,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 54 transitions, 129 flow [2024-11-08 18:07:54,648 INFO L124 PetriNetUnfolderBase]: 14/51 cut-off events. [2024-11-08 18:07:54,650 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 18:07:54,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 14/51 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-11-08 18:07:54,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 54 transitions, 129 flow [2024-11-08 18:07:54,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 50 transitions, 118 flow [2024-11-08 18:07:54,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:07:54,684 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@744dc0a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:07:54,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-08 18:07:54,703 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 18:07:54,704 INFO L124 PetriNetUnfolderBase]: 14/49 cut-off events. [2024-11-08 18:07:54,704 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 18:07:54,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:07:54,705 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:07:54,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:07:54,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:07:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash 935196514, now seen corresponding path program 1 times [2024-11-08 18:07:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:07:54,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376230036] [2024-11-08 18:07:54,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:07:54,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:07:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:07:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:07:55,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:07:55,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376230036] [2024-11-08 18:07:55,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376230036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:07:55,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:07:55,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:07:55,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340859624] [2024-11-08 18:07:55,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:07:55,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:07:55,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:07:55,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:07:55,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:07:55,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-11-08 18:07:55,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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) [2024-11-08 18:07:55,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:07:55,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-11-08 18:07:55,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:07:55,905 INFO L124 PetriNetUnfolderBase]: 447/719 cut-off events. [2024-11-08 18:07:55,905 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-08 18:07:55,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 719 events. 447/719 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2486 event pairs, 248 based on Foata normal form. 1/644 useless extension candidates. Maximal degree in co-relation 576. Up to 313 conditions per place. [2024-11-08 18:07:55,918 INFO L140 encePairwiseOnDemand]: 36/54 looper letters, 40 selfloop transitions, 8 changer transitions 42/100 dead transitions. [2024-11-08 18:07:55,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 100 transitions, 416 flow [2024-11-08 18:07:55,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:07:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 18:07:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-08 18:07:55,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-11-08 18:07:55,937 INFO L175 Difference]: Start difference. First operand has 46 places, 50 transitions, 118 flow. Second operand 5 states and 156 transitions. [2024-11-08 18:07:55,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 100 transitions, 416 flow [2024-11-08 18:07:55,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 100 transitions, 392 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-08 18:07:55,950 INFO L231 Difference]: Finished difference. Result has 47 places, 54 transitions, 166 flow [2024-11-08 18:07:55,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=47, PETRI_TRANSITIONS=54} [2024-11-08 18:07:55,957 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 1 predicate places. [2024-11-08 18:07:55,957 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 54 transitions, 166 flow [2024-11-08 18:07:55,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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) [2024-11-08 18:07:55,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:07:55,958 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:07:55,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:07:55,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:07:55,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:07:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1167120222, now seen corresponding path program 1 times [2024-11-08 18:07:55,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:07:55,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120340661] [2024-11-08 18:07:55,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:07:55,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:07:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:07:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:07:56,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:07:56,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120340661] [2024-11-08 18:07:56,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120340661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:07:56,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903359371] [2024-11-08 18:07:56,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:07:56,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:07:56,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:07:56,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:07:56,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:07:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:07:56,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:07:56,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:07:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:07:56,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:07:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:07:56,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903359371] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:07:56,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:07:56,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-11-08 18:07:56,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140401516] [2024-11-08 18:07:56,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:07:56,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:07:56,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:07:56,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:07:56,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:07:56,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2024-11-08 18:07:56,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 54 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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) [2024-11-08 18:07:56,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:07:56,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2024-11-08 18:07:56,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:07:56,872 INFO L124 PetriNetUnfolderBase]: 395/609 cut-off events. [2024-11-08 18:07:56,872 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:07:56,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 609 events. 395/609 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2166 event pairs, 169 based on Foata normal form. 0/540 useless extension candidates. Maximal degree in co-relation 1231. Up to 378 conditions per place. [2024-11-08 18:07:56,880 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 54 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2024-11-08 18:07:56,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 310 flow [2024-11-08 18:07:56,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:07:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 18:07:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-11-08 18:07:56,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3962962962962963 [2024-11-08 18:07:56,884 INFO L175 Difference]: Start difference. First operand has 47 places, 54 transitions, 166 flow. Second operand 5 states and 107 transitions. [2024-11-08 18:07:56,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 310 flow [2024-11-08 18:07:56,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 298 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-08 18:07:56,889 INFO L231 Difference]: Finished difference. Result has 49 places, 55 transitions, 181 flow [2024-11-08 18:07:56,889 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=49, PETRI_TRANSITIONS=55} [2024-11-08 18:07:56,890 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2024-11-08 18:07:56,890 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 55 transitions, 181 flow [2024-11-08 18:07:56,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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) [2024-11-08 18:07:56,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:07:56,891 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:07:56,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:07:57,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:07:57,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:07:57,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:07:57,092 INFO L85 PathProgramCache]: Analyzing trace with hash -331220743, now seen corresponding path program 1 times [2024-11-08 18:07:57,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:07:57,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567528288] [2024-11-08 18:07:57,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:07:57,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:07:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:07:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:07:57,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:07:57,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567528288] [2024-11-08 18:07:57,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567528288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:07:57,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36785064] [2024-11-08 18:07:57,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:07:57,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:07:57,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:07:57,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:07:57,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:07:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:07:57,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 18:07:57,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:07:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:07:57,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:07:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:07:57,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36785064] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:07:57,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:07:57,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-08 18:07:57,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389043842] [2024-11-08 18:07:57,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:07:57,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:07:57,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:07:57,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:07:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:07:57,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2024-11-08 18:07:57,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 55 transitions, 181 flow. Second operand has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 13 states have internal predecessors, (140), 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) [2024-11-08 18:07:57,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:07:57,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2024-11-08 18:07:57,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:07:58,682 INFO L124 PetriNetUnfolderBase]: 1223/1787 cut-off events. [2024-11-08 18:07:58,683 INFO L125 PetriNetUnfolderBase]: For 864/979 co-relation queries the response was YES. [2024-11-08 18:07:58,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4118 conditions, 1787 events. 1223/1787 cut-off events. For 864/979 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7869 event pairs, 391 based on Foata normal form. 0/1486 useless extension candidates. Maximal degree in co-relation 4094. Up to 760 conditions per place. [2024-11-08 18:07:58,695 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 117 selfloop transitions, 26 changer transitions 0/147 dead transitions. [2024-11-08 18:07:58,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 147 transitions, 740 flow [2024-11-08 18:07:58,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:07:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-08 18:07:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 245 transitions. [2024-11-08 18:07:58,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2024-11-08 18:07:58,699 INFO L175 Difference]: Start difference. First operand has 49 places, 55 transitions, 181 flow. Second operand 14 states and 245 transitions. [2024-11-08 18:07:58,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 147 transitions, 740 flow [2024-11-08 18:07:58,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 147 transitions, 718 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:07:58,703 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 331 flow [2024-11-08 18:07:58,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=331, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2024-11-08 18:07:58,704 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2024-11-08 18:07:58,705 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 331 flow [2024-11-08 18:07:58,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 13 states have internal predecessors, (140), 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) [2024-11-08 18:07:58,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:07:58,705 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:07:58,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:07:58,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:07:58,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:07:58,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:07:58,907 INFO L85 PathProgramCache]: Analyzing trace with hash -890565517, now seen corresponding path program 2 times [2024-11-08 18:07:58,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:07:58,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578036009] [2024-11-08 18:07:58,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:07:58,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:07:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:07:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:07:59,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:07:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578036009] [2024-11-08 18:07:59,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578036009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:07:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035272664] [2024-11-08 18:07:59,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:07:59,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:07:59,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:07:59,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:07:59,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:07:59,245 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 18:07:59,246 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:07:59,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:07:59,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:07:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:07:59,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:07:59,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035272664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:07:59,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:07:59,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-11-08 18:07:59,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502036957] [2024-11-08 18:07:59,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:07:59,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:07:59,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:07:59,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:07:59,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:07:59,386 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-11-08 18:07:59,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2024-11-08 18:07:59,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:07:59,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-11-08 18:07:59,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:08:00,013 INFO L124 PetriNetUnfolderBase]: 1747/2549 cut-off events. [2024-11-08 18:08:00,013 INFO L125 PetriNetUnfolderBase]: For 2751/2910 co-relation queries the response was YES. [2024-11-08 18:08:00,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7983 conditions, 2549 events. 1747/2549 cut-off events. For 2751/2910 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11878 event pairs, 624 based on Foata normal form. 1/2429 useless extension candidates. Maximal degree in co-relation 7954. Up to 1347 conditions per place. [2024-11-08 18:08:00,037 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 131 selfloop transitions, 24 changer transitions 11/184 dead transitions. [2024-11-08 18:08:00,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 184 transitions, 1117 flow [2024-11-08 18:08:00,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 18:08:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-08 18:08:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 336 transitions. [2024-11-08 18:08:00,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2024-11-08 18:08:00,040 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 331 flow. Second operand 11 states and 336 transitions. [2024-11-08 18:08:00,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 184 transitions, 1117 flow [2024-11-08 18:08:00,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 184 transitions, 1112 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-08 18:08:00,063 INFO L231 Difference]: Finished difference. Result has 81 places, 96 transitions, 535 flow [2024-11-08 18:08:00,063 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=535, PETRI_PLACES=81, PETRI_TRANSITIONS=96} [2024-11-08 18:08:00,064 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2024-11-08 18:08:00,065 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 96 transitions, 535 flow [2024-11-08 18:08:00,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2024-11-08 18:08:00,066 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:08:00,066 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:08:00,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 18:08:00,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:08:00,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:08:00,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:08:00,271 INFO L85 PathProgramCache]: Analyzing trace with hash 415364197, now seen corresponding path program 3 times [2024-11-08 18:08:00,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:08:00,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794677354] [2024-11-08 18:08:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:08:00,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:08:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:08:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:08:00,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:08:00,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794677354] [2024-11-08 18:08:00,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794677354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:08:00,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999991312] [2024-11-08 18:08:00,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:08:00,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:08:00,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:08:00,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:08:00,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:08:00,636 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-08 18:08:00,636 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:08:00,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:08:00,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:08:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:08:00,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:08:00,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999991312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:08:00,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:08:00,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-11-08 18:08:00,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455231158] [2024-11-08 18:08:00,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:08:00,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:08:00,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:08:00,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:08:00,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:08:00,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-11-08 18:08:00,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 96 transitions, 535 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2024-11-08 18:08:00,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:08:00,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-11-08 18:08:00,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:08:01,497 INFO L124 PetriNetUnfolderBase]: 2030/3013 cut-off events. [2024-11-08 18:08:01,498 INFO L125 PetriNetUnfolderBase]: For 6684/6869 co-relation queries the response was YES. [2024-11-08 18:08:01,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11307 conditions, 3013 events. 2030/3013 cut-off events. For 6684/6869 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 14956 event pairs, 814 based on Foata normal form. 1/2892 useless extension candidates. Maximal degree in co-relation 11272. Up to 1757 conditions per place. [2024-11-08 18:08:01,526 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 106 selfloop transitions, 36 changer transitions 11/171 dead transitions. [2024-11-08 18:08:01,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 171 transitions, 1210 flow [2024-11-08 18:08:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:08:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 18:08:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 309 transitions. [2024-11-08 18:08:01,528 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2024-11-08 18:08:01,528 INFO L175 Difference]: Start difference. First operand has 81 places, 96 transitions, 535 flow. Second operand 10 states and 309 transitions. [2024-11-08 18:08:01,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 171 transitions, 1210 flow [2024-11-08 18:08:01,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 171 transitions, 1202 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-11-08 18:08:01,562 INFO L231 Difference]: Finished difference. Result has 95 places, 118 transitions, 844 flow [2024-11-08 18:08:01,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=844, PETRI_PLACES=95, PETRI_TRANSITIONS=118} [2024-11-08 18:08:01,563 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 49 predicate places. [2024-11-08 18:08:01,563 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 118 transitions, 844 flow [2024-11-08 18:08:01,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2024-11-08 18:08:01,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:08:01,564 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:08:01,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 18:08:01,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:08:01,764 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:08:01,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:08:01,765 INFO L85 PathProgramCache]: Analyzing trace with hash -776399667, now seen corresponding path program 4 times [2024-11-08 18:08:01,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:08:01,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381247233] [2024-11-08 18:08:01,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:08:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:08:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:08:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:08:01,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:08:01,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381247233] [2024-11-08 18:08:01,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381247233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:08:01,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389468368] [2024-11-08 18:08:01,976 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 18:08:01,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:08:01,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:08:01,981 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:08:01,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:08:02,094 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 18:08:02,094 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:08:02,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:08:02,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:08:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:08:02,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:08:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:08:02,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389468368] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:08:02,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:08:02,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-08 18:08:02,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39233520] [2024-11-08 18:08:02,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:08:02,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:08:02,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:08:02,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:08:02,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:08:02,349 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2024-11-08 18:08:02,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 118 transitions, 844 flow. Second operand has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 13 states have internal predecessors, (119), 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) [2024-11-08 18:08:02,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:08:02,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2024-11-08 18:08:02,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:08:04,660 INFO L124 PetriNetUnfolderBase]: 5348/7608 cut-off events. [2024-11-08 18:08:04,661 INFO L125 PetriNetUnfolderBase]: For 23744/23744 co-relation queries the response was YES. [2024-11-08 18:08:04,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30308 conditions, 7608 events. 5348/7608 cut-off events. For 23744/23744 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 38094 event pairs, 391 based on Foata normal form. 135/7519 useless extension candidates. Maximal degree in co-relation 30264. Up to 2010 conditions per place. [2024-11-08 18:08:04,748 INFO L140 encePairwiseOnDemand]: 37/54 looper letters, 235 selfloop transitions, 177 changer transitions 32/445 dead transitions. [2024-11-08 18:08:04,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 445 transitions, 3889 flow [2024-11-08 18:08:04,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 18:08:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-08 18:08:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 368 transitions. [2024-11-08 18:08:04,751 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2839506172839506 [2024-11-08 18:08:04,751 INFO L175 Difference]: Start difference. First operand has 95 places, 118 transitions, 844 flow. Second operand 24 states and 368 transitions. [2024-11-08 18:08:04,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 445 transitions, 3889 flow [2024-11-08 18:08:04,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 445 transitions, 3793 flow, removed 48 selfloop flow, removed 0 redundant places. [2024-11-08 18:08:04,915 INFO L231 Difference]: Finished difference. Result has 138 places, 255 transitions, 2612 flow [2024-11-08 18:08:04,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2612, PETRI_PLACES=138, PETRI_TRANSITIONS=255} [2024-11-08 18:08:04,919 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 92 predicate places. [2024-11-08 18:08:04,920 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 255 transitions, 2612 flow [2024-11-08 18:08:04,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 13 states have internal predecessors, (119), 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) [2024-11-08 18:08:04,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:08:04,921 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:08:04,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 18:08:05,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:08:05,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:08:05,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:08:05,122 INFO L85 PathProgramCache]: Analyzing trace with hash -198964551, now seen corresponding path program 5 times [2024-11-08 18:08:05,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:08:05,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141229927] [2024-11-08 18:08:05,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:08:05,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:08:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:08:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:08:05,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:08:05,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141229927] [2024-11-08 18:08:05,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141229927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:08:05,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536895237] [2024-11-08 18:08:05,288 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 18:08:05,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:08:05,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:08:05,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:08:05,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 18:08:05,477 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:08:05,478 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:08:05,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:08:05,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:08:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:08:05,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:08:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:08:05,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536895237] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:08:05,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:08:05,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2024-11-08 18:08:05,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720226294] [2024-11-08 18:08:05,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:08:05,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:08:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:08:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:08:05,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:08:05,954 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2024-11-08 18:08:05,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 255 transitions, 2612 flow. Second operand has 14 states, 14 states have (on average 9.357142857142858) internal successors, (131), 14 states have internal predecessors, (131), 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) [2024-11-08 18:08:05,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:08:05,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2024-11-08 18:08:05,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:08:08,072 INFO L124 PetriNetUnfolderBase]: 4352/6236 cut-off events. [2024-11-08 18:08:08,073 INFO L125 PetriNetUnfolderBase]: For 41137/41137 co-relation queries the response was YES. [2024-11-08 18:08:08,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32073 conditions, 6236 events. 4352/6236 cut-off events. For 41137/41137 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 30803 event pairs, 441 based on Foata normal form. 414/6646 useless extension candidates. Maximal degree in co-relation 32006. Up to 1774 conditions per place. [2024-11-08 18:08:08,155 INFO L140 encePairwiseOnDemand]: 38/54 looper letters, 243 selfloop transitions, 229 changer transitions 0/473 dead transitions. [2024-11-08 18:08:08,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 473 transitions, 5304 flow [2024-11-08 18:08:08,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 18:08:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-08 18:08:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 331 transitions. [2024-11-08 18:08:08,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2786195286195286 [2024-11-08 18:08:08,158 INFO L175 Difference]: Start difference. First operand has 138 places, 255 transitions, 2612 flow. Second operand 22 states and 331 transitions. [2024-11-08 18:08:08,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 473 transitions, 5304 flow [2024-11-08 18:08:08,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 473 transitions, 4881 flow, removed 124 selfloop flow, removed 10 redundant places. [2024-11-08 18:08:08,597 INFO L231 Difference]: Finished difference. Result has 157 places, 347 transitions, 4080 flow [2024-11-08 18:08:08,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4080, PETRI_PLACES=157, PETRI_TRANSITIONS=347} [2024-11-08 18:08:08,600 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 111 predicate places. [2024-11-08 18:08:08,601 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 347 transitions, 4080 flow [2024-11-08 18:08:08,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.357142857142858) internal successors, (131), 14 states have internal predecessors, (131), 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) [2024-11-08 18:08:08,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:08:08,601 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:08:08,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 18:08:08,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:08:08,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:08:08,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:08:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1928873165, now seen corresponding path program 6 times [2024-11-08 18:08:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:08:08,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472250767] [2024-11-08 18:08:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:08:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:08:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:08:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:08:09,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:08:09,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472250767] [2024-11-08 18:08:09,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472250767] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:08:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542765324] [2024-11-08 18:08:09,009 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 18:08:09,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:08:09,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:08:09,011 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:08:09,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 18:08:09,185 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-08 18:08:09,185 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:08:09,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:08:09,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:08:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:08:09,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:08:09,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542765324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:08:09,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:08:09,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-11-08 18:08:09,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144890848] [2024-11-08 18:08:09,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:08:09,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:08:09,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:08:09,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:08:09,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:08:09,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-11-08 18:08:09,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 347 transitions, 4080 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2024-11-08 18:08:09,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:08:09,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-11-08 18:08:09,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:08:10,622 INFO L124 PetriNetUnfolderBase]: 2660/4046 cut-off events. [2024-11-08 18:08:10,622 INFO L125 PetriNetUnfolderBase]: For 37474/37807 co-relation queries the response was YES. [2024-11-08 18:08:10,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24302 conditions, 4046 events. 2660/4046 cut-off events. For 37474/37807 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 22317 event pairs, 650 based on Foata normal form. 79/4089 useless extension candidates. Maximal degree in co-relation 24228. Up to 2289 conditions per place. [2024-11-08 18:08:10,698 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 266 selfloop transitions, 98 changer transitions 11/414 dead transitions. [2024-11-08 18:08:10,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 414 transitions, 5443 flow [2024-11-08 18:08:10,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:08:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 18:08:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 300 transitions. [2024-11-08 18:08:10,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-08 18:08:10,701 INFO L175 Difference]: Start difference. First operand has 157 places, 347 transitions, 4080 flow. Second operand 10 states and 300 transitions. [2024-11-08 18:08:10,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 414 transitions, 5443 flow [2024-11-08 18:08:11,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 414 transitions, 5174 flow, removed 94 selfloop flow, removed 4 redundant places. [2024-11-08 18:08:11,060 INFO L231 Difference]: Finished difference. Result has 167 places, 361 transitions, 4347 flow [2024-11-08 18:08:11,061 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3837, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4347, PETRI_PLACES=167, PETRI_TRANSITIONS=361} [2024-11-08 18:08:11,062 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 121 predicate places. [2024-11-08 18:08:11,062 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 361 transitions, 4347 flow [2024-11-08 18:08:11,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2024-11-08 18:08:11,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:08:11,063 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:08:11,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 18:08:11,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:08:11,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:08:11,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:08:11,264 INFO L85 PathProgramCache]: Analyzing trace with hash 965810704, now seen corresponding path program 1 times [2024-11-08 18:08:11,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:08:11,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118631721] [2024-11-08 18:08:11,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:08:11,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:08:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:08:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:08:13,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:08:13,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118631721] [2024-11-08 18:08:13,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118631721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:08:13,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348606795] [2024-11-08 18:08:13,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:08:13,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:08:13,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:08:13,509 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:08:13,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 18:08:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:08:13,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-08 18:08:13,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:08:13,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 18:08:13,841 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 18:08:13,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-08 18:08:13,963 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-08 18:08:13,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 18:08:14,418 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 18:08:14,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-08 18:08:14,991 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:08:15,045 INFO L349 Elim1Store]: treesize reduction 50, result has 45.7 percent of original size [2024-11-08 18:08:15,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 58 [2024-11-08 18:08:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:08:16,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:08:24,523 INFO L349 Elim1Store]: treesize reduction 118, result has 70.9 percent of original size [2024-11-08 18:08:24,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 2796 treesize of output 1499 [2024-11-08 18:08:24,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:08:24,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1376 treesize of output 1306 [2024-11-08 18:08:24,896 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 18:08:24,896 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 29 treesize of output 17 [2024-11-08 18:08:25,222 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 18:08:25,223 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 21 treesize of output 9 [2024-11-08 18:08:25,454 INFO L349 Elim1Store]: treesize reduction 8, result has 87.7 percent of original size [2024-11-08 18:08:25,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 86 [2024-11-08 18:08:26,316 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 18:08:26,316 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 21 treesize of output 9 [2024-11-08 18:09:51,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2024-11-08 18:09:51,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2024-11-08 18:09:52,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2024-11-08 18:09:52,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2024-11-08 18:09:52,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2024-11-08 18:09:52,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2024-11-08 18:09:52,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2024-11-08 18:09:53,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2024-11-08 18:09:53,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:09:54,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 355 [2024-11-08 18:09:55,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2024-11-08 18:09:55,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:09:56,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2024-11-08 18:09:56,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:09:56,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2024-11-08 18:09:56,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2024-11-08 18:09:57,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2024-11-08 18:09:57,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 94 [2024-11-08 18:09:57,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 94 [2024-11-08 18:09:58,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:09:58,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:09:58,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2024-11-08 18:09:58,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2024-11-08 18:09:58,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:09:58,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 145 [2024-11-08 18:09:59,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 145 [2024-11-08 18:10:00,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:00,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:00,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 94 [2024-11-08 18:10:01,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:10:01,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-08 18:10:01,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:01,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:10:01,468 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-08 18:10:01,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 252 [2024-11-08 18:10:02,854 INFO L349 Elim1Store]: treesize reduction 16, result has 87.6 percent of original size [2024-11-08 18:10:02,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 186 treesize of output 256 [2024-11-08 18:10:08,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:08,212 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:10:08,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 49 treesize of output 37 [2024-11-08 18:10:08,916 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:10:08,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 9 [2024-11-08 18:10:09,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:10,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:25,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:25,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:26,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:27,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:29,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:29,055 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:10:29,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 64 treesize of output 52 [2024-11-08 18:10:34,047 INFO L349 Elim1Store]: treesize reduction 48, result has 62.8 percent of original size [2024-11-08 18:10:34,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 192 treesize of output 230 [2024-11-08 18:10:37,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:39,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:40,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:10:40,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 9 [2024-11-08 18:10:40,542 INFO L349 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2024-11-08 18:10:40,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 223 treesize of output 1 [2024-11-08 18:10:41,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:41,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:41,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:41,274 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-08 18:10:41,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 141 treesize of output 1 [2024-11-08 18:10:41,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:41,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:41,596 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2024-11-08 18:10:43,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:43,182 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2024-11-08 18:10:43,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 213 treesize of output 1 [2024-11-08 18:10:44,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:44,327 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 18:10:44,327 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 115 treesize of output 1 [2024-11-08 18:10:45,266 INFO L349 Elim1Store]: treesize reduction 16, result has 87.6 percent of original size [2024-11-08 18:10:45,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 266 [2024-11-08 18:10:50,891 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-08 18:10:51,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:51,546 INFO L349 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2024-11-08 18:10:51,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 166 treesize of output 1 [2024-11-08 18:10:52,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:10:58,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:11:09,317 WARN L286 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:11:27,260 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:11:46,342 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 23 DAG size of output: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:11:48,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:11:48,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 5557 treesize of output 3921 [2024-11-08 18:15:42,709 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-08 18:15:42,710 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-08 18:15:42,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-08 18:15:42,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 18:15:42,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:15:42,911 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 76 more [2024-11-08 18:15:42,916 INFO L158 Benchmark]: Toolchain (without parser) took 470056.09ms. Allocated memory was 130.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 88.0MB in the beginning and 1.1GB in the end (delta: -971.2MB). Peak memory consumption was 977.1MB. Max. memory is 16.1GB. [2024-11-08 18:15:42,916 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:15:42,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.51ms. Allocated memory is still 130.0MB. Free memory was 87.7MB in the beginning and 73.8MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 18:15:42,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.74ms. Allocated memory is still 130.0MB. Free memory was 73.8MB in the beginning and 71.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:15:42,917 INFO L158 Benchmark]: Boogie Preprocessor took 54.15ms. Allocated memory is still 130.0MB. Free memory was 71.8MB in the beginning and 68.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:15:42,918 INFO L158 Benchmark]: RCFGBuilder took 1136.82ms. Allocated memory was 130.0MB in the beginning and 182.5MB in the end (delta: 52.4MB). Free memory was 68.6MB in the beginning and 91.8MB in the end (delta: -23.2MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2024-11-08 18:15:42,918 INFO L158 Benchmark]: TraceAbstraction took 468458.30ms. Allocated memory was 182.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 91.6MB in the beginning and 1.1GB in the end (delta: -967.5MB). Peak memory consumption was 926.2MB. Max. memory is 16.1GB. [2024-11-08 18:15:42,920 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.51ms. Allocated memory is still 130.0MB. Free memory was 87.7MB in the beginning and 73.8MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.74ms. Allocated memory is still 130.0MB. Free memory was 73.8MB in the beginning and 71.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.15ms. Allocated memory is still 130.0MB. Free memory was 71.8MB in the beginning and 68.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1136.82ms. Allocated memory was 130.0MB in the beginning and 182.5MB in the end (delta: 52.4MB). Free memory was 68.6MB in the beginning and 91.8MB in the end (delta: -23.2MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * TraceAbstraction took 468458.30ms. Allocated memory was 182.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 91.6MB in the beginning and 1.1GB in the end (delta: -967.5MB). Peak memory consumption was 926.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:15:45,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:15:45,485 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:15:45,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:15:45,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:15:45,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:15:45,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:15:45,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:15:45,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:15:45,538 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:15:45,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:15:45,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:15:45,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:15:45,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:15:45,540 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:15:45,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:15:45,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:15:45,546 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:15:45,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:15:45,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:15:45,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:15:45,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:15:45,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:15:45,548 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:15:45,549 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:15:45,549 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:15:45,549 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:15:45,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:15:45,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:15:45,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:15:45,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:15:45,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:15:45,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:15:45,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:15:45,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:15:45,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:15:45,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:15:45,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:15:45,553 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:15:45,554 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:15:45,554 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:15:45,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:15:45,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:15:45,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:15:45,555 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/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_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX 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(G ! call(reach_error())) ) 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2024-11-08 18:15:45,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:15:45,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:15:46,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:15:46,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:15:46,005 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:15:46,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c Unable to find full path for "g++" [2024-11-08 18:15:48,007 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:15:48,302 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:15:48,303 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2024-11-08 18:15:48,311 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/data/19cec6cf4/51617b87b9314aedb180040ef104c14f/FLAG35d17ff7a [2024-11-08 18:15:48,329 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/data/19cec6cf4/51617b87b9314aedb180040ef104c14f [2024-11-08 18:15:48,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:15:48,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:15:48,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:15:48,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:15:48,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:15:48,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337370af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48, skipping insertion in model container [2024-11-08 18:15:48,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:15:48,663 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c[2637,2650] [2024-11-08 18:15:48,676 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 18:15:48,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:15:48,702 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:15:48,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c[2637,2650] [2024-11-08 18:15:48,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:15:48,768 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:15:48,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48 WrapperNode [2024-11-08 18:15:48,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:15:48,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:15:48,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:15:48,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:15:48,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,834 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 178 [2024-11-08 18:15:48,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:15:48,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:15:48,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:15:48,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:15:48,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,879 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-08 18:15:48,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:15:48,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:15:48,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:15:48,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:15:48,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48" (1/1) ... [2024-11-08 18:15:48,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:15:48,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:15:48,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:15:49,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:15:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:15:49,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:15:49,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 18:15:49,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 18:15:49,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 18:15:49,058 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 18:15:49,058 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 18:15:49,058 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 18:15:49,058 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 18:15:49,059 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 18:15:49,059 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 18:15:49,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 18:15:49,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:15:49,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:15:49,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 18:15:49,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 18:15:49,061 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 18:15:49,211 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:15:49,214 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:15:49,806 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 18:15:49,807 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:15:50,297 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:15:50,298 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:15:50,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:15:50 BoogieIcfgContainer [2024-11-08 18:15:50,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:15:50,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:15:50,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:15:50,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:15:50,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:15:48" (1/3) ... [2024-11-08 18:15:50,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5338d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:15:50, skipping insertion in model container [2024-11-08 18:15:50,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:15:48" (2/3) ... [2024-11-08 18:15:50,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5338d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:15:50, skipping insertion in model container [2024-11-08 18:15:50,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:15:50" (3/3) ... [2024-11-08 18:15:50,312 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2024-11-08 18:15:50,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:15:50,332 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:15:50,332 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 18:15:50,395 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 18:15:50,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 54 transitions, 129 flow [2024-11-08 18:15:50,490 INFO L124 PetriNetUnfolderBase]: 14/51 cut-off events. [2024-11-08 18:15:50,491 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 18:15:50,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 14/51 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-11-08 18:15:50,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 54 transitions, 129 flow [2024-11-08 18:15:50,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 50 transitions, 118 flow [2024-11-08 18:15:50,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:15:50,521 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e737c30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:15:50,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-08 18:15:50,549 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 18:15:50,550 INFO L124 PetriNetUnfolderBase]: 14/49 cut-off events. [2024-11-08 18:15:50,568 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 18:15:50,568 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:15:50,569 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:15:50,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:15:50,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:15:50,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1791926748, now seen corresponding path program 1 times [2024-11-08 18:15:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:15:50,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927811358] [2024-11-08 18:15:50,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:15:50,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:15:50,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:15:50,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:15:50,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:15:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:15:50,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:15:50,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:15:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:15:50,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:15:50,996 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:15:50,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927811358] [2024-11-08 18:15:50,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927811358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:15:50,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:15:50,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:15:51,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190783787] [2024-11-08 18:15:51,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:15:51,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:15:51,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:15:51,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:15:51,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:15:51,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2024-11-08 18:15:51,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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) [2024-11-08 18:15:51,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:15:51,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2024-11-08 18:15:51,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:15:51,642 INFO L124 PetriNetUnfolderBase]: 527/792 cut-off events. [2024-11-08 18:15:51,643 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-11-08 18:15:51,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 792 events. 527/792 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2947 event pairs, 122 based on Foata normal form. 1/697 useless extension candidates. Maximal degree in co-relation 1403. Up to 411 conditions per place. [2024-11-08 18:15:51,654 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 63 selfloop transitions, 6 changer transitions 1/90 dead transitions. [2024-11-08 18:15:51,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 90 transitions, 365 flow [2024-11-08 18:15:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:15:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:15:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2024-11-08 18:15:51,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6450617283950617 [2024-11-08 18:15:51,673 INFO L175 Difference]: Start difference. First operand has 46 places, 50 transitions, 118 flow. Second operand 6 states and 209 transitions. [2024-11-08 18:15:51,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 90 transitions, 365 flow [2024-11-08 18:15:51,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 90 transitions, 335 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-08 18:15:51,683 INFO L231 Difference]: Finished difference. Result has 48 places, 54 transitions, 144 flow [2024-11-08 18:15:51,685 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=48, PETRI_TRANSITIONS=54} [2024-11-08 18:15:51,689 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2024-11-08 18:15:51,689 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 54 transitions, 144 flow [2024-11-08 18:15:51,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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) [2024-11-08 18:15:51,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:15:51,690 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:15:51,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 18:15:51,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:15:51,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:15:51,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:15:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash 550644989, now seen corresponding path program 1 times [2024-11-08 18:15:51,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:15:51,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081923494] [2024-11-08 18:15:51,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:15:51,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:15:51,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:15:51,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:15:51,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:15:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:15:52,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 18:15:52,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:15:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:15:52,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:15:52,246 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:15:52,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081923494] [2024-11-08 18:15:52,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081923494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:15:52,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:15:52,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:15:52,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541869617] [2024-11-08 18:15:52,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:15:52,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:15:52,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:15:52,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:15:52,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:15:52,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2024-11-08 18:15:52,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 54 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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) [2024-11-08 18:15:52,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:15:52,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2024-11-08 18:15:52,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:15:52,962 INFO L124 PetriNetUnfolderBase]: 714/1150 cut-off events. [2024-11-08 18:15:52,963 INFO L125 PetriNetUnfolderBase]: For 388/454 co-relation queries the response was YES. [2024-11-08 18:15:52,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2578 conditions, 1150 events. 714/1150 cut-off events. For 388/454 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4593 event pairs, 397 based on Foata normal form. 92/1180 useless extension candidates. Maximal degree in co-relation 1860. Up to 707 conditions per place. [2024-11-08 18:15:52,972 INFO L140 encePairwiseOnDemand]: 34/54 looper letters, 35 selfloop transitions, 8 changer transitions 46/104 dead transitions. [2024-11-08 18:15:52,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 104 transitions, 437 flow [2024-11-08 18:15:52,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:15:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:15:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-11-08 18:15:52,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5771604938271605 [2024-11-08 18:15:52,979 INFO L175 Difference]: Start difference. First operand has 48 places, 54 transitions, 144 flow. Second operand 6 states and 187 transitions. [2024-11-08 18:15:52,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 104 transitions, 437 flow [2024-11-08 18:15:52,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 104 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:15:52,990 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 210 flow [2024-11-08 18:15:52,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2024-11-08 18:15:52,992 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2024-11-08 18:15:52,993 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 58 transitions, 210 flow [2024-11-08 18:15:52,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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) [2024-11-08 18:15:52,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:15:52,996 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:15:53,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 18:15:53,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:15:53,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:15:53,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:15:53,198 INFO L85 PathProgramCache]: Analyzing trace with hash 636158139, now seen corresponding path program 1 times [2024-11-08 18:15:53,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:15:53,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [152731007] [2024-11-08 18:15:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:15:53,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:15:53,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:15:53,201 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:15:53,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:15:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:15:53,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 18:15:53,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:15:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:15:53,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:15:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:15:54,161 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:15:54,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152731007] [2024-11-08 18:15:54,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152731007] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:15:54,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:15:54,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2024-11-08 18:15:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112236962] [2024-11-08 18:15:54,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:15:54,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:15:54,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:15:54,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:15:54,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:15:54,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2024-11-08 18:15:54,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 58 transitions, 210 flow. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 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) [2024-11-08 18:15:54,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:15:54,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2024-11-08 18:15:54,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:15:56,743 INFO L124 PetriNetUnfolderBase]: 3946/5380 cut-off events. [2024-11-08 18:15:56,743 INFO L125 PetriNetUnfolderBase]: For 2217/2217 co-relation queries the response was YES. [2024-11-08 18:15:56,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12940 conditions, 5380 events. 3946/5380 cut-off events. For 2217/2217 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 23427 event pairs, 339 based on Foata normal form. 1/4257 useless extension candidates. Maximal degree in co-relation 12872. Up to 1023 conditions per place. [2024-11-08 18:15:56,780 INFO L140 encePairwiseOnDemand]: 37/54 looper letters, 141 selfloop transitions, 71 changer transitions 43/268 dead transitions. [2024-11-08 18:15:56,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 268 transitions, 1345 flow [2024-11-08 18:15:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:15:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-08 18:15:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 488 transitions. [2024-11-08 18:15:56,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2024-11-08 18:15:56,785 INFO L175 Difference]: Start difference. First operand has 55 places, 58 transitions, 210 flow. Second operand 16 states and 488 transitions. [2024-11-08 18:15:56,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 268 transitions, 1345 flow [2024-11-08 18:15:56,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 268 transitions, 1283 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-11-08 18:15:56,815 INFO L231 Difference]: Finished difference. Result has 76 places, 121 transitions, 690 flow [2024-11-08 18:15:56,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=690, PETRI_PLACES=76, PETRI_TRANSITIONS=121} [2024-11-08 18:15:56,816 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 30 predicate places. [2024-11-08 18:15:56,817 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 121 transitions, 690 flow [2024-11-08 18:15:56,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 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) [2024-11-08 18:15:56,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:15:56,817 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:15:56,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 18:15:57,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:15:57,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:15:57,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:15:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash 642012957, now seen corresponding path program 2 times [2024-11-08 18:15:57,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:15:57,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [959597876] [2024-11-08 18:15:57,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:15:57,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:15:57,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:15:57,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:15:57,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:15:57,147 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 18:15:57,147 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:15:57,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 18:15:57,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:15:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:15:57,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:15:57,552 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:15:57,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959597876] [2024-11-08 18:15:57,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959597876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:15:57,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:15:57,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:15:57,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236178725] [2024-11-08 18:15:57,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:15:57,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:15:57,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:15:57,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:15:57,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:15:57,674 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2024-11-08 18:15:57,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 121 transitions, 690 flow. Second operand has 8 states, 8 states have (on average 24.5) internal successors, (196), 8 states have internal predecessors, (196), 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) [2024-11-08 18:15:57,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:15:57,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2024-11-08 18:15:57,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:15:59,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([709] L58-2-->L58-7: Formula: (and (bvslt v_thread2Thread1of1ForFork0_~i~1_11 v_~M~0_23) (= |v_#memory_int#1_75| (store |v_#memory_int#1_76| v_~C2~0.base_16 (let ((.cse0 (bvmul v_thread2Thread1of1ForFork0_~i~1_11 (_ bv4 32)))) (store (select |v_#memory_int#1_76| v_~C2~0.base_16) (bvadd .cse0 v_~C2~0.offset_16) (bvadd (select (select |v_#memory_int#1_76| v_~B~0.base_32) (bvadd v_~B~0.offset_32 .cse0)) (select (select |v_#memory_int#1_76| v_~A~0.base_36) (bvadd v_~A~0.offset_36 .cse0))))))) (= v_thread2Thread1of1ForFork0_~i~1_12 (bvadd v_thread2Thread1of1ForFork0_~i~1_11 (_ bv1 32)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_36, ~C2~0.offset=v_~C2~0.offset_16, ~B~0.base=v_~B~0.base_32, ~A~0.offset=v_~A~0.offset_36, ~M~0=v_~M~0_23, ~C2~0.base=v_~C2~0.base_16, #memory_int#1=|v_#memory_int#1_76|, ~B~0.offset=v_~B~0.offset_32} OutVars{~A~0.base=v_~A~0.base_36, ~B~0.base=v_~B~0.base_32, #memory_int#1=|v_#memory_int#1_75|, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_1|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_12, ~C2~0.offset=v_~C2~0.offset_16, ~A~0.offset=v_~A~0.offset_36, ~M~0=v_~M~0_23, ~C2~0.base=v_~C2~0.base_16, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|, ~B~0.offset=v_~B~0.offset_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~mem4, #memory_int#1, thread2Thread1of1ForFork0_#t~mem5][53], [Black: 248#true, 8#L50-2true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 379#(bvsle ~N~0 (_ bv0 32)), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 143#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 117#(and (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt (_ bv0 32) ~N~0))), 27#L90true, 15#L66-7true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 23#L58-7true]) [2024-11-08 18:15:59,237 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-08 18:15:59,237 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-08 18:15:59,238 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-08 18:15:59,239 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-08 18:15:59,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L50-2-->L50-7: Formula: (and (= |v_#memory_int#1_47| (store |v_#memory_int#1_48| v_~C1~0.base_15 (let ((.cse0 (bvmul v_thread1Thread1of1ForFork2_~i~0_11 (_ bv4 32)))) (store (select |v_#memory_int#1_48| v_~C1~0.base_15) (bvadd .cse0 v_~C1~0.offset_15) (bvadd (select (select |v_#memory_int#1_48| v_~A~0.base_20) (bvadd v_~A~0.offset_20 .cse0)) (select (select |v_#memory_int#1_48| v_~B~0.base_18) (bvadd v_~B~0.offset_18 .cse0))))))) (= v_thread1Thread1of1ForFork2_~i~0_12 (bvadd v_thread1Thread1of1ForFork2_~i~0_11 (_ bv1 32))) (bvslt v_thread1Thread1of1ForFork2_~i~0_11 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_20, ~C1~0.base=v_~C1~0.base_15, ~B~0.base=v_~B~0.base_18, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11, ~C1~0.offset=v_~C1~0.offset_15, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_48|, ~B~0.offset=v_~B~0.offset_18} OutVars{~A~0.base=v_~A~0.base_20, ~B~0.base=v_~B~0.base_18, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_12, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_47|, ~C1~0.base=v_~C1~0.base_15, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, ~C1~0.offset=v_~C1~0.offset_15, ~B~0.offset=v_~B~0.offset_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, #memory_int#1][86], [248#true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 379#(bvsle ~N~0 (_ bv0 32)), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 143#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 117#(and (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt (_ bv0 32) ~N~0))), 27#L90true, 15#L66-7true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 22#L50-7true, 11#L58-2true]) [2024-11-08 18:15:59,240 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-08 18:15:59,240 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-08 18:15:59,240 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-08 18:15:59,240 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-08 18:15:59,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([708] L58-2-->L58-8: Formula: (not (bvslt v_thread2Thread1of1ForFork0_~i~1_9 v_~M~0_1)) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~M~0=v_~M~0_1} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~M~0=v_~M~0_1} AuxVars[] AssignedVars[][54], [Black: 248#true, 8#L50-2true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 379#(bvsle ~N~0 (_ bv0 32)), 497#(and (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 143#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), 17#L58-8true, Black: 117#(and (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt (_ bv0 32) ~N~0))), 27#L90true, 15#L66-7true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)))]) [2024-11-08 18:15:59,243 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-08 18:15:59,243 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-08 18:15:59,243 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-08 18:15:59,243 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-08 18:15:59,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([709] L58-2-->L58-7: Formula: (and (bvslt v_thread2Thread1of1ForFork0_~i~1_11 v_~M~0_23) (= |v_#memory_int#1_75| (store |v_#memory_int#1_76| v_~C2~0.base_16 (let ((.cse0 (bvmul v_thread2Thread1of1ForFork0_~i~1_11 (_ bv4 32)))) (store (select |v_#memory_int#1_76| v_~C2~0.base_16) (bvadd .cse0 v_~C2~0.offset_16) (bvadd (select (select |v_#memory_int#1_76| v_~B~0.base_32) (bvadd v_~B~0.offset_32 .cse0)) (select (select |v_#memory_int#1_76| v_~A~0.base_36) (bvadd v_~A~0.offset_36 .cse0))))))) (= v_thread2Thread1of1ForFork0_~i~1_12 (bvadd v_thread2Thread1of1ForFork0_~i~1_11 (_ bv1 32)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_36, ~C2~0.offset=v_~C2~0.offset_16, ~B~0.base=v_~B~0.base_32, ~A~0.offset=v_~A~0.offset_36, ~M~0=v_~M~0_23, ~C2~0.base=v_~C2~0.base_16, #memory_int#1=|v_#memory_int#1_76|, ~B~0.offset=v_~B~0.offset_32} OutVars{~A~0.base=v_~A~0.base_36, ~B~0.base=v_~B~0.base_32, #memory_int#1=|v_#memory_int#1_75|, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_1|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_12, ~C2~0.offset=v_~C2~0.offset_16, ~A~0.offset=v_~A~0.offset_36, ~M~0=v_~M~0_23, ~C2~0.base=v_~C2~0.base_16, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|, ~B~0.offset=v_~B~0.offset_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~mem4, #memory_int#1, thread2Thread1of1ForFork0_#t~mem5][53], [Black: 248#true, 8#L50-2true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), 36#L66-8true, Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 379#(bvsle ~N~0 (_ bv0 32)), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 143#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 117#(and (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt (_ bv0 32) ~N~0))), 27#L90true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 23#L58-7true]) [2024-11-08 18:15:59,245 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,245 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,246 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,246 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L50-2-->L50-7: Formula: (and (= |v_#memory_int#1_47| (store |v_#memory_int#1_48| v_~C1~0.base_15 (let ((.cse0 (bvmul v_thread1Thread1of1ForFork2_~i~0_11 (_ bv4 32)))) (store (select |v_#memory_int#1_48| v_~C1~0.base_15) (bvadd .cse0 v_~C1~0.offset_15) (bvadd (select (select |v_#memory_int#1_48| v_~A~0.base_20) (bvadd v_~A~0.offset_20 .cse0)) (select (select |v_#memory_int#1_48| v_~B~0.base_18) (bvadd v_~B~0.offset_18 .cse0))))))) (= v_thread1Thread1of1ForFork2_~i~0_12 (bvadd v_thread1Thread1of1ForFork2_~i~0_11 (_ bv1 32))) (bvslt v_thread1Thread1of1ForFork2_~i~0_11 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_20, ~C1~0.base=v_~C1~0.base_15, ~B~0.base=v_~B~0.base_18, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11, ~C1~0.offset=v_~C1~0.offset_15, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_48|, ~B~0.offset=v_~B~0.offset_18} OutVars{~A~0.base=v_~A~0.base_20, ~B~0.base=v_~B~0.base_18, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_12, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_47|, ~C1~0.base=v_~C1~0.base_15, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, ~C1~0.offset=v_~C1~0.offset_15, ~B~0.offset=v_~B~0.offset_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, #memory_int#1][86], [248#true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), 36#L66-8true, Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 379#(bvsle ~N~0 (_ bv0 32)), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 143#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 117#(and (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt (_ bv0 32) ~N~0))), 27#L90true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 11#L58-2true, 22#L50-7true]) [2024-11-08 18:15:59,246 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,247 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,247 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,247 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([708] L58-2-->L58-8: Formula: (not (bvslt v_thread2Thread1of1ForFork0_~i~1_9 v_~M~0_1)) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~M~0=v_~M~0_1} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~M~0=v_~M~0_1} AuxVars[] AssignedVars[][54], [Black: 248#true, 8#L50-2true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), 36#L66-8true, Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 379#(bvsle ~N~0 (_ bv0 32)), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), 497#(and (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 143#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), 17#L58-8true, Black: 117#(and (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt (_ bv0 32) ~N~0))), 27#L90true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)))]) [2024-11-08 18:15:59,247 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,247 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,247 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,247 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([709] L58-2-->L58-7: Formula: (and (bvslt v_thread2Thread1of1ForFork0_~i~1_11 v_~M~0_23) (= |v_#memory_int#1_75| (store |v_#memory_int#1_76| v_~C2~0.base_16 (let ((.cse0 (bvmul v_thread2Thread1of1ForFork0_~i~1_11 (_ bv4 32)))) (store (select |v_#memory_int#1_76| v_~C2~0.base_16) (bvadd .cse0 v_~C2~0.offset_16) (bvadd (select (select |v_#memory_int#1_76| v_~B~0.base_32) (bvadd v_~B~0.offset_32 .cse0)) (select (select |v_#memory_int#1_76| v_~A~0.base_36) (bvadd v_~A~0.offset_36 .cse0))))))) (= v_thread2Thread1of1ForFork0_~i~1_12 (bvadd v_thread2Thread1of1ForFork0_~i~1_11 (_ bv1 32)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_36, ~C2~0.offset=v_~C2~0.offset_16, ~B~0.base=v_~B~0.base_32, ~A~0.offset=v_~A~0.offset_36, ~M~0=v_~M~0_23, ~C2~0.base=v_~C2~0.base_16, #memory_int#1=|v_#memory_int#1_76|, ~B~0.offset=v_~B~0.offset_32} OutVars{~A~0.base=v_~A~0.base_36, ~B~0.base=v_~B~0.base_32, #memory_int#1=|v_#memory_int#1_75|, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_1|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_12, ~C2~0.offset=v_~C2~0.offset_16, ~A~0.offset=v_~A~0.offset_36, ~M~0=v_~M~0_23, ~C2~0.base=v_~C2~0.base_16, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|, ~B~0.offset=v_~B~0.offset_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~mem4, #memory_int#1, thread2Thread1of1ForFork0_#t~mem5][226], [Black: 248#true, 8#L50-2true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), 3#L66-2true, Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 379#(bvsle ~N~0 (_ bv0 32)), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 143#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 117#(and (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt (_ bv0 32) ~N~0))), 27#L90true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), 23#L58-7true]) [2024-11-08 18:15:59,406 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,410 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,410 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,410 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([708] L58-2-->L58-8: Formula: (not (bvslt v_thread2Thread1of1ForFork0_~i~1_9 v_~M~0_1)) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~M~0=v_~M~0_1} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~M~0=v_~M~0_1} AuxVars[] AssignedVars[][228], [Black: 248#true, 8#L50-2true, 511#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), 3#L66-2true, Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 379#(bvsle ~N~0 (_ bv0 32)), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 143#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), 17#L58-8true, Black: 117#(and (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt (_ bv0 32) ~N~0))), 27#L90true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)))]) [2024-11-08 18:15:59,411 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,411 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,411 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,411 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L50-2-->L50-7: Formula: (and (= |v_#memory_int#1_47| (store |v_#memory_int#1_48| v_~C1~0.base_15 (let ((.cse0 (bvmul v_thread1Thread1of1ForFork2_~i~0_11 (_ bv4 32)))) (store (select |v_#memory_int#1_48| v_~C1~0.base_15) (bvadd .cse0 v_~C1~0.offset_15) (bvadd (select (select |v_#memory_int#1_48| v_~A~0.base_20) (bvadd v_~A~0.offset_20 .cse0)) (select (select |v_#memory_int#1_48| v_~B~0.base_18) (bvadd v_~B~0.offset_18 .cse0))))))) (= v_thread1Thread1of1ForFork2_~i~0_12 (bvadd v_thread1Thread1of1ForFork2_~i~0_11 (_ bv1 32))) (bvslt v_thread1Thread1of1ForFork2_~i~0_11 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_20, ~C1~0.base=v_~C1~0.base_15, ~B~0.base=v_~B~0.base_18, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11, ~C1~0.offset=v_~C1~0.offset_15, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_48|, ~B~0.offset=v_~B~0.offset_18} OutVars{~A~0.base=v_~A~0.base_20, ~B~0.base=v_~B~0.base_18, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_12, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_47|, ~C1~0.base=v_~C1~0.base_15, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, ~C1~0.offset=v_~C1~0.offset_15, ~B~0.offset=v_~B~0.offset_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, #memory_int#1][287], [Black: 248#true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), 3#L66-2true, Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 379#(bvsle ~N~0 (_ bv0 32)), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 143#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 117#(and (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt (_ bv0 32) ~N~0))), 27#L90true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 22#L50-7true, 11#L58-2true]) [2024-11-08 18:15:59,413 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,413 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,413 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,413 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:15:59,415 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([709] L58-2-->L58-7: Formula: (and (bvslt v_thread2Thread1of1ForFork0_~i~1_11 v_~M~0_23) (= |v_#memory_int#1_75| (store |v_#memory_int#1_76| v_~C2~0.base_16 (let ((.cse0 (bvmul v_thread2Thread1of1ForFork0_~i~1_11 (_ bv4 32)))) (store (select |v_#memory_int#1_76| v_~C2~0.base_16) (bvadd .cse0 v_~C2~0.offset_16) (bvadd (select (select |v_#memory_int#1_76| v_~B~0.base_32) (bvadd v_~B~0.offset_32 .cse0)) (select (select |v_#memory_int#1_76| v_~A~0.base_36) (bvadd v_~A~0.offset_36 .cse0))))))) (= v_thread2Thread1of1ForFork0_~i~1_12 (bvadd v_thread2Thread1of1ForFork0_~i~1_11 (_ bv1 32)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_36, ~C2~0.offset=v_~C2~0.offset_16, ~B~0.base=v_~B~0.base_32, ~A~0.offset=v_~A~0.offset_36, ~M~0=v_~M~0_23, ~C2~0.base=v_~C2~0.base_16, #memory_int#1=|v_#memory_int#1_76|, ~B~0.offset=v_~B~0.offset_32} OutVars{~A~0.base=v_~A~0.base_36, ~B~0.base=v_~B~0.base_32, #memory_int#1=|v_#memory_int#1_75|, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_1|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_12, ~C2~0.offset=v_~C2~0.offset_16, ~A~0.offset=v_~A~0.offset_36, ~M~0=v_~M~0_23, ~C2~0.base=v_~C2~0.base_16, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|, ~B~0.offset=v_~B~0.offset_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~mem4, #memory_int#1, thread2Thread1of1ForFork0_#t~mem5][53], [Black: 248#true, 8#L50-2true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), 29#thread3EXITtrue, Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 379#(bvsle ~N~0 (_ bv0 32)), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 143#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 117#(and (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt (_ bv0 32) ~N~0))), 27#L90true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 23#L58-7true]) [2024-11-08 18:15:59,417 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-08 18:15:59,417 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-08 18:15:59,418 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-08 18:15:59,418 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-08 18:15:59,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L50-2-->L50-7: Formula: (and (= |v_#memory_int#1_47| (store |v_#memory_int#1_48| v_~C1~0.base_15 (let ((.cse0 (bvmul v_thread1Thread1of1ForFork2_~i~0_11 (_ bv4 32)))) (store (select |v_#memory_int#1_48| v_~C1~0.base_15) (bvadd .cse0 v_~C1~0.offset_15) (bvadd (select (select |v_#memory_int#1_48| v_~A~0.base_20) (bvadd v_~A~0.offset_20 .cse0)) (select (select |v_#memory_int#1_48| v_~B~0.base_18) (bvadd v_~B~0.offset_18 .cse0))))))) (= v_thread1Thread1of1ForFork2_~i~0_12 (bvadd v_thread1Thread1of1ForFork2_~i~0_11 (_ bv1 32))) (bvslt v_thread1Thread1of1ForFork2_~i~0_11 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_20, ~C1~0.base=v_~C1~0.base_15, ~B~0.base=v_~B~0.base_18, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11, ~C1~0.offset=v_~C1~0.offset_15, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_48|, ~B~0.offset=v_~B~0.offset_18} OutVars{~A~0.base=v_~A~0.base_20, ~B~0.base=v_~B~0.base_18, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_12, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_47|, ~C1~0.base=v_~C1~0.base_15, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, ~C1~0.offset=v_~C1~0.offset_15, ~B~0.offset=v_~B~0.offset_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, #memory_int#1][86], [248#true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), 29#thread3EXITtrue, Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 379#(bvsle ~N~0 (_ bv0 32)), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 143#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 117#(and (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt (_ bv0 32) ~N~0))), 27#L90true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 11#L58-2true, 22#L50-7true]) [2024-11-08 18:15:59,419 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-08 18:15:59,419 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-08 18:15:59,419 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-08 18:15:59,420 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-08 18:15:59,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([708] L58-2-->L58-8: Formula: (not (bvslt v_thread2Thread1of1ForFork0_~i~1_9 v_~M~0_1)) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~M~0=v_~M~0_1} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~M~0=v_~M~0_1} AuxVars[] AssignedVars[][54], [Black: 248#true, 8#L50-2true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), 29#thread3EXITtrue, Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 379#(bvsle ~N~0 (_ bv0 32)), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), 497#(and (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 143#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), 17#L58-8true, Black: 117#(and (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt (_ bv0 32) ~N~0))), 27#L90true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)))]) [2024-11-08 18:15:59,421 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-08 18:15:59,421 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-08 18:15:59,421 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-08 18:15:59,421 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-08 18:15:59,604 INFO L124 PetriNetUnfolderBase]: 3801/5412 cut-off events. [2024-11-08 18:15:59,605 INFO L125 PetriNetUnfolderBase]: For 17353/18383 co-relation queries the response was YES. [2024-11-08 18:15:59,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21204 conditions, 5412 events. 3801/5412 cut-off events. For 17353/18383 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 27103 event pairs, 592 based on Foata normal form. 155/5047 useless extension candidates. Maximal degree in co-relation 21155. Up to 2547 conditions per place. [2024-11-08 18:15:59,686 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 217 selfloop transitions, 42 changer transitions 15/316 dead transitions. [2024-11-08 18:15:59,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 316 transitions, 2522 flow [2024-11-08 18:15:59,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:15:59,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-08 18:15:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 387 transitions. [2024-11-08 18:15:59,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2024-11-08 18:15:59,690 INFO L175 Difference]: Start difference. First operand has 76 places, 121 transitions, 690 flow. Second operand 13 states and 387 transitions. [2024-11-08 18:15:59,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 316 transitions, 2522 flow [2024-11-08 18:15:59,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 316 transitions, 2458 flow, removed 32 selfloop flow, removed 3 redundant places. [2024-11-08 18:15:59,752 INFO L231 Difference]: Finished difference. Result has 90 places, 159 transitions, 1117 flow [2024-11-08 18:15:59,753 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1117, PETRI_PLACES=90, PETRI_TRANSITIONS=159} [2024-11-08 18:15:59,755 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 44 predicate places. [2024-11-08 18:15:59,755 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 159 transitions, 1117 flow [2024-11-08 18:15:59,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.5) internal successors, (196), 8 states have internal predecessors, (196), 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) [2024-11-08 18:15:59,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:15:59,756 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:15:59,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 18:15:59,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:15:59,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:15:59,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:15:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1163810683, now seen corresponding path program 3 times [2024-11-08 18:15:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:15:59,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418325568] [2024-11-08 18:15:59,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:15:59,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:15:59,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:15:59,960 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:15:59,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:16:00,071 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-08 18:16:00,071 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:16:00,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 18:16:00,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:16:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:16:00,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:16:00,390 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:16:00,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418325568] [2024-11-08 18:16:00,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418325568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:16:00,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:16:00,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:16:00,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511765117] [2024-11-08 18:16:00,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:16:00,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:16:00,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:16:00,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:16:00,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:16:00,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2024-11-08 18:16:00,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 159 transitions, 1117 flow. Second operand has 8 states, 8 states have (on average 24.5) internal successors, (196), 8 states have internal predecessors, (196), 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) [2024-11-08 18:16:00,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:16:00,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2024-11-08 18:16:00,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:16:01,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L50-2-->L50-7: Formula: (and (= |v_#memory_int#1_47| (store |v_#memory_int#1_48| v_~C1~0.base_15 (let ((.cse0 (bvmul v_thread1Thread1of1ForFork2_~i~0_11 (_ bv4 32)))) (store (select |v_#memory_int#1_48| v_~C1~0.base_15) (bvadd .cse0 v_~C1~0.offset_15) (bvadd (select (select |v_#memory_int#1_48| v_~A~0.base_20) (bvadd v_~A~0.offset_20 .cse0)) (select (select |v_#memory_int#1_48| v_~B~0.base_18) (bvadd v_~B~0.offset_18 .cse0))))))) (= v_thread1Thread1of1ForFork2_~i~0_12 (bvadd v_thread1Thread1of1ForFork2_~i~0_11 (_ bv1 32))) (bvslt v_thread1Thread1of1ForFork2_~i~0_11 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_20, ~C1~0.base=v_~C1~0.base_15, ~B~0.base=v_~B~0.base_18, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11, ~C1~0.offset=v_~C1~0.offset_15, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_48|, ~B~0.offset=v_~B~0.offset_18} OutVars{~A~0.base=v_~A~0.base_20, ~B~0.base=v_~B~0.base_18, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_12, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_47|, ~C1~0.base=v_~C1~0.base_15, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, ~C1~0.offset=v_~C1~0.offset_15, ~B~0.offset=v_~B~0.offset_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, #memory_int#1][276], [Black: 248#true, 24#thread2EXITtrue, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 632#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 654#(and (bvsle ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), 615#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), Black: 652#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 650#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), 22#L50-7true, Black: 656#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), Black: 622#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt ~M~0 ~N~0))), Black: 660#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), 3#L66-2true, 761#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~M~0))), Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 13#L89-4true]) [2024-11-08 18:16:01,894 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-08 18:16:01,894 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-08 18:16:01,894 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-08 18:16:01,894 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-08 18:16:02,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L50-2-->L50-7: Formula: (and (= |v_#memory_int#1_47| (store |v_#memory_int#1_48| v_~C1~0.base_15 (let ((.cse0 (bvmul v_thread1Thread1of1ForFork2_~i~0_11 (_ bv4 32)))) (store (select |v_#memory_int#1_48| v_~C1~0.base_15) (bvadd .cse0 v_~C1~0.offset_15) (bvadd (select (select |v_#memory_int#1_48| v_~A~0.base_20) (bvadd v_~A~0.offset_20 .cse0)) (select (select |v_#memory_int#1_48| v_~B~0.base_18) (bvadd v_~B~0.offset_18 .cse0))))))) (= v_thread1Thread1of1ForFork2_~i~0_12 (bvadd v_thread1Thread1of1ForFork2_~i~0_11 (_ bv1 32))) (bvslt v_thread1Thread1of1ForFork2_~i~0_11 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_20, ~C1~0.base=v_~C1~0.base_15, ~B~0.base=v_~B~0.base_18, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11, ~C1~0.offset=v_~C1~0.offset_15, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_48|, ~B~0.offset=v_~B~0.offset_18} OutVars{~A~0.base=v_~A~0.base_20, ~B~0.base=v_~B~0.base_18, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_12, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_47|, ~C1~0.base=v_~C1~0.base_15, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, ~C1~0.offset=v_~C1~0.offset_15, ~B~0.offset=v_~B~0.offset_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, #memory_int#1][276], [24#thread2EXITtrue, Black: 248#true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 632#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), Black: 654#(and (bvsle ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 652#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), 615#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), Black: 650#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 656#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), 22#L50-7true, Black: 622#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt ~M~0 ~N~0))), Black: 660#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), 3#L66-2true, 761#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~M~0))), 27#L90true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)))]) [2024-11-08 18:16:02,133 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-08 18:16:02,133 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-08 18:16:02,133 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-08 18:16:02,133 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-08 18:16:02,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L50-2-->L50-7: Formula: (and (= |v_#memory_int#1_47| (store |v_#memory_int#1_48| v_~C1~0.base_15 (let ((.cse0 (bvmul v_thread1Thread1of1ForFork2_~i~0_11 (_ bv4 32)))) (store (select |v_#memory_int#1_48| v_~C1~0.base_15) (bvadd .cse0 v_~C1~0.offset_15) (bvadd (select (select |v_#memory_int#1_48| v_~A~0.base_20) (bvadd v_~A~0.offset_20 .cse0)) (select (select |v_#memory_int#1_48| v_~B~0.base_18) (bvadd v_~B~0.offset_18 .cse0))))))) (= v_thread1Thread1of1ForFork2_~i~0_12 (bvadd v_thread1Thread1of1ForFork2_~i~0_11 (_ bv1 32))) (bvslt v_thread1Thread1of1ForFork2_~i~0_11 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_20, ~C1~0.base=v_~C1~0.base_15, ~B~0.base=v_~B~0.base_18, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11, ~C1~0.offset=v_~C1~0.offset_15, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_48|, ~B~0.offset=v_~B~0.offset_18} OutVars{~A~0.base=v_~A~0.base_20, ~B~0.base=v_~B~0.base_18, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_12, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_47|, ~C1~0.base=v_~C1~0.base_15, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, ~C1~0.offset=v_~C1~0.offset_15, ~B~0.offset=v_~B~0.offset_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, #memory_int#1][276], [Black: 248#true, 24#thread2EXITtrue, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 632#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 654#(and (bvsle ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), Black: 652#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 650#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 615#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), 22#L50-7true, Black: 656#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), Black: 622#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt ~M~0 ~N~0))), Black: 660#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), 3#L66-2true, 761#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~M~0))), Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 13#L89-4true]) [2024-11-08 18:16:02,353 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-08 18:16:02,353 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:16:02,354 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:16:02,354 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-08 18:16:02,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L50-2-->L50-7: Formula: (and (= |v_#memory_int#1_47| (store |v_#memory_int#1_48| v_~C1~0.base_15 (let ((.cse0 (bvmul v_thread1Thread1of1ForFork2_~i~0_11 (_ bv4 32)))) (store (select |v_#memory_int#1_48| v_~C1~0.base_15) (bvadd .cse0 v_~C1~0.offset_15) (bvadd (select (select |v_#memory_int#1_48| v_~A~0.base_20) (bvadd v_~A~0.offset_20 .cse0)) (select (select |v_#memory_int#1_48| v_~B~0.base_18) (bvadd v_~B~0.offset_18 .cse0))))))) (= v_thread1Thread1of1ForFork2_~i~0_12 (bvadd v_thread1Thread1of1ForFork2_~i~0_11 (_ bv1 32))) (bvslt v_thread1Thread1of1ForFork2_~i~0_11 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_20, ~C1~0.base=v_~C1~0.base_15, ~B~0.base=v_~B~0.base_18, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11, ~C1~0.offset=v_~C1~0.offset_15, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_48|, ~B~0.offset=v_~B~0.offset_18} OutVars{~A~0.base=v_~A~0.base_20, ~B~0.base=v_~B~0.base_18, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_12, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, ~N~0=v_~N~0_31, #memory_int#1=|v_#memory_int#1_47|, ~C1~0.base=v_~C1~0.base_15, ~A~0.offset=v_~A~0.offset_20, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, ~C1~0.offset=v_~C1~0.offset_15, ~B~0.offset=v_~B~0.offset_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, #memory_int#1][276], [Black: 248#true, 24#thread2EXITtrue, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 632#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 654#(and (bvsle ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), Black: 652#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 650#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 615#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), 22#L50-7true, Black: 656#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), Black: 622#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt ~M~0 ~N~0))), Black: 660#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), 3#L66-2true, 761#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)) (not (bvslt (_ bv0 32) ~M~0))), 27#L90true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)))]) [2024-11-08 18:16:02,573 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-08 18:16:02,574 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-08 18:16:02,574 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-08 18:16:02,574 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-08 18:16:02,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L50-8-->thread1EXIT: Formula: (and (= (_ bv0 32) |v_thread1Thread1of1ForFork2_#res.offset_1|) (= (_ bv0 32) |v_thread1Thread1of1ForFork2_#res.base_1|)) InVars {} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][53], [723#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), Black: 248#true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 632#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), Black: 654#(and (bvsle ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), Black: 652#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 650#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 615#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), Black: 656#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), Black: 622#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt ~M~0 ~N~0))), Black: 660#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), 29#thread3EXITtrue, 16#thread1EXITtrue, 17#L58-8true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 13#L89-4true, 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))]) [2024-11-08 18:16:02,873 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-08 18:16:02,873 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-08 18:16:02,873 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-08 18:16:02,874 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-08 18:16:02,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L50-8-->thread1EXIT: Formula: (and (= (_ bv0 32) |v_thread1Thread1of1ForFork2_#res.offset_1|) (= (_ bv0 32) |v_thread1Thread1of1ForFork2_#res.base_1|)) InVars {} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][53], [723#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), Black: 248#true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 632#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), Black: 654#(and (bvsle ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), Black: 652#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 650#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 615#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), Black: 656#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), Black: 622#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt ~M~0 ~N~0))), Black: 660#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), 29#thread3EXITtrue, 16#thread1EXITtrue, 17#L58-8true, 27#L90true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))]) [2024-11-08 18:16:02,911 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-08 18:16:02,911 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-08 18:16:02,912 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-08 18:16:02,912 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-08 18:16:02,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L50-8-->thread1EXIT: Formula: (and (= (_ bv0 32) |v_thread1Thread1of1ForFork2_#res.offset_1|) (= (_ bv0 32) |v_thread1Thread1of1ForFork2_#res.base_1|)) InVars {} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][53], [723#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 24#thread2EXITtrue, Black: 248#true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 632#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), Black: 654#(and (bvsle ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), Black: 652#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 650#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 615#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), Black: 656#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), Black: 622#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt ~M~0 ~N~0))), Black: 660#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), 29#thread3EXITtrue, 16#thread1EXITtrue, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 13#L89-4true, 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))]) [2024-11-08 18:16:02,913 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-08 18:16:02,913 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-08 18:16:02,913 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-08 18:16:02,913 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-08 18:16:02,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L50-8-->thread1EXIT: Formula: (and (= (_ bv0 32) |v_thread1Thread1of1ForFork2_#res.offset_1|) (= (_ bv0 32) |v_thread1Thread1of1ForFork2_#res.base_1|)) InVars {} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][53], [723#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 24#thread2EXITtrue, Black: 248#true, Black: 504#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))), Black: 494#(and (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 426#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)), Black: 500#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 398#(or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 507#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)) (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 509#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 412#(or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 416#(or (bvslt ~M~0 ~N~0) (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0) (bvsle ~N~0 (_ bv0 32))), Black: 502#(and (or (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsle ~N~0 (_ bv0 32))) (or (bvslt ~M~0 ~N~0) (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))), Black: 113#(and (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 632#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), Black: 654#(and (bvsle ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), Black: 652#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 650#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0) (not (bvslt ~M~0 ~N~0))), Black: 615#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32)) (= thread3Thread1of1ForFork1_~i~2 ~M~0)), Black: 656#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), Black: 622#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (not (bvslt ~M~0 ~N~0))), Black: 660#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsle ~N~0 (_ bv0 32)) (not (bvslt ~M~0 ~N~0))), 29#thread3EXITtrue, 16#thread1EXITtrue, 27#L90true, Black: 152#(and (= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 581#(and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 402#(or (bvslt ~M~0 ~N~0) (bvsle ~N~0 (_ bv0 32)))]) [2024-11-08 18:16:02,932 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-08 18:16:02,932 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-08 18:16:02,932 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-08 18:16:02,932 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-08 18:16:02,952 INFO L124 PetriNetUnfolderBase]: 5962/8731 cut-off events. [2024-11-08 18:16:02,953 INFO L125 PetriNetUnfolderBase]: For 40050/41436 co-relation queries the response was YES. [2024-11-08 18:16:03,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40581 conditions, 8731 events. 5962/8731 cut-off events. For 40050/41436 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 50546 event pairs, 1307 based on Foata normal form. 219/8323 useless extension candidates. Maximal degree in co-relation 40495. Up to 3742 conditions per place. [2024-11-08 18:16:03,061 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 232 selfloop transitions, 71 changer transitions 15/360 dead transitions. [2024-11-08 18:16:03,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 360 transitions, 3154 flow [2024-11-08 18:16:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:16:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-08 18:16:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 388 transitions. [2024-11-08 18:16:03,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5527065527065527 [2024-11-08 18:16:03,064 INFO L175 Difference]: Start difference. First operand has 90 places, 159 transitions, 1117 flow. Second operand 13 states and 388 transitions. [2024-11-08 18:16:03,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 360 transitions, 3154 flow [2024-11-08 18:16:03,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 360 transitions, 3139 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-08 18:16:03,225 INFO L231 Difference]: Finished difference. Result has 108 places, 192 transitions, 1693 flow [2024-11-08 18:16:03,227 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1693, PETRI_PLACES=108, PETRI_TRANSITIONS=192} [2024-11-08 18:16:03,229 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 62 predicate places. [2024-11-08 18:16:03,231 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 192 transitions, 1693 flow [2024-11-08 18:16:03,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.5) internal successors, (196), 8 states have internal predecessors, (196), 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) [2024-11-08 18:16:03,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:16:03,232 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:16:03,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 18:16:03,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:16:03,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:16:03,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:16:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash -308095829, now seen corresponding path program 4 times [2024-11-08 18:16:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:16:03,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635147822] [2024-11-08 18:16:03,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 18:16:03,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:16:03,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:16:03,446 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:16:03,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 18:16:03,551 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 18:16:03,551 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:16:03,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 18:16:03,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:16:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:16:04,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:16:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:16:04,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:16:04,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635147822] [2024-11-08 18:16:04,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635147822] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:16:04,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:16:04,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-08 18:16:04,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392532176] [2024-11-08 18:16:04,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:16:04,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:16:04,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:16:04,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:16:04,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:16:04,259 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 54 [2024-11-08 18:16:04,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 192 transitions, 1693 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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) [2024-11-08 18:16:04,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:16:04,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 54 [2024-11-08 18:16:04,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:16:07,235 INFO L124 PetriNetUnfolderBase]: 10386/15208 cut-off events. [2024-11-08 18:16:07,235 INFO L125 PetriNetUnfolderBase]: For 92200/94126 co-relation queries the response was YES. [2024-11-08 18:16:07,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76789 conditions, 15208 events. 10386/15208 cut-off events. For 92200/94126 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 93805 event pairs, 1602 based on Foata normal form. 236/15046 useless extension candidates. Maximal degree in co-relation 76695. Up to 4903 conditions per place. [2024-11-08 18:16:07,494 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 243 selfloop transitions, 162 changer transitions 6/440 dead transitions. [2024-11-08 18:16:07,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 440 transitions, 4657 flow [2024-11-08 18:16:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:16:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 18:16:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2024-11-08 18:16:07,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2024-11-08 18:16:07,497 INFO L175 Difference]: Start difference. First operand has 108 places, 192 transitions, 1693 flow. Second operand 7 states and 237 transitions. [2024-11-08 18:16:07,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 440 transitions, 4657 flow [2024-11-08 18:16:08,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 440 transitions, 4550 flow, removed 52 selfloop flow, removed 2 redundant places. [2024-11-08 18:16:08,229 INFO L231 Difference]: Finished difference. Result has 118 places, 317 transitions, 3644 flow [2024-11-08 18:16:08,229 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3644, PETRI_PLACES=118, PETRI_TRANSITIONS=317} [2024-11-08 18:16:08,230 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 72 predicate places. [2024-11-08 18:16:08,230 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 317 transitions, 3644 flow [2024-11-08 18:16:08,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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) [2024-11-08 18:16:08,230 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:16:08,231 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:16:08,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 18:16:08,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:16:08,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:16:08,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:16:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2085699827, now seen corresponding path program 5 times [2024-11-08 18:16:08,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:16:08,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648160659] [2024-11-08 18:16:08,433 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 18:16:08,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:16:08,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:16:08,434 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:16:08,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 18:16:08,589 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:16:08,590 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:16:08,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 18:16:08,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:16:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:16:09,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:16:09,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:16:09,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:16:09,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648160659] [2024-11-08 18:16:09,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648160659] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:16:09,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:16:09,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2024-11-08 18:16:09,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850332407] [2024-11-08 18:16:09,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:16:09,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:16:09,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:16:09,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:16:09,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:16:09,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 54 [2024-11-08 18:16:09,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 317 transitions, 3644 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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) [2024-11-08 18:16:09,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:16:09,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 54 [2024-11-08 18:16:09,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:16:12,941 INFO L124 PetriNetUnfolderBase]: 10887/16035 cut-off events. [2024-11-08 18:16:12,941 INFO L125 PetriNetUnfolderBase]: For 134222/136292 co-relation queries the response was YES. [2024-11-08 18:16:13,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91609 conditions, 16035 events. 10887/16035 cut-off events. For 134222/136292 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 101289 event pairs, 1728 based on Foata normal form. 308/16087 useless extension candidates. Maximal degree in co-relation 91511. Up to 5139 conditions per place. [2024-11-08 18:16:13,120 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 298 selfloop transitions, 174 changer transitions 6/507 dead transitions. [2024-11-08 18:16:13,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 507 transitions, 6373 flow [2024-11-08 18:16:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:16:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 18:16:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2024-11-08 18:16:13,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-11-08 18:16:13,124 INFO L175 Difference]: Start difference. First operand has 118 places, 317 transitions, 3644 flow. Second operand 7 states and 234 transitions. [2024-11-08 18:16:13,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 507 transitions, 6373 flow [2024-11-08 18:16:14,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 507 transitions, 6297 flow, removed 38 selfloop flow, removed 0 redundant places. [2024-11-08 18:16:14,154 INFO L231 Difference]: Finished difference. Result has 129 places, 391 transitions, 5231 flow [2024-11-08 18:16:14,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3574, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5231, PETRI_PLACES=129, PETRI_TRANSITIONS=391} [2024-11-08 18:16:14,155 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 83 predicate places. [2024-11-08 18:16:14,155 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 391 transitions, 5231 flow [2024-11-08 18:16:14,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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) [2024-11-08 18:16:14,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:16:14,156 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:16:14,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 18:16:14,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:16:14,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:16:14,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:16:14,357 INFO L85 PathProgramCache]: Analyzing trace with hash -679976949, now seen corresponding path program 6 times [2024-11-08 18:16:14,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:16:14,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [264498342] [2024-11-08 18:16:14,358 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 18:16:14,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:16:14,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:16:14,359 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:16:14,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 18:16:14,494 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-08 18:16:14,494 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:16:14,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 18:16:14,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:16:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:16:14,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:16:14,797 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:16:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264498342] [2024-11-08 18:16:14,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264498342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:16:14,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:16:14,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:16:14,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603554609] [2024-11-08 18:16:14,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:16:14,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:16:14,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:16:14,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:16:14,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:16:14,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2024-11-08 18:16:14,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 391 transitions, 5231 flow. Second operand has 8 states, 8 states have (on average 24.5) internal successors, (196), 8 states have internal predecessors, (196), 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) [2024-11-08 18:16:14,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:16:14,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2024-11-08 18:16:14,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:16:18,748 INFO L124 PetriNetUnfolderBase]: 11070/16596 cut-off events. [2024-11-08 18:16:18,749 INFO L125 PetriNetUnfolderBase]: For 191647/194794 co-relation queries the response was YES. [2024-11-08 18:16:18,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104458 conditions, 16596 events. 11070/16596 cut-off events. For 191647/194794 co-relation queries the response was YES. Maximal size of possible extension queue 1058. Compared 110344 event pairs, 2322 based on Foata normal form. 516/16508 useless extension candidates. Maximal degree in co-relation 104355. Up to 8453 conditions per place. [2024-11-08 18:16:19,078 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 337 selfloop transitions, 141 changer transitions 17/608 dead transitions. [2024-11-08 18:16:19,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 608 transitions, 8572 flow [2024-11-08 18:16:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:16:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-08 18:16:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 356 transitions. [2024-11-08 18:16:19,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5493827160493827 [2024-11-08 18:16:19,083 INFO L175 Difference]: Start difference. First operand has 129 places, 391 transitions, 5231 flow. Second operand 12 states and 356 transitions. [2024-11-08 18:16:19,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 608 transitions, 8572 flow [2024-11-08 18:16:20,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 608 transitions, 8480 flow, removed 46 selfloop flow, removed 0 redundant places. [2024-11-08 18:16:20,442 INFO L231 Difference]: Finished difference. Result has 145 places, 463 transitions, 6952 flow [2024-11-08 18:16:20,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=5179, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6952, PETRI_PLACES=145, PETRI_TRANSITIONS=463} [2024-11-08 18:16:20,443 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 99 predicate places. [2024-11-08 18:16:20,443 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 463 transitions, 6952 flow [2024-11-08 18:16:20,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.5) internal successors, (196), 8 states have internal predecessors, (196), 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) [2024-11-08 18:16:20,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:16:20,444 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:16:20,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 18:16:20,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:16:20,645 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:16:20,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:16:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1508264711, now seen corresponding path program 7 times [2024-11-08 18:16:20,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:16:20,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992517784] [2024-11-08 18:16:20,647 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-08 18:16:20,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:16:20,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:16:20,649 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:16:20,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 18:16:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:16:20,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 18:16:20,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:16:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:16:21,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:16:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:16:21,430 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:16:21,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992517784] [2024-11-08 18:16:21,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992517784] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:16:21,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:16:21,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2024-11-08 18:16:21,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463526874] [2024-11-08 18:16:21,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:16:21,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:16:21,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:16:21,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:16:21,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:16:21,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 54 [2024-11-08 18:16:21,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 463 transitions, 6952 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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) [2024-11-08 18:16:21,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:16:21,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 54 [2024-11-08 18:16:21,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:16:26,855 INFO L124 PetriNetUnfolderBase]: 15598/23204 cut-off events. [2024-11-08 18:16:26,855 INFO L125 PetriNetUnfolderBase]: For 286106/289632 co-relation queries the response was YES. [2024-11-08 18:16:27,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150259 conditions, 23204 events. 15598/23204 cut-off events. For 286106/289632 co-relation queries the response was YES. Maximal size of possible extension queue 1316. Compared 157313 event pairs, 2260 based on Foata normal form. 381/23216 useless extension candidates. Maximal degree in co-relation 150149. Up to 8227 conditions per place. [2024-11-08 18:16:27,307 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 274 selfloop transitions, 330 changer transitions 8/641 dead transitions. [2024-11-08 18:16:27,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 641 transitions, 10458 flow [2024-11-08 18:16:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:16:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 18:16:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 235 transitions. [2024-11-08 18:16:27,309 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6216931216931217 [2024-11-08 18:16:27,309 INFO L175 Difference]: Start difference. First operand has 145 places, 463 transitions, 6952 flow. Second operand 7 states and 235 transitions. [2024-11-08 18:16:27,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 641 transitions, 10458 flow [2024-11-08 18:16:30,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 641 transitions, 10179 flow, removed 138 selfloop flow, removed 2 redundant places. [2024-11-08 18:16:30,106 INFO L231 Difference]: Finished difference. Result has 154 places, 559 transitions, 9448 flow [2024-11-08 18:16:30,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=6749, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9448, PETRI_PLACES=154, PETRI_TRANSITIONS=559} [2024-11-08 18:16:30,107 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 108 predicate places. [2024-11-08 18:16:30,107 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 559 transitions, 9448 flow [2024-11-08 18:16:30,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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) [2024-11-08 18:16:30,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:16:30,108 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:16:30,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 18:16:30,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:16:30,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 18:16:30,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:16:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1017369738, now seen corresponding path program 1 times [2024-11-08 18:16:30,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:16:30,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538668522] [2024-11-08 18:16:30,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:16:30,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:16:30,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:16:30,311 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:16:30,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083d9da6-524a-4c95-ae9f-64665b3bb917/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 18:16:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:16:30,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 18:16:30,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:16:30,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 18:16:30,696 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 18:16:30,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-08 18:16:30,864 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-08 18:16:30,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 18:16:31,203 INFO L349 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2024-11-08 18:16:31,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 31 [2024-11-08 18:16:31,972 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 18:16:31,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-08 18:16:32,891 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 18:16:32,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 36 [2024-11-08 18:16:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:16:34,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:16:51,321 INFO L349 Elim1Store]: treesize reduction 106, result has 71.4 percent of original size [2024-11-08 18:16:51,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 2816 treesize of output 1399 [2024-11-08 18:16:51,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:16:51,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1241 treesize of output 1167 [2024-11-08 18:16:52,955 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-08 18:16:52,955 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 17 treesize of output 9 [2024-11-08 18:16:54,446 INFO L349 Elim1Store]: treesize reduction 10, result has 83.6 percent of original size [2024-11-08 18:16:54,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 80 [2024-11-08 18:16:57,438 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-08 18:16:57,439 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 25 treesize of output 17 [2024-11-08 18:16:58,149 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-08 18:16:58,150 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 25 treesize of output 17 [2024-11-08 18:19:41,270 INFO L349 Elim1Store]: treesize reduction 10, result has 74.4 percent of original size [2024-11-08 18:19:41,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1492 treesize of output 1356 [2024-11-08 18:21:26,624 INFO L224 Elim1Store]: Index analysis took 157 ms [2024-11-08 18:21:29,032 INFO L349 Elim1Store]: treesize reduction 10, result has 91.5 percent of original size [2024-11-08 18:21:29,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 900 treesize of output 894