./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme --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 a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:48:48,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:48:48,394 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 10:48:48,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:48:48,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:48:48,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:48:48,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:48:48,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:48:48,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:48:48,429 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:48:48,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:48:48,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:48:48,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:48:48,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:48:48,432 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:48:48,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:48:48,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:48:48,434 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:48:48,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:48:48,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:48:48,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:48:48,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:48:48,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:48:48,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:48:48,438 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:48:48,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:48:48,439 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:48:48,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:48:48,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:48:48,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:48:48,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:48:48,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:48:48,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:48:48,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:48:48,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:48:48,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:48:48,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:48:48,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:48:48,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:48:48,445 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:48:48,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:48:48,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:48:48,447 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_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/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_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme 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 -> a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 [2023-11-26 10:48:48,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:48:48,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:48:48,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:48:48,769 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:48:48,770 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:48:48,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2023-11-26 10:48:51,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:48:52,092 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:48:52,092 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2023-11-26 10:48:52,102 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/data/fe260ac6f/d5dae481ce56495d9627c84da8f96d9d/FLAG3fec4892f [2023-11-26 10:48:52,117 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/data/fe260ac6f/d5dae481ce56495d9627c84da8f96d9d [2023-11-26 10:48:52,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:48:52,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:48:52,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:48:52,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:48:52,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:48:52,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d454652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52, skipping insertion in model container [2023-11-26 10:48:52,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,160 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:48:52,355 WARN L240 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_8073fce3-2879-480f-9ce5-d09af8fa971a/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4226,4239] [2023-11-26 10:48:52,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:48:52,377 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:48:52,410 WARN L240 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_8073fce3-2879-480f-9ce5-d09af8fa971a/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4226,4239] [2023-11-26 10:48:52,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:48:52,440 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:48:52,444 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:48:52,452 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:48:52,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52 WrapperNode [2023-11-26 10:48:52,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:48:52,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:48:52,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:48:52,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:48:52,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,550 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 331 [2023-11-26 10:48:52,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:48:52,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:48:52,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:48:52,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:48:52,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,613 INFO L175 MemorySlicer]: Split 16 memory accesses to 6 slices as follows [2, 6, 2, 2, 2, 2]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 6 writes are split as follows [0, 2, 1, 1, 1, 1]. [2023-11-26 10:48:52,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:48:52,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:48:52,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:48:52,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:48:52,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52" (1/1) ... [2023-11-26 10:48:52,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:48:52,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:48:52,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:48:52,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:48:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:48:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:48:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:48:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:48:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 10:48:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 10:48:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 10:48:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-26 10:48:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 10:48:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 10:48:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 10:48:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-26 10:48:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-26 10:48:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-26 10:48:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-26 10:48:52,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-26 10:48:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-26 10:48:52,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-26 10:48:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-26 10:48:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-26 10:48:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-26 10:48:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-26 10:48:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:48:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:48:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 10:48:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 10:48:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 10:48:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-26 10:48:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:48:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:48:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 10:48:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:48:52,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:48:52,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:48:52,758 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:48:52,911 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:48:52,913 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:48:53,502 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:48:54,229 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:48:54,230 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-26 10:48:54,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:48:54 BoogieIcfgContainer [2023-11-26 10:48:54,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:48:54,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:48:54,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:48:54,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:48:54,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:48:52" (1/3) ... [2023-11-26 10:48:54,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2b0ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:48:54, skipping insertion in model container [2023-11-26 10:48:54,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:52" (2/3) ... [2023-11-26 10:48:54,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2b0ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:48:54, skipping insertion in model container [2023-11-26 10:48:54,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:48:54" (3/3) ... [2023-11-26 10:48:54,243 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2023-11-26 10:48:54,253 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:48:54,291 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:48:54,291 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:48:54,292 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:48:54,371 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-26 10:48:54,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 51 transitions, 130 flow [2023-11-26 10:48:54,450 INFO L124 PetriNetUnfolderBase]: 6/47 cut-off events. [2023-11-26 10:48:54,451 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 10:48:54,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 47 events. 6/47 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-26 10:48:54,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 51 transitions, 130 flow [2023-11-26 10:48:54,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 46 transitions, 116 flow [2023-11-26 10:48:54,470 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:48:54,477 INFO L357 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, mHoare=true, 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;@3e3fbd4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:48:54,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-26 10:48:54,497 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:48:54,497 INFO L124 PetriNetUnfolderBase]: 6/45 cut-off events. [2023-11-26 10:48:54,498 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 10:48:54,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:54,499 INFO L208 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] [2023-11-26 10:48:54,500 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 10:48:54,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1259852029, now seen corresponding path program 1 times [2023-11-26 10:48:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:54,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518146786] [2023-11-26 10:48:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:54,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:48:55,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:55,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518146786] [2023-11-26 10:48:55,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518146786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:55,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:55,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:48:55,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476970440] [2023-11-26 10:48:55,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:55,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:48:55,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:55,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:48:55,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:48:55,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2023-11-26 10:48:55,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 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) [2023-11-26 10:48:55,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:55,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2023-11-26 10:48:55,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:56,312 INFO L124 PetriNetUnfolderBase]: 2083/3088 cut-off events. [2023-11-26 10:48:56,312 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2023-11-26 10:48:56,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6138 conditions, 3088 events. 2083/3088 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 17521 event pairs, 251 based on Foata normal form. 144/3190 useless extension candidates. Maximal degree in co-relation 4745. Up to 1594 conditions per place. [2023-11-26 10:48:56,352 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 71 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2023-11-26 10:48:56,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 399 flow [2023-11-26 10:48:56,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:48:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:48:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2023-11-26 10:48:56,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6339869281045751 [2023-11-26 10:48:56,367 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 194 transitions. [2023-11-26 10:48:56,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 194 transitions. [2023-11-26 10:48:56,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:56,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 194 transitions. [2023-11-26 10:48:56,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:56,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:56,379 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:56,381 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 116 flow. Second operand 6 states and 194 transitions. [2023-11-26 10:48:56,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 93 transitions, 399 flow [2023-11-26 10:48:56,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 361 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-26 10:48:56,392 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 147 flow [2023-11-26 10:48:56,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2023-11-26 10:48:56,398 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2023-11-26 10:48:56,398 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 147 flow [2023-11-26 10:48:56,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 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) [2023-11-26 10:48:56,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:56,399 INFO L208 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] [2023-11-26 10:48:56,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:48:56,400 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 10:48:56,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1263929748, now seen corresponding path program 1 times [2023-11-26 10:48:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:56,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351900410] [2023-11-26 10:48:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:56,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:48:56,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:56,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351900410] [2023-11-26 10:48:56,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351900410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:56,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:56,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:48:56,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736353811] [2023-11-26 10:48:56,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:56,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:48:56,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:56,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:48:56,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:48:56,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2023-11-26 10:48:56,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:56,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:56,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2023-11-26 10:48:56,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:57,984 INFO L124 PetriNetUnfolderBase]: 3239/5036 cut-off events. [2023-11-26 10:48:57,985 INFO L125 PetriNetUnfolderBase]: For 2544/2544 co-relation queries the response was YES. [2023-11-26 10:48:58,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12203 conditions, 5036 events. 3239/5036 cut-off events. For 2544/2544 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 33557 event pairs, 1093 based on Foata normal form. 72/4989 useless extension candidates. Maximal degree in co-relation 3658. Up to 2030 conditions per place. [2023-11-26 10:48:58,045 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 79 selfloop transitions, 11 changer transitions 0/105 dead transitions. [2023-11-26 10:48:58,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 105 transitions, 477 flow [2023-11-26 10:48:58,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:48:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:48:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2023-11-26 10:48:58,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6535947712418301 [2023-11-26 10:48:58,060 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 200 transitions. [2023-11-26 10:48:58,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 200 transitions. [2023-11-26 10:48:58,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:58,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 200 transitions. [2023-11-26 10:48:58,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:58,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:58,067 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:58,067 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 147 flow. Second operand 6 states and 200 transitions. [2023-11-26 10:48:58,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 105 transitions, 477 flow [2023-11-26 10:48:58,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:48:58,077 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 231 flow [2023-11-26 10:48:58,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2023-11-26 10:48:58,078 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2023-11-26 10:48:58,078 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 231 flow [2023-11-26 10:48:58,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:58,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:58,079 INFO L208 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] [2023-11-26 10:48:58,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:48:58,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 10:48:58,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:58,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1916060414, now seen corresponding path program 1 times [2023-11-26 10:48:58,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:58,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534173139] [2023-11-26 10:48:58,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:58,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:48:58,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:58,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534173139] [2023-11-26 10:48:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534173139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:58,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:58,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:48:58,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280813853] [2023-11-26 10:48:58,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:58,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:48:58,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:58,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:48:58,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:48:58,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2023-11-26 10:48:58,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:58,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:58,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2023-11-26 10:48:58,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:58,965 INFO L124 PetriNetUnfolderBase]: 2155/3565 cut-off events. [2023-11-26 10:48:58,965 INFO L125 PetriNetUnfolderBase]: For 5966/6242 co-relation queries the response was YES. [2023-11-26 10:48:58,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10084 conditions, 3565 events. 2155/3565 cut-off events. For 5966/6242 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 24285 event pairs, 371 based on Foata normal form. 210/3650 useless extension candidates. Maximal degree in co-relation 3682. Up to 2747 conditions per place. [2023-11-26 10:48:59,020 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 44 selfloop transitions, 3 changer transitions 4/73 dead transitions. [2023-11-26 10:48:59,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 73 transitions, 364 flow [2023-11-26 10:48:59,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:48:59,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:48:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-11-26 10:48:59,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7189542483660131 [2023-11-26 10:48:59,022 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 110 transitions. [2023-11-26 10:48:59,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 110 transitions. [2023-11-26 10:48:59,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:59,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 110 transitions. [2023-11-26 10:48:59,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:59,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:59,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:59,026 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 231 flow. Second operand 3 states and 110 transitions. [2023-11-26 10:48:59,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 73 transitions, 364 flow [2023-11-26 10:48:59,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 357 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-26 10:48:59,042 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 224 flow [2023-11-26 10:48:59,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2023-11-26 10:48:59,044 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2023-11-26 10:48:59,045 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 224 flow [2023-11-26 10:48:59,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:59,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:59,045 INFO L208 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] [2023-11-26 10:48:59,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:48:59,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 10:48:59,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:59,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1574095419, now seen corresponding path program 1 times [2023-11-26 10:48:59,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:59,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698016052] [2023-11-26 10:48:59,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:59,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:48:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698016052] [2023-11-26 10:48:59,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698016052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:59,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:59,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:48:59,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328577227] [2023-11-26 10:48:59,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:59,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:48:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:59,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:48:59,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:48:59,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2023-11-26 10:48:59,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:59,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:59,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2023-11-26 10:48:59,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:00,133 INFO L124 PetriNetUnfolderBase]: 2506/4080 cut-off events. [2023-11-26 10:49:00,133 INFO L125 PetriNetUnfolderBase]: For 8484/8874 co-relation queries the response was YES. [2023-11-26 10:49:00,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11424 conditions, 4080 events. 2506/4080 cut-off events. For 8484/8874 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 28089 event pairs, 1868 based on Foata normal form. 429/4226 useless extension candidates. Maximal degree in co-relation 7228. Up to 3236 conditions per place. [2023-11-26 10:49:00,188 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 34 selfloop transitions, 2 changer transitions 20/78 dead transitions. [2023-11-26 10:49:00,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 390 flow [2023-11-26 10:49:00,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:49:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 10:49:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2023-11-26 10:49:00,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2023-11-26 10:49:00,190 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 135 transitions. [2023-11-26 10:49:00,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 135 transitions. [2023-11-26 10:49:00,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:00,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 135 transitions. [2023-11-26 10:49:00,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:00,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:00,192 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:00,192 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 224 flow. Second operand 4 states and 135 transitions. [2023-11-26 10:49:00,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 390 flow [2023-11-26 10:49:00,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:49:00,205 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 234 flow [2023-11-26 10:49:00,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-11-26 10:49:00,207 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2023-11-26 10:49:00,207 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 234 flow [2023-11-26 10:49:00,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:00,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:00,208 INFO L208 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] [2023-11-26 10:49:00,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:49:00,208 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 10:49:00,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:00,209 INFO L85 PathProgramCache]: Analyzing trace with hash 259808718, now seen corresponding path program 1 times [2023-11-26 10:49:00,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:00,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091083879] [2023-11-26 10:49:00,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:00,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:01,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:01,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091083879] [2023-11-26 10:49:01,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091083879] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:01,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146143735] [2023-11-26 10:49:01,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:01,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:01,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:01,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:01,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 10:49:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:01,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-26 10:49:01,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:01,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-26 10:49:02,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-26 10:49:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:02,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:02,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-11-26 10:49:02,706 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 47 treesize of output 35 [2023-11-26 10:49:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:02,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146143735] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:49:02,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:49:02,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-11-26 10:49:02,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114504194] [2023-11-26 10:49:02,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:02,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-26 10:49:02,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:02,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-26 10:49:02,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-11-26 10:49:02,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2023-11-26 10:49:02,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 234 flow. Second operand has 18 states, 18 states have (on average 23.88888888888889) internal successors, (430), 18 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:02,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:02,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2023-11-26 10:49:02,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:06,208 INFO L124 PetriNetUnfolderBase]: 6514/10470 cut-off events. [2023-11-26 10:49:06,208 INFO L125 PetriNetUnfolderBase]: For 18249/19007 co-relation queries the response was YES. [2023-11-26 10:49:06,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29251 conditions, 10470 events. 6514/10470 cut-off events. For 18249/19007 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 78115 event pairs, 1412 based on Foata normal form. 583/10532 useless extension candidates. Maximal degree in co-relation 29232. Up to 4229 conditions per place. [2023-11-26 10:49:06,457 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 157 selfloop transitions, 37 changer transitions 14/230 dead transitions. [2023-11-26 10:49:06,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 230 transitions, 1263 flow [2023-11-26 10:49:06,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-26 10:49:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-26 10:49:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 526 transitions. [2023-11-26 10:49:06,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6446078431372549 [2023-11-26 10:49:06,463 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 526 transitions. [2023-11-26 10:49:06,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 526 transitions. [2023-11-26 10:49:06,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:06,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 526 transitions. [2023-11-26 10:49:06,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 32.875) internal successors, (526), 16 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:06,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 51.0) internal successors, (867), 17 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:06,469 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 51.0) internal successors, (867), 17 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:06,469 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 234 flow. Second operand 16 states and 526 transitions. [2023-11-26 10:49:06,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 230 transitions, 1263 flow [2023-11-26 10:49:06,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 230 transitions, 1243 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-11-26 10:49:06,507 INFO L231 Difference]: Finished difference. Result has 80 places, 96 transitions, 560 flow [2023-11-26 10:49:06,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=560, PETRI_PLACES=80, PETRI_TRANSITIONS=96} [2023-11-26 10:49:06,508 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2023-11-26 10:49:06,509 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 96 transitions, 560 flow [2023-11-26 10:49:06,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 23.88888888888889) internal successors, (430), 18 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:06,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:06,510 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:06,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 10:49:06,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:06,725 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 10:49:06,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1160608728, now seen corresponding path program 1 times [2023-11-26 10:49:06,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:06,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763687209] [2023-11-26 10:49:06,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:06,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:08,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:08,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763687209] [2023-11-26 10:49:08,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763687209] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:08,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881784519] [2023-11-26 10:49:08,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:08,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:08,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:08,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:08,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 10:49:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:08,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-26 10:49:08,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:08,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-11-26 10:49:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 10:49:08,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:08,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:49:08,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2023-11-26 10:49:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 10:49:09,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881784519] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:49:09,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:49:09,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2023-11-26 10:49:09,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845910444] [2023-11-26 10:49:09,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:09,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-26 10:49:09,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:09,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-26 10:49:09,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-11-26 10:49:09,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2023-11-26 10:49:09,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 96 transitions, 560 flow. Second operand has 15 states, 15 states have (on average 24.466666666666665) internal successors, (367), 15 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:09,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:09,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2023-11-26 10:49:09,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:12,431 INFO L124 PetriNetUnfolderBase]: 8713/14246 cut-off events. [2023-11-26 10:49:12,431 INFO L125 PetriNetUnfolderBase]: For 31758/32947 co-relation queries the response was YES. [2023-11-26 10:49:12,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43132 conditions, 14246 events. 8713/14246 cut-off events. For 31758/32947 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 111609 event pairs, 819 based on Foata normal form. 767/14469 useless extension candidates. Maximal degree in co-relation 32321. Up to 5331 conditions per place. [2023-11-26 10:49:12,651 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 110 selfloop transitions, 58 changer transitions 9/199 dead transitions. [2023-11-26 10:49:12,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 199 transitions, 1335 flow [2023-11-26 10:49:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 10:49:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-26 10:49:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 420 transitions. [2023-11-26 10:49:12,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2023-11-26 10:49:12,655 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 420 transitions. [2023-11-26 10:49:12,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 420 transitions. [2023-11-26 10:49:12,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:12,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 420 transitions. [2023-11-26 10:49:12,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 30.0) internal successors, (420), 14 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:12,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 51.0) internal successors, (765), 15 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:12,660 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 51.0) internal successors, (765), 15 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:12,660 INFO L175 Difference]: Start difference. First operand has 80 places, 96 transitions, 560 flow. Second operand 14 states and 420 transitions. [2023-11-26 10:49:12,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 199 transitions, 1335 flow [2023-11-26 10:49:12,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 199 transitions, 1315 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-11-26 10:49:12,737 INFO L231 Difference]: Finished difference. Result has 94 places, 121 transitions, 901 flow [2023-11-26 10:49:12,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=901, PETRI_PLACES=94, PETRI_TRANSITIONS=121} [2023-11-26 10:49:12,738 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2023-11-26 10:49:12,738 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 121 transitions, 901 flow [2023-11-26 10:49:12,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 24.466666666666665) internal successors, (367), 15 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:12,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:12,739 INFO L208 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, 1] [2023-11-26 10:49:12,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 10:49:12,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:12,947 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 10:49:12,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:12,948 INFO L85 PathProgramCache]: Analyzing trace with hash 339345903, now seen corresponding path program 1 times [2023-11-26 10:49:12,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:12,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065766385] [2023-11-26 10:49:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:12,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 10:49:13,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:13,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065766385] [2023-11-26 10:49:13,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065766385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:13,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:13,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:49:13,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584859376] [2023-11-26 10:49:13,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:13,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:49:13,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:13,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:49:13,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:49:13,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2023-11-26 10:49:13,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 121 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:13,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:13,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2023-11-26 10:49:13,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:15,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 16#L56true, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 13#L74true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:15,702 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-26 10:49:15,702 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 10:49:15,702 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 10:49:15,703 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-26 10:49:15,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 16#L56true, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 4#L110true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 13#L74true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:15,819 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-26 10:49:15,819 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-26 10:49:15,819 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:49:15,819 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 10:49:15,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 30#L144-1true, 370#true, 20#L92true, 2#thread4EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 16#L56true, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 13#L74true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:15,916 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-26 10:49:15,917 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 10:49:15,917 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:49:15,917 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 10:49:16,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 30#L144-1true, 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 16#L56true, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 4#L110true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 13#L74true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,011 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-26 10:49:16,012 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:49:16,012 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-26 10:49:16,012 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 10:49:16,073 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 13#L74true, 11#thread1EXITtrue, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,073 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-26 10:49:16,073 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:49:16,073 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 10:49:16,074 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 10:49:16,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 16#L56true, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,096 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-26 10:49:16,096 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:49:16,096 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 10:49:16,096 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 10:49:16,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), 4#L110true, Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 11#thread1EXITtrue, 13#L74true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,141 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-26 10:49:16,141 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-26 10:49:16,141 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 10:49:16,141 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 10:49:16,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 37#thread2EXITtrue, 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 16#L56true, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 4#L110true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), 638#true, Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,165 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-26 10:49:16,166 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-26 10:49:16,166 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 10:49:16,166 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 10:49:16,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 30#L144-1true, 370#true, 20#L92true, 2#thread4EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 13#L74true, 11#thread1EXITtrue, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,192 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-26 10:49:16,192 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 10:49:16,192 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 10:49:16,192 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 10:49:16,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 30#L144-1true, 370#true, 20#L92true, 37#thread2EXITtrue, 2#thread4EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 16#L56true, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,209 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-26 10:49:16,209 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 10:49:16,209 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 10:49:16,209 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 10:49:16,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 30#L144-1true, 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 4#L110true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 13#L74true, 11#thread1EXITtrue, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,392 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-26 10:49:16,392 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 10:49:16,392 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:49:16,393 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 10:49:16,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 30#L144-1true, 37#thread2EXITtrue, 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 16#L56true, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 4#L110true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,420 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-26 10:49:16,420 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:49:16,421 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 10:49:16,421 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 10:49:16,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, 2#thread4EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 5#L144-2true, Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 13#L74true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,453 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-26 10:49:16,453 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 10:49:16,453 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 10:49:16,453 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 10:49:16,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 37#thread2EXITtrue, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 11#thread1EXITtrue, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,457 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-26 10:49:16,457 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 10:49:16,457 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 10:49:16,458 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 10:49:16,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 5#L144-2true, Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), 4#L110true, Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 13#L74true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,504 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-26 10:49:16,504 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:49:16,505 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 10:49:16,505 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 10:49:16,516 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 4#L110true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 11#thread1EXITtrue, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,516 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-26 10:49:16,516 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 10:49:16,516 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:49:16,516 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 10:49:16,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 30#L144-1true, 37#thread2EXITtrue, 370#true, 20#L92true, 2#thread4EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 11#thread1EXITtrue, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,540 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-26 10:49:16,540 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 10:49:16,540 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-26 10:49:16,540 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 10:49:16,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, 2#thread4EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 51#L145-1true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 13#L74true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,541 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-26 10:49:16,541 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-26 10:49:16,542 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 10:49:16,542 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 10:49:16,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 30#L144-1true, 370#true, 20#L92true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 4#L110true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 11#thread1EXITtrue, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,568 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-26 10:49:16,568 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 10:49:16,568 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 10:49:16,568 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 10:49:16,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), 51#L145-1true, Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 4#L110true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 13#L74true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,572 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-26 10:49:16,572 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 10:49:16,572 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 10:49:16,573 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 10:49:16,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 37#thread2EXITtrue, 370#true, 20#L92true, 2#thread4EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 5#L144-2true, Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,604 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-26 10:49:16,604 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-26 10:49:16,604 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 10:49:16,604 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 10:49:16,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 37#thread2EXITtrue, 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 5#L144-2true, Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 4#L110true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,623 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-26 10:49:16,623 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 10:49:16,623 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 10:49:16,623 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 10:49:16,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 37#thread2EXITtrue, 370#true, 20#L92true, 2#thread4EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 51#L145-1true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,642 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-26 10:49:16,643 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 10:49:16,643 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-26 10:49:16,643 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 10:49:16,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 37#thread2EXITtrue, 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 51#L145-1true, 4#L110true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,655 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-26 10:49:16,655 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-26 10:49:16,655 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 10:49:16,655 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 10:49:16,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, 2#thread4EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 39#L145-2true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,671 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-26 10:49:16,671 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 10:49:16,671 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-26 10:49:16,671 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-26 10:49:16,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 4#L110true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 39#L145-2true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,683 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-26 10:49:16,683 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 10:49:16,683 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 10:49:16,684 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-26 10:49:16,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, 2#thread4EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 638#true, 19#L146-1true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,694 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-26 10:49:16,694 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-26 10:49:16,695 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-26 10:49:16,695 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 10:49:16,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 92#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 370#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 80#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 97#true, Black: 346#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 338#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 104#(<= 1 ~total~0), Black: 364#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), 4#L110true, Black: 75#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 74#(<= ~q1_front~0 ~q1_back~0), 638#true, Black: 78#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 19#L146-1true, Black: 374#(and (or (= ~total~0 0) (< 0 ~q1_back~0)) (or (< ~q1_back~0 1) (and (<= 0 ~total~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 379#(<= 1 ~total~0)]) [2023-11-26 10:49:16,701 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-26 10:49:16,701 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-26 10:49:16,702 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 10:49:16,702 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 10:49:16,724 INFO L124 PetriNetUnfolderBase]: 13409/21462 cut-off events. [2023-11-26 10:49:16,724 INFO L125 PetriNetUnfolderBase]: For 90036/92286 co-relation queries the response was YES. [2023-11-26 10:49:16,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69774 conditions, 21462 events. 13409/21462 cut-off events. For 90036/92286 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 167841 event pairs, 3393 based on Foata normal form. 2232/22808 useless extension candidates. Maximal degree in co-relation 48052. Up to 11143 conditions per place. [2023-11-26 10:49:16,987 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 144 selfloop transitions, 9 changer transitions 0/175 dead transitions. [2023-11-26 10:49:16,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 175 transitions, 1714 flow [2023-11-26 10:49:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:49:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:49:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-26 10:49:16,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.738562091503268 [2023-11-26 10:49:16,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-26 10:49:16,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-26 10:49:16,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:16,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-26 10:49:16,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:16,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:16,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:16,991 INFO L175 Difference]: Start difference. First operand has 94 places, 121 transitions, 901 flow. Second operand 3 states and 113 transitions. [2023-11-26 10:49:16,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 175 transitions, 1714 flow [2023-11-26 10:49:17,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 175 transitions, 1687 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-11-26 10:49:17,128 INFO L231 Difference]: Finished difference. Result has 95 places, 122 transitions, 939 flow [2023-11-26 10:49:17,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=939, PETRI_PLACES=95, PETRI_TRANSITIONS=122} [2023-11-26 10:49:17,129 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2023-11-26 10:49:17,130 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 122 transitions, 939 flow [2023-11-26 10:49:17,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:17,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:17,130 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:17,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:49:17,131 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 10:49:17,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1513655636, now seen corresponding path program 2 times [2023-11-26 10:49:17,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:17,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157098239] [2023-11-26 10:49:17,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:17,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 10:49:17,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:17,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157098239] [2023-11-26 10:49:17,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157098239] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:17,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538684727] [2023-11-26 10:49:17,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 10:49:17,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:17,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:17,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:17,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 10:49:17,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 10:49:17,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 10:49:17,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:49:17,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 10:49:17,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 10:49:17,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538684727] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:49:17,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:49:17,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2023-11-26 10:49:17,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140772153] [2023-11-26 10:49:17,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:17,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:49:17,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:17,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:49:17,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:49:17,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2023-11-26 10:49:17,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 122 transitions, 939 flow. Second operand has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:17,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:17,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2023-11-26 10:49:17,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:23,442 INFO L124 PetriNetUnfolderBase]: 21337/34618 cut-off events. [2023-11-26 10:49:23,443 INFO L125 PetriNetUnfolderBase]: For 124647/127019 co-relation queries the response was YES. [2023-11-26 10:49:23,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116105 conditions, 34618 events. 21337/34618 cut-off events. For 124647/127019 co-relation queries the response was YES. Maximal size of possible extension queue 1798. Compared 300214 event pairs, 3743 based on Foata normal form. 1938/35215 useless extension candidates. Maximal degree in co-relation 116069. Up to 14987 conditions per place. [2023-11-26 10:49:24,057 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 137 selfloop transitions, 43 changer transitions 0/202 dead transitions. [2023-11-26 10:49:24,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 202 transitions, 1849 flow [2023-11-26 10:49:24,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:49:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 10:49:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2023-11-26 10:49:24,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7794117647058824 [2023-11-26 10:49:24,059 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 159 transitions. [2023-11-26 10:49:24,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 159 transitions. [2023-11-26 10:49:24,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:24,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 159 transitions. [2023-11-26 10:49:24,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:24,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:24,062 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:24,062 INFO L175 Difference]: Start difference. First operand has 95 places, 122 transitions, 939 flow. Second operand 4 states and 159 transitions. [2023-11-26 10:49:24,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 202 transitions, 1849 flow [2023-11-26 10:49:24,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 202 transitions, 1838 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:49:24,633 INFO L231 Difference]: Finished difference. Result has 99 places, 145 transitions, 1435 flow [2023-11-26 10:49:24,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1435, PETRI_PLACES=99, PETRI_TRANSITIONS=145} [2023-11-26 10:49:24,634 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2023-11-26 10:49:24,634 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 145 transitions, 1435 flow [2023-11-26 10:49:24,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:24,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:24,635 INFO L208 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, 1, 1, 1, 1] [2023-11-26 10:49:24,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-26 10:49:24,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:24,842 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 10:49:24,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash 232277528, now seen corresponding path program 1 times [2023-11-26 10:49:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:24,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415635717] [2023-11-26 10:49:24,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:24,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:25,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 10:49:25,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:25,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415635717] [2023-11-26 10:49:25,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415635717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:25,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:25,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:49:25,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660829446] [2023-11-26 10:49:25,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:25,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:49:25,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:25,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:49:25,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:49:25,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2023-11-26 10:49:25,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 145 transitions, 1435 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:25,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:25,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2023-11-26 10:49:25,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:32,352 INFO L124 PetriNetUnfolderBase]: 25082/40926 cut-off events. [2023-11-26 10:49:32,352 INFO L125 PetriNetUnfolderBase]: For 229371/232651 co-relation queries the response was YES. [2023-11-26 10:49:32,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149614 conditions, 40926 events. 25082/40926 cut-off events. For 229371/232651 co-relation queries the response was YES. Maximal size of possible extension queue 2134. Compared 368750 event pairs, 16503 based on Foata normal form. 3708/42210 useless extension candidates. Maximal degree in co-relation 139045. Up to 23124 conditions per place. [2023-11-26 10:49:32,990 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 150 selfloop transitions, 11 changer transitions 15/198 dead transitions. [2023-11-26 10:49:32,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 198 transitions, 2362 flow [2023-11-26 10:49:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:49:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 10:49:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2023-11-26 10:49:32,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2023-11-26 10:49:32,993 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 138 transitions. [2023-11-26 10:49:32,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 138 transitions. [2023-11-26 10:49:32,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:32,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 138 transitions. [2023-11-26 10:49:32,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:32,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:32,997 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:32,999 INFO L175 Difference]: Start difference. First operand has 99 places, 145 transitions, 1435 flow. Second operand 4 states and 138 transitions. [2023-11-26 10:49:32,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 198 transitions, 2362 flow [2023-11-26 10:49:33,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 198 transitions, 2347 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-26 10:49:33,261 INFO L231 Difference]: Finished difference. Result has 103 places, 141 transitions, 1428 flow [2023-11-26 10:49:33,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1428, PETRI_PLACES=103, PETRI_TRANSITIONS=141} [2023-11-26 10:49:33,263 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 50 predicate places. [2023-11-26 10:49:33,263 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 141 transitions, 1428 flow [2023-11-26 10:49:33,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:33,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:33,264 INFO L208 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, 1, 1, 1, 1, 1] [2023-11-26 10:49:33,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:49:33,264 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 10:49:33,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:33,265 INFO L85 PathProgramCache]: Analyzing trace with hash 576845887, now seen corresponding path program 1 times [2023-11-26 10:49:33,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:33,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769714804] [2023-11-26 10:49:33,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:33,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 10:49:33,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:33,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769714804] [2023-11-26 10:49:33,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769714804] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:33,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942439680] [2023-11-26 10:49:33,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:33,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:33,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:33,966 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:33,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8073fce3-2879-480f-9ce5-d09af8fa971a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 10:49:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:34,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-26 10:49:34,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 10:49:34,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-26 10:49:35,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942439680] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:49:35,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:49:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 11] total 25 [2023-11-26 10:49:35,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580155760] [2023-11-26 10:49:35,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:35,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-26 10:49:35,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:35,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-26 10:49:35,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2023-11-26 10:49:35,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2023-11-26 10:49:35,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 141 transitions, 1428 flow. Second operand has 26 states, 26 states have (on average 12.576923076923077) internal successors, (327), 26 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:35,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:35,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2023-11-26 10:49:35,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand