./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version 6497de01
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 00:34:19,613 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 00:34:19,718 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-24 00:34:19,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 00:34:19,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 00:34:19,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 00:34:19,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 00:34:19,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 00:34:19,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 00:34:19,780 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-24 00:34:19,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 00:34:19,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 00:34:19,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 00:34:19,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 00:34:19,783 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 00:34:19,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 00:34:19,783 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 00:34:19,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 00:34:19,784 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 00:34:19,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 00:34:19,784 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-24 00:34:19,784 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-24 00:34:19,784 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-24 00:34:19,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 00:34:19,785 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-24 00:34:19,785 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-24 00:34:19,785 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 00:34:19,785 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 00:34:19,785 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 00:34:19,785 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 00:34:19,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:34:19,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:34:19,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:34:19,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:34:19,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 00:34:19,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:34:19,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:34:19,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:34:19,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:34:19,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 00:34:19,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 00:34:19,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-24 00:34:19,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-24 00:34:19,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 00:34:19,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 00:34:19,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 00:34:19,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 00:34:19,789 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC
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 valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
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 -> e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe
[2024-11-24 00:34:20,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 00:34:20,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 00:34:20,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 00:34:20,161 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 00:34:20,162 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 00:34:20,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c
[2024-11-24 00:34:23,172 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/data/c46ebe436/8d9b8d9f42dd4fe2960eda3b39d17734/FLAG17896ed8f
[2024-11-24 00:34:23,474 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 00:34:23,479 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c
[2024-11-24 00:34:23,499 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/data/c46ebe436/8d9b8d9f42dd4fe2960eda3b39d17734/FLAG17896ed8f
[2024-11-24 00:34:23,525 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/data/c46ebe436/8d9b8d9f42dd4fe2960eda3b39d17734
[2024-11-24 00:34:23,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 00:34:23,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 00:34:23,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 00:34:23,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 00:34:23,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 00:34:23,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:23,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454fb1bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23, skipping insertion in model container
[2024-11-24 00:34:23,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:23,573 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 00:34:23,838 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-24 00:34:23,852 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:34:23,860 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 00:34:23,893 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:34:23,913 INFO L204 MainTranslator]: Completed translation
[2024-11-24 00:34:23,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23 WrapperNode
[2024-11-24 00:34:23,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 00:34:23,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 00:34:23,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 00:34:23,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 00:34:23,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:23,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:23,973 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 292
[2024-11-24 00:34:23,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 00:34:23,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 00:34:23,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 00:34:23,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 00:34:23,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:23,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:23,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:24,032 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2].
[2024-11-24 00:34:24,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:24,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:24,044 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:24,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:24,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:24,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:24,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:24,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 00:34:24,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 00:34:24,059 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 00:34:24,059 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 00:34:24,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (1/1) ...
[2024-11-24 00:34:24,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:34:24,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:34:24,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 00:34:24,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 00:34:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 00:34:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-24 00:34:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-24 00:34:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-24 00:34:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-24 00:34:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread1
[2024-11-24 00:34:24,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1
[2024-11-24 00:34:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread2
[2024-11-24 00:34:24,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2
[2024-11-24 00:34:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread3
[2024-11-24 00:34:24,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3
[2024-11-24 00:34:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread4
[2024-11-24 00:34:24,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4
[2024-11-24 00:34:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-24 00:34:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-24 00:34:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-24 00:34:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-24 00:34:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-24 00:34:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 00:34:24,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 00:34:24,142 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-24 00:34:24,309 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 00:34:24,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 00:34:24,913 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-24 00:34:24,913 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 00:34:25,423 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 00:34:25,424 INFO L312 CfgBuilder]: Removed 6 assume(true) statements.
[2024-11-24 00:34:25,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:34:25 BoogieIcfgContainer
[2024-11-24 00:34:25,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 00:34:25,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 00:34:25,429 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 00:34:25,434 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 00:34:25,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:34:23" (1/3) ...
[2024-11-24 00:34:25,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4842602e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:34:25, skipping insertion in model container
[2024-11-24 00:34:25,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:23" (2/3) ...
[2024-11-24 00:34:25,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4842602e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:34:25, skipping insertion in model container
[2024-11-24 00:34:25,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:34:25" (3/3) ...
[2024-11-24 00:34:25,438 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c
[2024-11-24 00:34:25,458 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 00:34:25,460 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations.
[2024-11-24 00:34:25,460 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-24 00:34:25,578 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-11-24 00:34:25,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow
[2024-11-24 00:34:25,722 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events.
[2024-11-24 00:34:25,725 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-11-24 00:34:25,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 156 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place.
[2024-11-24 00:34:25,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow
[2024-11-24 00:34:25,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow
[2024-11-24 00:34:25,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 00:34:25,771 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@7b022005, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 00:34:25,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations.
[2024-11-24 00:34:25,778 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 00:34:25,778 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events.
[2024-11-24 00:34:25,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:34:25,779 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:25,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-11-24 00:34:25,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:25,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:25,788 INFO L85 PathProgramCache]: Analyzing trace with hash 854427, now seen corresponding path program 1 times
[2024-11-24 00:34:25,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:25,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957878491]
[2024-11-24 00:34:25,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:25,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:34:26,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957878491]
[2024-11-24 00:34:26,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957878491] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:26,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:34:26,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 00:34:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389407948]
[2024-11-24 00:34:26,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:26,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 00:34:26,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:26,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 00:34:26,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 00:34:26,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66
[2024-11-24 00:34:26,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:26,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:26,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66
[2024-11-24 00:34:26,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:28,664 INFO L124 PetriNetUnfolderBase]: 9651/13134 cut-off events.
[2024-11-24 00:34:28,664 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES.
[2024-11-24 00:34:28,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25668 conditions, 13134 events. 9651/13134 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82850 event pairs, 6408 based on Foata normal form. 1/7359 useless extension candidates. Maximal degree in co-relation 24078. Up to 11896 conditions per place.
[2024-11-24 00:34:28,824 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/57 dead transitions.
[2024-11-24 00:34:28,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 214 flow
[2024-11-24 00:34:28,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 00:34:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 00:34:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions.
[2024-11-24 00:34:28,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707
[2024-11-24 00:34:28,847 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 113 transitions.
[2024-11-24 00:34:28,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 214 flow
[2024-11-24 00:34:28,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 8 redundant places.
[2024-11-24 00:34:28,947 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow
[2024-11-24 00:34:28,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57}
[2024-11-24 00:34:28,953 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places.
[2024-11-24 00:34:28,954 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow
[2024-11-24 00:34:28,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:28,954 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:28,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-11-24 00:34:28,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-24 00:34:28,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:28,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash 854428, now seen corresponding path program 1 times
[2024-11-24 00:34:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031517881]
[2024-11-24 00:34:28,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:28,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:34:29,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:29,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031517881]
[2024-11-24 00:34:29,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031517881] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:29,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:34:29,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 00:34:29,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096393329]
[2024-11-24 00:34:29,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:29,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 00:34:29,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:29,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 00:34:29,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 00:34:29,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66
[2024-11-24 00:34:29,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:29,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:29,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66
[2024-11-24 00:34:29,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:31,321 INFO L124 PetriNetUnfolderBase]: 9652/13137 cut-off events.
[2024-11-24 00:34:31,322 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:34:31,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25271 conditions, 13137 events. 9652/13137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82611 event pairs, 6408 based on Foata normal form. 0/7359 useless extension candidates. Maximal degree in co-relation 25242. Up to 11905 conditions per place.
[2024-11-24 00:34:31,451 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 39 selfloop transitions, 4 changer transitions 0/60 dead transitions.
[2024-11-24 00:34:31,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 218 flow
[2024-11-24 00:34:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 00:34:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 00:34:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions.
[2024-11-24 00:34:31,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303
[2024-11-24 00:34:31,454 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 140 transitions.
[2024-11-24 00:34:31,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 218 flow
[2024-11-24 00:34:31,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 00:34:31,457 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow
[2024-11-24 00:34:31,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=60}
[2024-11-24 00:34:31,458 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places.
[2024-11-24 00:34:31,459 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow
[2024-11-24 00:34:31,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:31,459 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:31,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-24 00:34:31,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-24 00:34:31,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:31,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:31,460 INFO L85 PathProgramCache]: Analyzing trace with hash 26488923, now seen corresponding path program 1 times
[2024-11-24 00:34:31,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:31,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990171631]
[2024-11-24 00:34:31,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:31,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:34:31,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:31,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990171631]
[2024-11-24 00:34:31,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990171631] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:31,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:34:31,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 00:34:31,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444423089]
[2024-11-24 00:34:31,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:31,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 00:34:31,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:31,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 00:34:31,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-24 00:34:31,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66
[2024-11-24 00:34:31,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:31,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:31,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66
[2024-11-24 00:34:31,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:33,584 INFO L124 PetriNetUnfolderBase]: 9653/13140 cut-off events.
[2024-11-24 00:34:33,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:34:33,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25288 conditions, 13140 events. 9653/13140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82879 event pairs, 6408 based on Foata normal form. 0/7361 useless extension candidates. Maximal degree in co-relation 25263. Up to 11904 conditions per place.
[2024-11-24 00:34:33,681 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions.
[2024-11-24 00:34:33,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 247 flow
[2024-11-24 00:34:33,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 00:34:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 00:34:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions.
[2024-11-24 00:34:33,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060606060606061
[2024-11-24 00:34:33,686 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 167 transitions.
[2024-11-24 00:34:33,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 247 flow
[2024-11-24 00:34:33,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 00:34:33,690 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow
[2024-11-24 00:34:33,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=63}
[2024-11-24 00:34:33,692 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places.
[2024-11-24 00:34:33,693 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow
[2024-11-24 00:34:33,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:33,693 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:33,694 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1]
[2024-11-24 00:34:33,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-24 00:34:33,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:33,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:33,695 INFO L85 PathProgramCache]: Analyzing trace with hash 821133276, now seen corresponding path program 1 times
[2024-11-24 00:34:33,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:33,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000582655]
[2024-11-24 00:34:33,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:34:34,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:34,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000582655]
[2024-11-24 00:34:34,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000582655] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-24 00:34:34,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503024834]
[2024-11-24 00:34:34,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:34,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:34:34,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:34:34,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:34:34,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-24 00:34:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:34,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 22 conjuncts are in the unsatisfiable core
[2024-11-24 00:34:34,172 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:34:34,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2024-11-24 00:34:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:34:34,554 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-24 00:34:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:34:34,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503024834] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-24 00:34:34,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-24 00:34:34,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9
[2024-11-24 00:34:34,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634337250]
[2024-11-24 00:34:34,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-24 00:34:34,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-24 00:34:34,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:34,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-24 00:34:34,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110
[2024-11-24 00:34:34,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66
[2024-11-24 00:34:34,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:34,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:34,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66
[2024-11-24 00:34:34,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:36,856 INFO L124 PetriNetUnfolderBase]: 9653/13139 cut-off events.
[2024-11-24 00:34:36,856 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-11-24 00:34:36,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25301 conditions, 13139 events. 9653/13139 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82893 event pairs, 6408 based on Foata normal form. 0/7363 useless extension candidates. Maximal degree in co-relation 25273. Up to 11903 conditions per place.
[2024-11-24 00:34:36,957 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 37 selfloop transitions, 8 changer transitions 0/62 dead transitions.
[2024-11-24 00:34:36,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 62 transitions, 269 flow
[2024-11-24 00:34:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 00:34:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 00:34:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions.
[2024-11-24 00:34:36,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45670995670995673
[2024-11-24 00:34:36,960 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 7 states and 211 transitions.
[2024-11-24 00:34:36,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 62 transitions, 269 flow
[2024-11-24 00:34:36,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 62 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 00:34:36,962 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 194 flow
[2024-11-24 00:34:36,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=70, PETRI_TRANSITIONS=62}
[2024-11-24 00:34:36,964 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 2 predicate places.
[2024-11-24 00:34:36,964 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 194 flow
[2024-11-24 00:34:36,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:36,964 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:36,965 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2024-11-24 00:34:36,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-24 00:34:37,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:34:37,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:37,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:37,170 INFO L85 PathProgramCache]: Analyzing trace with hash -313921946, now seen corresponding path program 1 times
[2024-11-24 00:34:37,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:37,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449112928]
[2024-11-24 00:34:37,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:37,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:34:37,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:37,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449112928]
[2024-11-24 00:34:37,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449112928] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-24 00:34:37,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531792166]
[2024-11-24 00:34:37,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:37,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:34:37,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:34:37,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:34:37,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-24 00:34:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:37,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-24 00:34:37,690 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:34:37,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2024-11-24 00:34:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:34:37,938 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-24 00:34:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:34:38,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531792166] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-24 00:34:38,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-24 00:34:38,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11
[2024-11-24 00:34:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318217989]
[2024-11-24 00:34:38,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-24 00:34:38,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-11-24 00:34:38,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:38,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-11-24 00:34:38,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156
[2024-11-24 00:34:38,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66
[2024-11-24 00:34:38,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 194 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:38,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:38,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66
[2024-11-24 00:34:38,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:40,032 INFO L124 PetriNetUnfolderBase]: 9655/13144 cut-off events.
[2024-11-24 00:34:40,032 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES.
[2024-11-24 00:34:40,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25327 conditions, 13144 events. 9655/13144 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82773 event pairs, 6408 based on Foata normal form. 2/7370 useless extension candidates. Maximal degree in co-relation 25281. Up to 11897 conditions per place.
[2024-11-24 00:34:40,102 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 32 selfloop transitions, 18 changer transitions 0/67 dead transitions.
[2024-11-24 00:34:40,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 321 flow
[2024-11-24 00:34:40,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-24 00:34:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-24 00:34:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 268 transitions.
[2024-11-24 00:34:40,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4511784511784512
[2024-11-24 00:34:40,105 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 194 flow. Second operand 9 states and 268 transitions.
[2024-11-24 00:34:40,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 321 flow
[2024-11-24 00:34:40,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 274 flow, removed 6 selfloop flow, removed 8 redundant places.
[2024-11-24 00:34:40,108 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 210 flow
[2024-11-24 00:34:40,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=68, PETRI_TRANSITIONS=67}
[2024-11-24 00:34:40,109 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places.
[2024-11-24 00:34:40,109 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 210 flow
[2024-11-24 00:34:40,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:40,110 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:40,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:34:40,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-24 00:34:40,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:34:40,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:40,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:40,311 INFO L85 PathProgramCache]: Analyzing trace with hash -956672402, now seen corresponding path program 1 times
[2024-11-24 00:34:40,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:40,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737171977]
[2024-11-24 00:34:40,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:40,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:34:40,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:40,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737171977]
[2024-11-24 00:34:40,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737171977] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:40,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:34:40,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 00:34:40,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599245911]
[2024-11-24 00:34:40,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:40,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 00:34:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:40,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 00:34:40,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 00:34:40,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66
[2024-11-24 00:34:40,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 210 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)
[2024-11-24 00:34:40,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:40,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66
[2024-11-24 00:34:40,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:41,556 INFO L124 PetriNetUnfolderBase]: 10699/14748 cut-off events.
[2024-11-24 00:34:41,556 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-11-24 00:34:41,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28403 conditions, 14748 events. 10699/14748 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 96138 event pairs, 7188 based on Foata normal form. 311/8999 useless extension candidates. Maximal degree in co-relation 25266. Up to 11911 conditions per place.
[2024-11-24 00:34:41,634 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 78 selfloop transitions, 5 changer transitions 0/100 dead transitions.
[2024-11-24 00:34:41,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 488 flow
[2024-11-24 00:34:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 00:34:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 00:34:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions.
[2024-11-24 00:34:41,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273
[2024-11-24 00:34:41,637 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 210 flow. Second operand 5 states and 207 transitions.
[2024-11-24 00:34:41,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 488 flow
[2024-11-24 00:34:41,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 435 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-11-24 00:34:41,639 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 216 flow
[2024-11-24 00:34:41,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=69, PETRI_TRANSITIONS=69}
[2024-11-24 00:34:41,640 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places.
[2024-11-24 00:34:41,640 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 216 flow
[2024-11-24 00:34:41,640 INFO L472 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)
[2024-11-24 00:34:41,640 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:41,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:34:41,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-24 00:34:41,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:41,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:41,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1302710318, now seen corresponding path program 1 times
[2024-11-24 00:34:41,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:41,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958294655]
[2024-11-24 00:34:41,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:41,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-24 00:34:41,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:41,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958294655]
[2024-11-24 00:34:41,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958294655] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:41,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:34:41,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 00:34:41,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515255685]
[2024-11-24 00:34:41,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:41,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 00:34:41,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:41,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 00:34:41,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 00:34:41,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66
[2024-11-24 00:34:41,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:41,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:41,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66
[2024-11-24 00:34:41,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:42,888 INFO L124 PetriNetUnfolderBase]: 7342/10482 cut-off events.
[2024-11-24 00:34:42,889 INFO L125 PetriNetUnfolderBase]: For 990/990 co-relation queries the response was YES.
[2024-11-24 00:34:42,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21999 conditions, 10482 events. 7342/10482 cut-off events. For 990/990 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 69657 event pairs, 5000 based on Foata normal form. 0/6429 useless extension candidates. Maximal degree in co-relation 18902. Up to 9263 conditions per place.
[2024-11-24 00:34:42,937 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 42 selfloop transitions, 8 changer transitions 0/67 dead transitions.
[2024-11-24 00:34:42,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 67 transitions, 308 flow
[2024-11-24 00:34:42,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 00:34:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 00:34:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions.
[2024-11-24 00:34:42,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876
[2024-11-24 00:34:42,938 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 216 flow. Second operand 5 states and 158 transitions.
[2024-11-24 00:34:42,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 67 transitions, 308 flow
[2024-11-24 00:34:42,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 00:34:42,943 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 219 flow
[2024-11-24 00:34:42,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=69, PETRI_TRANSITIONS=67}
[2024-11-24 00:34:42,944 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places.
[2024-11-24 00:34:42,944 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 219 flow
[2024-11-24 00:34:42,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:42,945 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:42,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:34:42,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-24 00:34:42,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:42,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1302710319, now seen corresponding path program 1 times
[2024-11-24 00:34:42,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:42,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017047397]
[2024-11-24 00:34:42,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:42,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-24 00:34:43,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:43,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017047397]
[2024-11-24 00:34:43,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017047397] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-24 00:34:43,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866696403]
[2024-11-24 00:34:43,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:43,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:34:43,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:34:43,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:34:43,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-24 00:34:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:43,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core
[2024-11-24 00:34:43,304 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:34:43,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-11-24 00:34:43,403 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 00:34:43,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13
[2024-11-24 00:34:43,429 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-24 00:34:43,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-11-24 00:34:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-24 00:34:43,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:34:43,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866696403] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:43,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-24 00:34:43,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6
[2024-11-24 00:34:43,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011700532]
[2024-11-24 00:34:43,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:43,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 00:34:43,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:43,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 00:34:43,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-11-24 00:34:43,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66
[2024-11-24 00:34:43,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:43,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:43,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66
[2024-11-24 00:34:43,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:44,176 INFO L124 PetriNetUnfolderBase]: 4700/7088 cut-off events.
[2024-11-24 00:34:44,176 INFO L125 PetriNetUnfolderBase]: For 779/779 co-relation queries the response was YES.
[2024-11-24 00:34:44,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14118 conditions, 7088 events. 4700/7088 cut-off events. For 779/779 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 47478 event pairs, 3256 based on Foata normal form. 0/5137 useless extension candidates. Maximal degree in co-relation 10966. Up to 6052 conditions per place.
[2024-11-24 00:34:44,208 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 44 selfloop transitions, 4 changer transitions 0/65 dead transitions.
[2024-11-24 00:34:44,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 307 flow
[2024-11-24 00:34:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 00:34:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 00:34:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions.
[2024-11-24 00:34:44,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5
[2024-11-24 00:34:44,210 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 219 flow. Second operand 4 states and 132 transitions.
[2024-11-24 00:34:44,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 307 flow
[2024-11-24 00:34:44,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 295 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-24 00:34:44,212 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 207 flow
[2024-11-24 00:34:44,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=67, PETRI_TRANSITIONS=65}
[2024-11-24 00:34:44,213 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places.
[2024-11-24 00:34:44,213 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 207 flow
[2024-11-24 00:34:44,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:44,213 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:44,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:34:44,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-24 00:34:44,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:34:44,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:44,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1547564026, now seen corresponding path program 1 times
[2024-11-24 00:34:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:44,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678640478]
[2024-11-24 00:34:44,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:44,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-24 00:34:44,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:44,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678640478]
[2024-11-24 00:34:44,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678640478] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:44,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:34:44,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 00:34:44,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713877844]
[2024-11-24 00:34:44,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:44,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 00:34:44,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:44,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 00:34:44,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 00:34:44,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66
[2024-11-24 00:34:44,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:44,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:44,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66
[2024-11-24 00:34:44,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:45,002 INFO L124 PetriNetUnfolderBase]: 3157/4788 cut-off events.
[2024-11-24 00:34:45,003 INFO L125 PetriNetUnfolderBase]: For 545/545 co-relation queries the response was YES.
[2024-11-24 00:34:45,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9613 conditions, 4788 events. 3157/4788 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 30817 event pairs, 2196 based on Foata normal form. 0/3596 useless extension candidates. Maximal degree in co-relation 7451. Up to 4089 conditions per place.
[2024-11-24 00:34:45,036 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 41 selfloop transitions, 5 changer transitions 0/63 dead transitions.
[2024-11-24 00:34:45,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 295 flow
[2024-11-24 00:34:45,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 00:34:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 00:34:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions.
[2024-11-24 00:34:45,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243
[2024-11-24 00:34:45,038 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 207 flow. Second operand 4 states and 130 transitions.
[2024-11-24 00:34:45,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 295 flow
[2024-11-24 00:34:45,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 00:34:45,041 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 208 flow
[2024-11-24 00:34:45,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=66, PETRI_TRANSITIONS=63}
[2024-11-24 00:34:45,045 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places.
[2024-11-24 00:34:45,046 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 208 flow
[2024-11-24 00:34:45,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:45,046 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:45,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:34:45,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-24 00:34:45,047 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:45,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1547564025, now seen corresponding path program 1 times
[2024-11-24 00:34:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:45,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278308307]
[2024-11-24 00:34:45,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:45,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-24 00:34:45,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:45,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278308307]
[2024-11-24 00:34:45,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278308307] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:45,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:34:45,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 00:34:45,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462342057]
[2024-11-24 00:34:45,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:45,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 00:34:45,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:45,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 00:34:45,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 00:34:45,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66
[2024-11-24 00:34:45,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:45,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:45,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66
[2024-11-24 00:34:45,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:45,758 INFO L124 PetriNetUnfolderBase]: 3672/5904 cut-off events.
[2024-11-24 00:34:45,758 INFO L125 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES.
[2024-11-24 00:34:45,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11700 conditions, 5904 events. 3672/5904 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 41381 event pairs, 2627 based on Foata normal form. 134/4946 useless extension candidates. Maximal degree in co-relation 9122. Up to 4102 conditions per place.
[2024-11-24 00:34:45,788 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 59 selfloop transitions, 7 changer transitions 0/83 dead transitions.
[2024-11-24 00:34:45,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 392 flow
[2024-11-24 00:34:45,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 00:34:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 00:34:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions.
[2024-11-24 00:34:45,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6174242424242424
[2024-11-24 00:34:45,790 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 208 flow. Second operand 4 states and 163 transitions.
[2024-11-24 00:34:45,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 392 flow
[2024-11-24 00:34:45,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 00:34:45,794 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 226 flow
[2024-11-24 00:34:45,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=68, PETRI_TRANSITIONS=63}
[2024-11-24 00:34:45,795 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places.
[2024-11-24 00:34:45,795 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 226 flow
[2024-11-24 00:34:45,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:45,796 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:45,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:34:45,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-24 00:34:45,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:45,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:45,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1502991826, now seen corresponding path program 1 times
[2024-11-24 00:34:45,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:45,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627539999]
[2024-11-24 00:34:45,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:45,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:46,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-24 00:34:46,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:46,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627539999]
[2024-11-24 00:34:46,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627539999] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-24 00:34:46,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296565660]
[2024-11-24 00:34:46,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:46,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:34:46,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:34:46,075 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:34:46,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-24 00:34:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:46,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-24 00:34:46,187 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:34:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-24 00:34:46,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:34:46,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296565660] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:46,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-24 00:34:46,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7
[2024-11-24 00:34:46,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74251052]
[2024-11-24 00:34:46,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:46,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 00:34:46,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:46,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 00:34:46,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-11-24 00:34:46,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66
[2024-11-24 00:34:46,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:46,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:46,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66
[2024-11-24 00:34:46,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:47,080 INFO L124 PetriNetUnfolderBase]: 2432/4125 cut-off events.
[2024-11-24 00:34:47,081 INFO L125 PetriNetUnfolderBase]: For 957/957 co-relation queries the response was YES.
[2024-11-24 00:34:47,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8602 conditions, 4125 events. 2432/4125 cut-off events. For 957/957 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28893 event pairs, 1773 based on Foata normal form. 0/3634 useless extension candidates. Maximal degree in co-relation 6648. Up to 3294 conditions per place.
[2024-11-24 00:34:47,115 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 37 selfloop transitions, 7 changer transitions 0/61 dead transitions.
[2024-11-24 00:34:47,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 306 flow
[2024-11-24 00:34:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 00:34:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 00:34:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions.
[2024-11-24 00:34:47,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151
[2024-11-24 00:34:47,117 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 226 flow. Second operand 4 states and 136 transitions.
[2024-11-24 00:34:47,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 306 flow
[2024-11-24 00:34:47,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 00:34:47,122 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 227 flow
[2024-11-24 00:34:47,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=68, PETRI_TRANSITIONS=61}
[2024-11-24 00:34:47,123 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places.
[2024-11-24 00:34:47,123 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 227 flow
[2024-11-24 00:34:47,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:47,123 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:47,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:34:47,134 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-24 00:34:47,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2024-11-24 00:34:47,328 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:47,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash -583952937, now seen corresponding path program 1 times
[2024-11-24 00:34:47,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:47,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536909427]
[2024-11-24 00:34:47,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:47,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:34:47,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:47,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536909427]
[2024-11-24 00:34:47,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536909427] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:47,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:34:47,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 00:34:47,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188006348]
[2024-11-24 00:34:47,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:47,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 00:34:47,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:47,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 00:34:47,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 00:34:47,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66
[2024-11-24 00:34:47,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:47,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:47,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66
[2024-11-24 00:34:47,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:48,091 INFO L124 PetriNetUnfolderBase]: 3680/6033 cut-off events.
[2024-11-24 00:34:48,092 INFO L125 PetriNetUnfolderBase]: For 1502/1502 co-relation queries the response was YES.
[2024-11-24 00:34:48,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12694 conditions, 6033 events. 3680/6033 cut-off events. For 1502/1502 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 40707 event pairs, 1008 based on Foata normal form. 4/5667 useless extension candidates. Maximal degree in co-relation 10215. Up to 2879 conditions per place.
[2024-11-24 00:34:48,117 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 56 selfloop transitions, 3 changer transitions 2/78 dead transitions.
[2024-11-24 00:34:48,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 396 flow
[2024-11-24 00:34:48,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 00:34:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 00:34:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions.
[2024-11-24 00:34:48,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364
[2024-11-24 00:34:48,118 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 227 flow. Second operand 3 states and 126 transitions.
[2024-11-24 00:34:48,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 396 flow
[2024-11-24 00:34:48,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 00:34:48,121 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 226 flow
[2024-11-24 00:34:48,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=69, PETRI_TRANSITIONS=62}
[2024-11-24 00:34:48,122 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places.
[2024-11-24 00:34:48,122 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 226 flow
[2024-11-24 00:34:48,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:48,122 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:48,122 INFO L206 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]
[2024-11-24 00:34:48,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-24 00:34:48,122 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:48,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1861360907, now seen corresponding path program 1 times
[2024-11-24 00:34:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:48,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453172282]
[2024-11-24 00:34:48,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-24 00:34:48,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:48,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453172282]
[2024-11-24 00:34:48,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453172282] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:48,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:34:48,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 00:34:48,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154430240]
[2024-11-24 00:34:48,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:48,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 00:34:48,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:48,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 00:34:48,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 00:34:48,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66
[2024-11-24 00:34:48,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:48,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:48,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66
[2024-11-24 00:34:48,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:48,704 INFO L124 PetriNetUnfolderBase]: 3518/5566 cut-off events.
[2024-11-24 00:34:48,704 INFO L125 PetriNetUnfolderBase]: For 3037/3037 co-relation queries the response was YES.
[2024-11-24 00:34:48,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12971 conditions, 5566 events. 3518/5566 cut-off events. For 3037/3037 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 35872 event pairs, 1121 based on Foata normal form. 106/5318 useless extension candidates. Maximal degree in co-relation 10844. Up to 2974 conditions per place.
[2024-11-24 00:34:48,734 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 64 selfloop transitions, 2 changer transitions 0/83 dead transitions.
[2024-11-24 00:34:48,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 83 transitions, 422 flow
[2024-11-24 00:34:48,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 00:34:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 00:34:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions.
[2024-11-24 00:34:48,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515
[2024-11-24 00:34:48,736 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 226 flow. Second operand 3 states and 129 transitions.
[2024-11-24 00:34:48,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 83 transitions, 422 flow
[2024-11-24 00:34:48,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 83 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 00:34:48,740 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 239 flow
[2024-11-24 00:34:48,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=71, PETRI_TRANSITIONS=63}
[2024-11-24 00:34:48,741 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places.
[2024-11-24 00:34:48,741 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 239 flow
[2024-11-24 00:34:48,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:48,742 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:48,742 INFO L206 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]
[2024-11-24 00:34:48,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-24 00:34:48,742 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:48,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:48,743 INFO L85 PathProgramCache]: Analyzing trace with hash 979003430, now seen corresponding path program 1 times
[2024-11-24 00:34:48,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:48,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896407805]
[2024-11-24 00:34:48,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:48,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:48,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-24 00:34:48,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:48,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896407805]
[2024-11-24 00:34:48,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896407805] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:48,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:34:48,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 00:34:48,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105806616]
[2024-11-24 00:34:48,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:48,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 00:34:48,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:48,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 00:34:48,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 00:34:48,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66
[2024-11-24 00:34:48,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:48,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:48,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66
[2024-11-24 00:34:48,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:49,473 INFO L124 PetriNetUnfolderBase]: 3440/5710 cut-off events.
[2024-11-24 00:34:49,474 INFO L125 PetriNetUnfolderBase]: For 4625/4625 co-relation queries the response was YES.
[2024-11-24 00:34:49,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13564 conditions, 5710 events. 3440/5710 cut-off events. For 4625/4625 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 39328 event pairs, 1181 based on Foata normal form. 44/5460 useless extension candidates. Maximal degree in co-relation 11546. Up to 2919 conditions per place.
[2024-11-24 00:34:49,500 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 64 selfloop transitions, 2 changer transitions 0/83 dead transitions.
[2024-11-24 00:34:49,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 83 transitions, 442 flow
[2024-11-24 00:34:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 00:34:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 00:34:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions.
[2024-11-24 00:34:49,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6414141414141414
[2024-11-24 00:34:49,501 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 239 flow. Second operand 3 states and 127 transitions.
[2024-11-24 00:34:49,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 83 transitions, 442 flow
[2024-11-24 00:34:49,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 83 transitions, 427 flow, removed 6 selfloop flow, removed 1 redundant places.
[2024-11-24 00:34:49,505 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 247 flow
[2024-11-24 00:34:49,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=73, PETRI_TRANSITIONS=64}
[2024-11-24 00:34:49,505 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places.
[2024-11-24 00:34:49,505 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 247 flow
[2024-11-24 00:34:49,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:49,506 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:49,506 INFO L206 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]
[2024-11-24 00:34:49,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-24 00:34:49,506 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:49,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:49,507 INFO L85 PathProgramCache]: Analyzing trace with hash -257826715, now seen corresponding path program 1 times
[2024-11-24 00:34:49,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:49,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724612725]
[2024-11-24 00:34:49,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:34:49,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:34:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-24 00:34:49,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724612725]
[2024-11-24 00:34:49,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724612725] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:49,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:34:49,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:34:49,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018915839]
[2024-11-24 00:34:49,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:49,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 00:34:49,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:49,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 00:34:49,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-11-24 00:34:49,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66
[2024-11-24 00:34:49,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:49,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:49,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66
[2024-11-24 00:34:49,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:51,084 INFO L124 PetriNetUnfolderBase]: 9623/14191 cut-off events.
[2024-11-24 00:34:51,084 INFO L125 PetriNetUnfolderBase]: For 8571/8571 co-relation queries the response was YES.
[2024-11-24 00:34:51,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34153 conditions, 14191 events. 9623/14191 cut-off events. For 8571/8571 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 93633 event pairs, 836 based on Foata normal form. 0/13247 useless extension candidates. Maximal degree in co-relation 28463. Up to 10041 conditions per place.
[2024-11-24 00:34:51,156 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 96 selfloop transitions, 7 changer transitions 19/134 dead transitions.
[2024-11-24 00:34:51,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 134 transitions, 713 flow
[2024-11-24 00:34:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 00:34:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 00:34:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions.
[2024-11-24 00:34:51,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758
[2024-11-24 00:34:51,158 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 247 flow. Second operand 6 states and 228 transitions.
[2024-11-24 00:34:51,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 134 transitions, 713 flow
[2024-11-24 00:34:51,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 134 transitions, 690 flow, removed 9 selfloop flow, removed 1 redundant places.
[2024-11-24 00:34:51,164 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 286 flow
[2024-11-24 00:34:51,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=81, PETRI_TRANSITIONS=70}
[2024-11-24 00:34:51,165 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 13 predicate places.
[2024-11-24 00:34:51,165 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 286 flow
[2024-11-24 00:34:51,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:51,165 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:51,165 INFO L206 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]
[2024-11-24 00:34:51,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-24 00:34:51,166 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:51,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:51,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1780923429, now seen corresponding path program 2 times
[2024-11-24 00:34:51,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:51,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285270271]
[2024-11-24 00:34:51,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-24 00:34:51,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:51,197 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-24 00:34:51,198 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:34:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-24 00:34:51,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:51,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285270271]
[2024-11-24 00:34:51,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285270271] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:51,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:34:51,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:34:51,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757760731]
[2024-11-24 00:34:51,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:51,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 00:34:51,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:51,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 00:34:51,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-24 00:34:51,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66
[2024-11-24 00:34:51,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:51,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:51,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66
[2024-11-24 00:34:51,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:53,795 INFO L124 PetriNetUnfolderBase]: 12298/17906 cut-off events.
[2024-11-24 00:34:53,795 INFO L125 PetriNetUnfolderBase]: For 12388/12391 co-relation queries the response was YES.
[2024-11-24 00:34:53,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47483 conditions, 17906 events. 12298/17906 cut-off events. For 12388/12391 co-relation queries the response was YES. Maximal size of possible extension queue 975. Compared 119885 event pairs, 962 based on Foata normal form. 306/18042 useless extension candidates. Maximal degree in co-relation 40300. Up to 7499 conditions per place.
[2024-11-24 00:34:53,897 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 158 selfloop transitions, 23 changer transitions 5/198 dead transitions.
[2024-11-24 00:34:53,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 198 transitions, 1133 flow
[2024-11-24 00:34:53,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-24 00:34:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-24 00:34:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 338 transitions.
[2024-11-24 00:34:53,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.569023569023569
[2024-11-24 00:34:53,899 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 286 flow. Second operand 9 states and 338 transitions.
[2024-11-24 00:34:53,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 198 transitions, 1133 flow
[2024-11-24 00:34:53,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 198 transitions, 1123 flow, removed 5 selfloop flow, removed 1 redundant places.
[2024-11-24 00:34:53,911 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 459 flow
[2024-11-24 00:34:53,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=459, PETRI_PLACES=94, PETRI_TRANSITIONS=87}
[2024-11-24 00:34:53,912 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places.
[2024-11-24 00:34:53,912 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 459 flow
[2024-11-24 00:34:53,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:53,912 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:53,912 INFO L206 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]
[2024-11-24 00:34:53,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-24 00:34:53,912 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:53,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:53,913 INFO L85 PathProgramCache]: Analyzing trace with hash 631706759, now seen corresponding path program 3 times
[2024-11-24 00:34:53,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:53,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212007415]
[2024-11-24 00:34:53,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-24 00:34:53,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:53,944 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-11-24 00:34:53,945 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:34:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-24 00:34:54,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:54,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212007415]
[2024-11-24 00:34:54,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212007415] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:54,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:34:54,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 00:34:54,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174963113]
[2024-11-24 00:34:54,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:54,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:34:54,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:54,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:34:54,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:34:54,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66
[2024-11-24 00:34:54,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:54,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:54,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66
[2024-11-24 00:34:54,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:34:57,087 INFO L124 PetriNetUnfolderBase]: 15997/23186 cut-off events.
[2024-11-24 00:34:57,087 INFO L125 PetriNetUnfolderBase]: For 30719/30719 co-relation queries the response was YES.
[2024-11-24 00:34:57,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71886 conditions, 23186 events. 15997/23186 cut-off events. For 30719/30719 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 161094 event pairs, 1982 based on Foata normal form. 114/23085 useless extension candidates. Maximal degree in co-relation 60260. Up to 8687 conditions per place.
[2024-11-24 00:34:57,237 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 166 selfloop transitions, 31 changer transitions 4/213 dead transitions.
[2024-11-24 00:34:57,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 213 transitions, 1406 flow
[2024-11-24 00:34:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-24 00:34:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-24 00:34:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 309 transitions.
[2024-11-24 00:34:57,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5852272727272727
[2024-11-24 00:34:57,239 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 459 flow. Second operand 8 states and 309 transitions.
[2024-11-24 00:34:57,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 213 transitions, 1406 flow
[2024-11-24 00:34:57,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 213 transitions, 1402 flow, removed 2 selfloop flow, removed 0 redundant places.
[2024-11-24 00:34:57,330 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 707 flow
[2024-11-24 00:34:57,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=707, PETRI_PLACES=106, PETRI_TRANSITIONS=104}
[2024-11-24 00:34:57,331 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 38 predicate places.
[2024-11-24 00:34:57,331 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 707 flow
[2024-11-24 00:34:57,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:57,332 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:34:57,332 INFO L206 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]
[2024-11-24 00:34:57,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-24 00:34:57,332 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:34:57,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:34:57,333 INFO L85 PathProgramCache]: Analyzing trace with hash -975583171, now seen corresponding path program 4 times
[2024-11-24 00:34:57,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:34:57,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705070406]
[2024-11-24 00:34:57,333 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-24 00:34:57,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:34:57,371 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-24 00:34:57,371 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:34:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-24 00:34:57,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:34:57,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705070406]
[2024-11-24 00:34:57,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705070406] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-24 00:34:57,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661422962]
[2024-11-24 00:34:57,976 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-24 00:34:57,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:34:57,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:34:57,979 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:34:57,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-24 00:34:58,123 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-24 00:34:58,124 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:34:58,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-24 00:34:58,128 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:34:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-24 00:34:58,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:34:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661422962] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:34:58,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-24 00:34:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11
[2024-11-24 00:34:58,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023279555]
[2024-11-24 00:34:58,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:34:58,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:34:58,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:34:58,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:34:58,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2024-11-24 00:34:58,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66
[2024-11-24 00:34:58,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 707 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:34:58,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:34:58,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66
[2024-11-24 00:34:58,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:01,604 INFO L124 PetriNetUnfolderBase]: 17305/25558 cut-off events.
[2024-11-24 00:35:01,604 INFO L125 PetriNetUnfolderBase]: For 55029/55134 co-relation queries the response was YES.
[2024-11-24 00:35:01,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87534 conditions, 25558 events. 17305/25558 cut-off events. For 55029/55134 co-relation queries the response was YES. Maximal size of possible extension queue 1479. Compared 184616 event pairs, 3089 based on Foata normal form. 114/25121 useless extension candidates. Maximal degree in co-relation 81607. Up to 10063 conditions per place.
[2024-11-24 00:35:01,813 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 147 selfloop transitions, 36 changer transitions 3/198 dead transitions.
[2024-11-24 00:35:01,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 198 transitions, 1494 flow
[2024-11-24 00:35:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 00:35:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 00:35:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 269 transitions.
[2024-11-24 00:35:01,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822510822510822
[2024-11-24 00:35:01,815 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 707 flow. Second operand 7 states and 269 transitions.
[2024-11-24 00:35:01,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 198 transitions, 1494 flow
[2024-11-24 00:35:02,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 198 transitions, 1472 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-11-24 00:35:02,408 INFO L231 Difference]: Finished difference. Result has 114 places, 110 transitions, 871 flow
[2024-11-24 00:35:02,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=871, PETRI_PLACES=114, PETRI_TRANSITIONS=110}
[2024-11-24 00:35:02,408 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 46 predicate places.
[2024-11-24 00:35:02,409 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 871 flow
[2024-11-24 00:35:02,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:02,409 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:02,409 INFO L206 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]
[2024-11-24 00:35:02,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-24 00:35:02,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8d94d2-596a-41da-b8ca-516b59916d68/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-11-24 00:35:02,609 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:35:02,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:02,610 INFO L85 PathProgramCache]: Analyzing trace with hash -7042677, now seen corresponding path program 5 times
[2024-11-24 00:35:02,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:02,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048391155]
[2024-11-24 00:35:02,611 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-24 00:35:02,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:02,659 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-24 00:35:02,659 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:35:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-24 00:35:03,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:03,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048391155]
[2024-11-24 00:35:03,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048391155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:03,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:03,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 00:35:03,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781440025]
[2024-11-24 00:35:03,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:03,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:35:03,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:03,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:35:03,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:35:03,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 66
[2024-11-24 00:35:03,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 871 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:03,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:03,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 66
[2024-11-24 00:35:03,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:06,911 INFO L124 PetriNetUnfolderBase]: 21173/29964 cut-off events.
[2024-11-24 00:35:06,911 INFO L125 PetriNetUnfolderBase]: For 79335/79335 co-relation queries the response was YES.
[2024-11-24 00:35:07,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108290 conditions, 29964 events. 21173/29964 cut-off events. For 79335/79335 co-relation queries the response was YES. Maximal size of possible extension queue 1713. Compared 205250 event pairs, 3313 based on Foata normal form. 86/29784 useless extension candidates. Maximal degree in co-relation 101842. Up to 23233 conditions per place.
[2024-11-24 00:35:07,109 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 136 selfloop transitions, 22 changer transitions 9/178 dead transitions.
[2024-11-24 00:35:07,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 178 transitions, 1473 flow
[2024-11-24 00:35:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 00:35:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 00:35:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions.
[2024-11-24 00:35:07,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758
[2024-11-24 00:35:07,111 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 871 flow. Second operand 6 states and 228 transitions.
[2024-11-24 00:35:07,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 178 transitions, 1473 flow
[2024-11-24 00:35:08,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 178 transitions, 1438 flow, removed 9 selfloop flow, removed 2 redundant places.
[2024-11-24 00:35:08,493 INFO L231 Difference]: Finished difference. Result has 119 places, 114 transitions, 931 flow
[2024-11-24 00:35:08,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=931, PETRI_PLACES=119, PETRI_TRANSITIONS=114}
[2024-11-24 00:35:08,494 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 51 predicate places.
[2024-11-24 00:35:08,494 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 114 transitions, 931 flow
[2024-11-24 00:35:08,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:08,495 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:08,495 INFO L206 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]
[2024-11-24 00:35:08,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-24 00:35:08,495 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:35:08,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2097460917, now seen corresponding path program 6 times
[2024-11-24 00:35:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:08,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071218677]
[2024-11-24 00:35:08,496 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-24 00:35:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:08,531 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-11-24 00:35:08,531 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:35:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-24 00:35:08,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:08,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071218677]
[2024-11-24 00:35:08,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071218677] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:08,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:08,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 00:35:08,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679637007]
[2024-11-24 00:35:08,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:08,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:35:08,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:08,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:35:08,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:35:08,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66
[2024-11-24 00:35:08,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 114 transitions, 931 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:08,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:08,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66
[2024-11-24 00:35:08,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:16,607 INFO L124 PetriNetUnfolderBase]: 32566/49595 cut-off events.
[2024-11-24 00:35:16,607 INFO L125 PetriNetUnfolderBase]: For 159600/160708 co-relation queries the response was YES.
[2024-11-24 00:35:16,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172125 conditions, 49595 events. 32566/49595 cut-off events. For 159600/160708 co-relation queries the response was YES. Maximal size of possible extension queue 2703. Compared 402034 event pairs, 4259 based on Foata normal form. 1191/50011 useless extension candidates. Maximal degree in co-relation 157794. Up to 13684 conditions per place.
[2024-11-24 00:35:17,056 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 241 selfloop transitions, 61 changer transitions 4/329 dead transitions.
[2024-11-24 00:35:17,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 329 transitions, 3280 flow
[2024-11-24 00:35:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-24 00:35:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-24 00:35:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 351 transitions.
[2024-11-24 00:35:17,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909
[2024-11-24 00:35:17,059 INFO L175 Difference]: Start difference. First operand has 119 places, 114 transitions, 931 flow. Second operand 9 states and 351 transitions.
[2024-11-24 00:35:17,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 329 transitions, 3280 flow
[2024-11-24 00:35:18,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 329 transitions, 3215 flow, removed 6 selfloop flow, removed 2 redundant places.
[2024-11-24 00:35:18,514 INFO L231 Difference]: Finished difference. Result has 131 places, 160 transitions, 1690 flow
[2024-11-24 00:35:18,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1690, PETRI_PLACES=131, PETRI_TRANSITIONS=160}
[2024-11-24 00:35:18,515 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 63 predicate places.
[2024-11-24 00:35:18,515 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 160 transitions, 1690 flow
[2024-11-24 00:35:18,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:18,515 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:18,515 INFO L206 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]
[2024-11-24 00:35:18,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-11-24 00:35:18,515 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:35:18,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:18,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1017132077, now seen corresponding path program 7 times
[2024-11-24 00:35:18,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:18,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34200813]
[2024-11-24 00:35:18,516 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-24 00:35:18,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:35:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-24 00:35:18,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:18,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34200813]
[2024-11-24 00:35:18,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34200813] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:18,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:18,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:35:18,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115415939]
[2024-11-24 00:35:18,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:18,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 00:35:18,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:18,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 00:35:18,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-24 00:35:18,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66
[2024-11-24 00:35:18,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 160 transitions, 1690 flow. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:18,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:18,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66
[2024-11-24 00:35:18,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:35:30,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][284], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), 20#L119true, Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true])
[2024-11-24 00:35:30,672 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,672 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,672 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,673 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][89], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), 20#L119true, Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 43#thread1EXITtrue, 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true])
[2024-11-24 00:35:30,674 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event
[2024-11-24 00:35:30,674 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:30,674 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:30,674 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event
[2024-11-24 00:35:30,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][308], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), 20#L119true, Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true, 55#L80true])
[2024-11-24 00:35:30,674 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event
[2024-11-24 00:35:30,675 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:30,675 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event
[2024-11-24 00:35:30,675 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:30,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][410], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 45#L98true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))])
[2024-11-24 00:35:30,760 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,760 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,760 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,760 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][236], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 45#L98true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 43#thread1EXITtrue, 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))])
[2024-11-24 00:35:30,760 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event
[2024-11-24 00:35:30,760 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:30,760 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:30,760 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event
[2024-11-24 00:35:30,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][411], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 45#L98true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true])
[2024-11-24 00:35:30,761 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event
[2024-11-24 00:35:30,761 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:30,761 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:30,761 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event
[2024-11-24 00:35:30,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][284], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), 20#L119true, Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true])
[2024-11-24 00:35:30,872 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-11-24 00:35:30,872 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:30,872 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:30,872 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event
[2024-11-24 00:35:30,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][89], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), 20#L119true, Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), 43#thread1EXITtrue, Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true])
[2024-11-24 00:35:30,872 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,872 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,872 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,872 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][308], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), 20#L119true, Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true, 55#L80true])
[2024-11-24 00:35:30,873 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,873 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,873 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,873 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][284], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), 41#L111true, Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true])
[2024-11-24 00:35:30,895 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-11-24 00:35:30,895 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:30,895 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:30,895 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event
[2024-11-24 00:35:30,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][89], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), 41#L111true, Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 43#thread1EXITtrue, 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true])
[2024-11-24 00:35:30,896 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,896 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,896 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,896 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][308], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), 41#L111true, Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true, 520#true])
[2024-11-24 00:35:30,896 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,896 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,896 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,896 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][284], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 7#thread4EXITtrue, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true])
[2024-11-24 00:35:30,897 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-11-24 00:35:30,897 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:30,897 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event
[2024-11-24 00:35:30,897 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:30,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][89], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 7#thread4EXITtrue, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 43#thread1EXITtrue, 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true])
[2024-11-24 00:35:30,897 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,897 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,897 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,898 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][308], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 7#thread4EXITtrue, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true, 520#true])
[2024-11-24 00:35:30,898 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,898 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,898 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,898 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][410], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 45#L98true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 301#(= ~q2_back~0 ~q2_front~0), 203#(= (select |#valid| ~q1~0.base) 1), 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))])
[2024-11-24 00:35:30,935 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-11-24 00:35:30,935 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:30,935 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:30,935 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event
[2024-11-24 00:35:30,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][236], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 45#L98true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 43#thread1EXITtrue, Black: 301#(= ~q2_back~0 ~q2_front~0), 203#(= (select |#valid| ~q1~0.base) 1), 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))])
[2024-11-24 00:35:30,935 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,935 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,935 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,935 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][411], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 45#L98true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 301#(= ~q2_back~0 ~q2_front~0), 203#(= (select |#valid| ~q1~0.base) 1), 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true])
[2024-11-24 00:35:30,936 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,936 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,936 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:30,936 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event
[2024-11-24 00:35:30,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][284], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 41#L111true, Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true])
[2024-11-24 00:35:31,000 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event
[2024-11-24 00:35:31,000 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2024-11-24 00:35:31,000 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event
[2024-11-24 00:35:31,000 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2024-11-24 00:35:31,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][89], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 41#L111true, Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), 43#thread1EXITtrue, Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true])
[2024-11-24 00:35:31,000 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-11-24 00:35:31,000 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:31,000 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:31,000 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event
[2024-11-24 00:35:31,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][308], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 41#L111true, Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true, 520#true])
[2024-11-24 00:35:31,000 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-11-24 00:35:31,001 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:31,001 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:31,001 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event
[2024-11-24 00:35:31,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][284], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 7#thread4EXITtrue, 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true])
[2024-11-24 00:35:31,001 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event
[2024-11-24 00:35:31,001 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2024-11-24 00:35:31,001 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2024-11-24 00:35:31,001 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event
[2024-11-24 00:35:31,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][89], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 7#thread4EXITtrue, 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), 43#thread1EXITtrue, Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true])
[2024-11-24 00:35:31,002 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-11-24 00:35:31,002 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:31,002 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event
[2024-11-24 00:35:31,002 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:31,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][308], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 7#thread4EXITtrue, 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true, 520#true])
[2024-11-24 00:35:31,002 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-11-24 00:35:31,002 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:31,002 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event
[2024-11-24 00:35:31,002 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event
[2024-11-24 00:35:31,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][410], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))])
[2024-11-24 00:35:31,016 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event
[2024-11-24 00:35:31,016 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:31,016 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event
[2024-11-24 00:35:31,016 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:31,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][236], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), 43#thread1EXITtrue, Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))])
[2024-11-24 00:35:31,017 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-11-24 00:35:31,017 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2024-11-24 00:35:31,017 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event
[2024-11-24 00:35:31,017 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event
[2024-11-24 00:35:31,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][411], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true])
[2024-11-24 00:35:31,018 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-11-24 00:35:31,018 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2024-11-24 00:35:31,018 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event
[2024-11-24 00:35:31,018 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event
[2024-11-24 00:35:31,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][410], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))])
[2024-11-24 00:35:31,085 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event
[2024-11-24 00:35:31,085 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:31,085 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event
[2024-11-24 00:35:31,085 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2024-11-24 00:35:31,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][236], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 43#thread1EXITtrue, 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))])
[2024-11-24 00:35:31,085 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event
[2024-11-24 00:35:31,085 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:31,085 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:31,086 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event
[2024-11-24 00:35:31,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][411], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true])
[2024-11-24 00:35:31,086 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event
[2024-11-24 00:35:31,086 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:31,086 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2024-11-24 00:35:31,086 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event
[2024-11-24 00:35:31,128 INFO L124 PetriNetUnfolderBase]: 49029/71374 cut-off events.
[2024-11-24 00:35:31,128 INFO L125 PetriNetUnfolderBase]: For 292752/297525 co-relation queries the response was YES.
[2024-11-24 00:35:31,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267376 conditions, 71374 events. 49029/71374 cut-off events. For 292752/297525 co-relation queries the response was YES. Maximal size of possible extension queue 4012. Compared 566027 event pairs, 10164 based on Foata normal form. 2812/68605 useless extension candidates. Maximal degree in co-relation 243769. Up to 28158 conditions per place.
[2024-11-24 00:35:32,143 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 368 selfloop transitions, 39 changer transitions 4/454 dead transitions.
[2024-11-24 00:35:32,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 454 transitions, 5725 flow
[2024-11-24 00:35:32,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-24 00:35:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-24 00:35:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 337 transitions.
[2024-11-24 00:35:32,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5673400673400674
[2024-11-24 00:35:32,145 INFO L175 Difference]: Start difference. First operand has 131 places, 160 transitions, 1690 flow. Second operand 9 states and 337 transitions.
[2024-11-24 00:35:32,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 454 transitions, 5725 flow
[2024-11-24 00:35:37,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 454 transitions, 5719 flow, removed 3 selfloop flow, removed 0 redundant places.
[2024-11-24 00:35:37,264 INFO L231 Difference]: Finished difference. Result has 144 places, 206 transitions, 2374 flow
[2024-11-24 00:35:37,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1684, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2374, PETRI_PLACES=144, PETRI_TRANSITIONS=206}
[2024-11-24 00:35:37,265 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 76 predicate places.
[2024-11-24 00:35:37,265 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 206 transitions, 2374 flow
[2024-11-24 00:35:37,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:37,265 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:35:37,265 INFO L206 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]
[2024-11-24 00:35:37,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-11-24 00:35:37,266 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-24 00:35:37,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:35:37,266 INFO L85 PathProgramCache]: Analyzing trace with hash -253429441, now seen corresponding path program 8 times
[2024-11-24 00:35:37,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:35:37,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076673883]
[2024-11-24 00:35:37,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-24 00:35:37,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:35:37,293 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-24 00:35:37,293 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:35:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-24 00:35:37,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:35:37,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076673883]
[2024-11-24 00:35:37,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076673883] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:35:37,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:35:37,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 00:35:37,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480541709]
[2024-11-24 00:35:37,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:35:37,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:35:37,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:35:37,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:35:37,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:35:37,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66
[2024-11-24 00:35:37,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 206 transitions, 2374 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:35:37,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:35:37,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66
[2024-11-24 00:35:37,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand