./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1 --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 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 12:37:34,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 12:37:34,284 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 12:37:34,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 12:37:34,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 12:37:34,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 12:37:34,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 12:37:34,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 12:37:34,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 12:37:34,310 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 12:37:34,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 12:37:34,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 12:37:34,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 12:37:34,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 12:37:34,310 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 12:37:34,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 12:37:34,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 12:37:34,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 12:37:34,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 12:37:34,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 12:37:34,311 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 12:37:34,311 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 12:37:34,311 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 12:37:34,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 12:37:34,311 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 12:37:34,312 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 12:37:34,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 12:37:34,312 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 12:37:34,312 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 12:37:34,312 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 12:37:34,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 12:37:34,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 12:37:34,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 12:37:34,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:37:34,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 12:37:34,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 12:37:34,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 12:37:34,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 12:37:34,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:37:34,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 12:37:34,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 12:37:34,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 12:37:34,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 12:37:34,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 12:37:34,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 12:37:34,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 12:37:34,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 12:37:34,314 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_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1 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 -> 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 [2024-12-02 12:37:34,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 12:37:34,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 12:37:34,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 12:37:34,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 12:37:34,550 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 12:37:34,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2024-12-02 12:37:37,134 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/data/28c0c14a8/9db75d3edb0d4eb09405c79da53d2388/FLAG49a3ae378 [2024-12-02 12:37:37,351 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 12:37:37,351 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2024-12-02 12:37:37,358 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/data/28c0c14a8/9db75d3edb0d4eb09405c79da53d2388/FLAG49a3ae378 [2024-12-02 12:37:37,720 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/data/28c0c14a8/9db75d3edb0d4eb09405c79da53d2388 [2024-12-02 12:37:37,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 12:37:37,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 12:37:37,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 12:37:37,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 12:37:37,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 12:37:37,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:37,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6c6e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37, skipping insertion in model container [2024-12-02 12:37:37,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:37,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 12:37:37,889 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 12:37:37,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 12:37:37,903 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 12:37:37,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 12:37:37,947 INFO L204 MainTranslator]: Completed translation [2024-12-02 12:37:37,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37 WrapperNode [2024-12-02 12:37:37,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 12:37:37,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 12:37:37,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 12:37:37,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 12:37:37,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:37,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:37,993 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 331 [2024-12-02 12:37:37,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 12:37:37,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 12:37:37,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 12:37:37,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 12:37:38,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:38,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:38,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:38,027 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-12-02 12:37:38,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:38,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:38,039 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:38,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:38,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:38,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:38,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:38,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 12:37:38,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 12:37:38,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 12:37:38,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 12:37:38,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (1/1) ... [2024-12-02 12:37:38,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:37:38,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:37:38,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 12:37:38,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 12:37:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 12:37:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 12:37:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 12:37:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 12:37:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 12:37:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-12-02 12:37:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-12-02 12:37:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-12-02 12:37:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-12-02 12:37:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-12-02 12:37:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-12-02 12:37:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-12-02 12:37:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-12-02 12:37:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 12:37:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 12:37:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 12:37:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 12:37:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 12:37:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 12:37:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 12:37:38,108 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 12:37:38,199 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 12:37:38,200 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 12:37:38,667 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 12:37:38,667 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 12:37:39,009 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 12:37:39,010 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2024-12-02 12:37:39,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:37:39 BoogieIcfgContainer [2024-12-02 12:37:39,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 12:37:39,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 12:37:39,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 12:37:39,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 12:37:39,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:37:37" (1/3) ... [2024-12-02 12:37:39,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d43378a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:37:39, skipping insertion in model container [2024-12-02 12:37:39,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:37" (2/3) ... [2024-12-02 12:37:39,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d43378a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:37:39, skipping insertion in model container [2024-12-02 12:37:39,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:37:39" (3/3) ... [2024-12-02 12:37:39,017 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2024-12-02 12:37:39,042 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 12:37:39,043 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series2.wvr.c that has 5 procedures, 69 locations, 1 initial locations, 7 loop locations, and 22 error locations. [2024-12-02 12:37:39,043 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 12:37:39,124 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-12-02 12:37:39,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 75 transitions, 178 flow [2024-12-02 12:37:39,201 INFO L124 PetriNetUnfolderBase]: 7/71 cut-off events. [2024-12-02 12:37:39,203 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-12-02 12:37:39,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 71 events. 7/71 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2024-12-02 12:37:39,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 75 transitions, 178 flow [2024-12-02 12:37:39,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 70 transitions, 164 flow [2024-12-02 12:37:39,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 12:37:39,232 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;@609d77d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 12:37:39,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2024-12-02 12:37:39,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 12:37:39,236 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-12-02 12:37:39,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 12:37:39,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:37:39,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-12-02 12:37:39,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:37:39,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1043750, now seen corresponding path program 1 times [2024-12-02 12:37:39,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:39,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296022726] [2024-12-02 12:37:39,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:39,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:39,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:39,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296022726] [2024-12-02 12:37:39,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296022726] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:39,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:39,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 12:37:39,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426081925] [2024-12-02 12:37:39,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:39,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:37:39,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:39,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:37:39,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:37:39,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:37:39,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-12-02 12:37:39,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:37:39,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:37:39,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:37:41,085 INFO L124 PetriNetUnfolderBase]: 9087/13263 cut-off events. [2024-12-02 12:37:41,086 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2024-12-02 12:37:41,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26130 conditions, 13263 events. 9087/13263 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 104300 event pairs, 8782 based on Foata normal form. 1/6667 useless extension candidates. Maximal degree in co-relation 24528. Up to 12043 conditions per place. [2024-12-02 12:37:41,204 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 41 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-12-02 12:37:41,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 236 flow [2024-12-02 12:37:41,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:37:41,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 12:37:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-12-02 12:37:41,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5511111111111111 [2024-12-02 12:37:41,218 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 164 flow. Second operand 3 states and 124 transitions. [2024-12-02 12:37:41,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 236 flow [2024-12-02 12:37:41,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 220 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-12-02 12:37:41,263 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 138 flow [2024-12-02 12:37:41,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2024-12-02 12:37:41,268 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -13 predicate places. [2024-12-02 12:37:41,269 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 138 flow [2024-12-02 12:37:41,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-12-02 12:37:41,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:37:41,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-12-02 12:37:41,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 12:37:41,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:37:41,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:41,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1043751, now seen corresponding path program 1 times [2024-12-02 12:37:41,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:41,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347898160] [2024-12-02 12:37:41,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:41,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:41,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:41,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347898160] [2024-12-02 12:37:41,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347898160] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:41,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:41,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:37:41,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735015550] [2024-12-02 12:37:41,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:41,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 12:37:41,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:41,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 12:37:41,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:37:41,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:37:41,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 138 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-12-02 12:37:41,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:37:41,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:37:41,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:37:43,039 INFO L124 PetriNetUnfolderBase]: 9088/13266 cut-off events. [2024-12-02 12:37:43,040 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 12:37:43,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25630 conditions, 13266 events. 9088/13266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 104144 event pairs, 8782 based on Foata normal form. 0/6666 useless extension candidates. Maximal degree in co-relation 25593. Up to 12056 conditions per place. [2024-12-02 12:37:43,090 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 45 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2024-12-02 12:37:43,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 242 flow [2024-12-02 12:37:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 12:37:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 12:37:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2024-12-02 12:37:43,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-12-02 12:37:43,092 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 138 flow. Second operand 4 states and 150 transitions. [2024-12-02 12:37:43,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 242 flow [2024-12-02 12:37:43,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 12:37:43,095 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 161 flow [2024-12-02 12:37:43,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-12-02 12:37:43,096 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -10 predicate places. [2024-12-02 12:37:43,096 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 161 flow [2024-12-02 12:37:43,096 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-12-02 12:37:43,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:37:43,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-12-02 12:37:43,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 12:37:43,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:37:43,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash 32357576, now seen corresponding path program 1 times [2024-12-02 12:37:43,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:43,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009266099] [2024-12-02 12:37:43,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:43,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:43,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:43,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009266099] [2024-12-02 12:37:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009266099] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:43,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:43,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:37:43,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257173997] [2024-12-02 12:37:43,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:43,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:37:43,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:43,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:37:43,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:37:43,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:37:43,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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-12-02 12:37:43,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:37:43,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:37:43,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:37:44,321 INFO L124 PetriNetUnfolderBase]: 9089/13269 cut-off events. [2024-12-02 12:37:44,321 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 12:37:44,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25647 conditions, 13269 events. 9089/13269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 104251 event pairs, 8782 based on Foata normal form. 0/6668 useless extension candidates. Maximal degree in co-relation 25622. Up to 12055 conditions per place. [2024-12-02 12:37:44,403 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 45 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2024-12-02 12:37:44,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 271 flow [2024-12-02 12:37:44,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:37:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 12:37:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2024-12-02 12:37:44,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4746666666666667 [2024-12-02 12:37:44,405 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 161 flow. Second operand 5 states and 178 transitions. [2024-12-02 12:37:44,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 271 flow [2024-12-02 12:37:44,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 12:37:44,407 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 195 flow [2024-12-02 12:37:44,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2024-12-02 12:37:44,408 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -5 predicate places. [2024-12-02 12:37:44,408 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 195 flow [2024-12-02 12:37:44,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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-12-02 12:37:44,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:37:44,409 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-12-02 12:37:44,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 12:37:44,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:37:44,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:44,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1003078451, now seen corresponding path program 1 times [2024-12-02 12:37:44,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:44,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950164721] [2024-12-02 12:37:44,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:44,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:44,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:44,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950164721] [2024-12-02 12:37:44,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950164721] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:37:44,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704200239] [2024-12-02 12:37:44,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:44,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:37:44,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:37:44,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:37:44,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 12:37:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:44,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-12-02 12:37:44,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:37:44,860 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-12-02 12:37:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:45,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:37:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:45,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704200239] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:37:45,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:37:45,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-12-02 12:37:45,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711661480] [2024-12-02 12:37:45,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:37:45,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 12:37:45,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:45,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 12:37:45,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-12-02 12:37:45,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:37:45,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 195 flow. Second operand has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 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-12-02 12:37:45,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:37:45,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:37:45,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:37:46,719 INFO L124 PetriNetUnfolderBase]: 9089/13268 cut-off events. [2024-12-02 12:37:46,719 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-12-02 12:37:46,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25660 conditions, 13268 events. 9089/13268 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 104319 event pairs, 8782 based on Foata normal form. 0/6670 useless extension candidates. Maximal degree in co-relation 25632. Up to 12055 conditions per place. [2024-12-02 12:37:46,782 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 44 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2024-12-02 12:37:46,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 68 transitions, 293 flow [2024-12-02 12:37:46,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 12:37:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 12:37:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-12-02 12:37:46,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44222222222222224 [2024-12-02 12:37:46,784 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 195 flow. Second operand 6 states and 199 transitions. [2024-12-02 12:37:46,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 68 transitions, 293 flow [2024-12-02 12:37:46,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 68 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 12:37:46,787 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 204 flow [2024-12-02 12:37:46,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2024-12-02 12:37:46,788 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -2 predicate places. [2024-12-02 12:37:46,788 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 204 flow [2024-12-02 12:37:46,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 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-12-02 12:37:46,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:37:46,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-12-02 12:37:46,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 12:37:46,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:37:46,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:37:46,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1003088656, now seen corresponding path program 1 times [2024-12-02 12:37:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:46,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451274901] [2024-12-02 12:37:46,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:47,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:47,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451274901] [2024-12-02 12:37:47,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451274901] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:47,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:47,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:37:47,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145549897] [2024-12-02 12:37:47,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:47,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:37:47,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:47,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:37:47,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:37:47,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:37:47,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 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-12-02 12:37:47,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:37:47,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:37:47,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:37:48,128 INFO L124 PetriNetUnfolderBase]: 9090/13271 cut-off events. [2024-12-02 12:37:48,128 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-12-02 12:37:48,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25673 conditions, 13271 events. 9090/13271 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 104438 event pairs, 8782 based on Foata normal form. 0/6672 useless extension candidates. Maximal degree in co-relation 25640. Up to 12057 conditions per place. [2024-12-02 12:37:48,213 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 45 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2024-12-02 12:37:48,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 71 transitions, 318 flow [2024-12-02 12:37:48,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:37:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 12:37:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2024-12-02 12:37:48,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.472 [2024-12-02 12:37:48,215 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 204 flow. Second operand 5 states and 177 transitions. [2024-12-02 12:37:48,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 71 transitions, 318 flow [2024-12-02 12:37:48,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 284 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-12-02 12:37:48,217 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 213 flow [2024-12-02 12:37:48,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-12-02 12:37:48,217 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -4 predicate places. [2024-12-02 12:37:48,217 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 213 flow [2024-12-02 12:37:48,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 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-12-02 12:37:48,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:37:48,218 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-12-02 12:37:48,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 12:37:48,218 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:37:48,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:48,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1030892844, now seen corresponding path program 1 times [2024-12-02 12:37:48,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:48,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101535298] [2024-12-02 12:37:48,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:48,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:48,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101535298] [2024-12-02 12:37:48,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101535298] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:37:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675167815] [2024-12-02 12:37:48,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:48,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:37:48,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:37:48,443 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:37:48,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 12:37:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:48,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-12-02 12:37:48,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:37:48,545 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-12-02 12:37:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:48,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:37:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:48,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675167815] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:37:48,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:37:48,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-12-02 12:37:48,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938663050] [2024-12-02 12:37:48,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:37:48,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 12:37:48,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:48,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 12:37:48,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-12-02 12:37:48,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:37:48,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 213 flow. Second operand has 13 states, 13 states have (on average 26.307692307692307) internal successors, (342), 13 states have internal predecessors, (342), 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-12-02 12:37:48,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:37:48,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:37:48,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:37:50,004 INFO L124 PetriNetUnfolderBase]: 9092/13276 cut-off events. [2024-12-02 12:37:50,004 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-12-02 12:37:50,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25688 conditions, 13276 events. 9092/13276 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 104202 event pairs, 8782 based on Foata normal form. 0/6680 useless extension candidates. Maximal degree in co-relation 25636. Up to 12051 conditions per place. [2024-12-02 12:37:50,071 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 41 selfloop transitions, 18 changer transitions 0/76 dead transitions. [2024-12-02 12:37:50,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 76 transitions, 350 flow [2024-12-02 12:37:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 12:37:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-12-02 12:37:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 283 transitions. [2024-12-02 12:37:50,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4192592592592593 [2024-12-02 12:37:50,073 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 213 flow. Second operand 9 states and 283 transitions. [2024-12-02 12:37:50,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 76 transitions, 350 flow [2024-12-02 12:37:50,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 76 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 12:37:50,075 INFO L231 Difference]: Finished difference. Result has 77 places, 76 transitions, 260 flow [2024-12-02 12:37:50,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=260, PETRI_PLACES=77, PETRI_TRANSITIONS=76} [2024-12-02 12:37:50,075 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 1 predicate places. [2024-12-02 12:37:50,075 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 76 transitions, 260 flow [2024-12-02 12:37:50,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.307692307692307) internal successors, (342), 13 states have internal predecessors, (342), 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-12-02 12:37:50,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:37:50,076 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-12-02 12:37:50,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 12:37:50,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:37:50,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:37:50,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:50,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1895558447, now seen corresponding path program 1 times [2024-12-02 12:37:50,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:50,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65478215] [2024-12-02 12:37:50,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:50,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:50,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:50,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65478215] [2024-12-02 12:37:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65478215] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:37:50,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761500470] [2024-12-02 12:37:50,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:50,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:37:50,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:37:50,520 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:37:50,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 12:37:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:50,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-12-02 12:37:50,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:37:50,611 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-12-02 12:37:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:50,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:37:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:50,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761500470] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:37:50,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:37:50,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-12-02 12:37:50,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511722848] [2024-12-02 12:37:50,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:37:50,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 12:37:50,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:50,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 12:37:50,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-12-02 12:37:51,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:37:51,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 76 transitions, 260 flow. Second operand has 13 states, 13 states have (on average 26.46153846153846) internal successors, (344), 13 states have internal predecessors, (344), 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-12-02 12:37:51,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:37:51,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:37:51,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:37:52,128 INFO L124 PetriNetUnfolderBase]: 9092/13275 cut-off events. [2024-12-02 12:37:52,128 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-12-02 12:37:52,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25699 conditions, 13275 events. 9092/13275 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 104394 event pairs, 8782 based on Foata normal form. 0/6680 useless extension candidates. Maximal degree in co-relation 25644. Up to 12052 conditions per place. [2024-12-02 12:37:52,180 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 39 selfloop transitions, 19 changer transitions 0/75 dead transitions. [2024-12-02 12:37:52,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 75 transitions, 372 flow [2024-12-02 12:37:52,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 12:37:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 12:37:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2024-12-02 12:37:52,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-12-02 12:37:52,183 INFO L175 Difference]: Start difference. First operand has 77 places, 76 transitions, 260 flow. Second operand 7 states and 225 transitions. [2024-12-02 12:37:52,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 75 transitions, 372 flow [2024-12-02 12:37:52,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 339 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-12-02 12:37:52,185 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 261 flow [2024-12-02 12:37:52,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2024-12-02 12:37:52,185 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 1 predicate places. [2024-12-02 12:37:52,185 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 261 flow [2024-12-02 12:37:52,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.46153846153846) internal successors, (344), 13 states have internal predecessors, (344), 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-12-02 12:37:52,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:37:52,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:37:52,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 12:37:52,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:37:52,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:37:52,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash 648133166, now seen corresponding path program 1 times [2024-12-02 12:37:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196071288] [2024-12-02 12:37:52,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:52,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:37:52,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:52,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196071288] [2024-12-02 12:37:52,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196071288] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:52,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:52,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:37:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846278202] [2024-12-02 12:37:52,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:52,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 12:37:52,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:52,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 12:37:52,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:37:52,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2024-12-02 12:37:52,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-12-02 12:37:52,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:37:52,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2024-12-02 12:37:52,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:37:53,618 INFO L124 PetriNetUnfolderBase]: 10043/14828 cut-off events. [2024-12-02 12:37:53,618 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-12-02 12:37:53,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28713 conditions, 14828 events. 10043/14828 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 1567. Compared 119524 event pairs, 9699 based on Foata normal form. 362/8107 useless extension candidates. Maximal degree in co-relation 25654. Up to 12064 conditions per place. [2024-12-02 12:37:53,701 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 90 selfloop transitions, 8 changer transitions 0/115 dead transitions. [2024-12-02 12:37:53,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 115 transitions, 601 flow [2024-12-02 12:37:53,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:37:53,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 12:37:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2024-12-02 12:37:53,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.616 [2024-12-02 12:37:53,702 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 261 flow. Second operand 5 states and 231 transitions. [2024-12-02 12:37:53,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 115 transitions, 601 flow [2024-12-02 12:37:53,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 115 transitions, 537 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-12-02 12:37:53,705 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 296 flow [2024-12-02 12:37:53,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2024-12-02 12:37:53,706 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 1 predicate places. [2024-12-02 12:37:53,706 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 296 flow [2024-12-02 12:37:53,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-12-02 12:37:53,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:37:53,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:37:53,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 12:37:53,706 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:37:53,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash -470952134, now seen corresponding path program 1 times [2024-12-02 12:37:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:53,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504923147] [2024-12-02 12:37:53,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:53,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:37:53,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:53,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504923147] [2024-12-02 12:37:53,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504923147] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:53,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:53,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:37:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507027038] [2024-12-02 12:37:53,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:37:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:53,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:37:53,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:37:53,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:37:53,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-12-02 12:37:53,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:37:53,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:37:53,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:37:56,605 INFO L124 PetriNetUnfolderBase]: 28387/40176 cut-off events. [2024-12-02 12:37:56,605 INFO L125 PetriNetUnfolderBase]: For 1720/2700 co-relation queries the response was YES. [2024-12-02 12:37:56,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89088 conditions, 40176 events. 28387/40176 cut-off events. For 1720/2700 co-relation queries the response was YES. Maximal size of possible extension queue 3668. Compared 327581 event pairs, 12977 based on Foata normal form. 0/21731 useless extension candidates. Maximal degree in co-relation 79065. Up to 16428 conditions per place. [2024-12-02 12:37:56,781 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 137 selfloop transitions, 12 changer transitions 0/163 dead transitions. [2024-12-02 12:37:56,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 163 transitions, 806 flow [2024-12-02 12:37:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 12:37:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 12:37:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 283 transitions. [2024-12-02 12:37:56,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6288888888888889 [2024-12-02 12:37:56,784 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 296 flow. Second operand 6 states and 283 transitions. [2024-12-02 12:37:56,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 163 transitions, 806 flow [2024-12-02 12:37:56,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 163 transitions, 801 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 12:37:56,796 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 340 flow [2024-12-02 12:37:56,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=340, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2024-12-02 12:37:56,797 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 7 predicate places. [2024-12-02 12:37:56,797 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 340 flow [2024-12-02 12:37:56,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-12-02 12:37:56,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:37:56,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:37:56,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 12:37:56,797 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:37:56,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1365782164, now seen corresponding path program 1 times [2024-12-02 12:37:56,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:56,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871470653] [2024-12-02 12:37:56,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:56,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:37:56,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:56,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871470653] [2024-12-02 12:37:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871470653] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:37:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87528444] [2024-12-02 12:37:56,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:56,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 12:37:56,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:56,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 12:37:56,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:37:56,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2024-12-02 12:37:56,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:37:56,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:37:56,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2024-12-02 12:37:56,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:37:59,448 INFO L124 PetriNetUnfolderBase]: 23338/34927 cut-off events. [2024-12-02 12:37:59,448 INFO L125 PetriNetUnfolderBase]: For 5370/5370 co-relation queries the response was YES. [2024-12-02 12:37:59,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78435 conditions, 34927 events. 23338/34927 cut-off events. For 5370/5370 co-relation queries the response was YES. Maximal size of possible extension queue 2916. Compared 304644 event pairs, 22136 based on Foata normal form. 686/20972 useless extension candidates. Maximal degree in co-relation 63001. Up to 27977 conditions per place. [2024-12-02 12:37:59,660 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 88 selfloop transitions, 10 changer transitions 0/116 dead transitions. [2024-12-02 12:37:59,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 116 transitions, 672 flow [2024-12-02 12:37:59,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:37:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 12:37:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2024-12-02 12:37:59,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-12-02 12:37:59,661 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 340 flow. Second operand 5 states and 225 transitions. [2024-12-02 12:37:59,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 116 transitions, 672 flow [2024-12-02 12:37:59,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 116 transitions, 669 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 12:37:59,666 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 429 flow [2024-12-02 12:37:59,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=429, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2024-12-02 12:37:59,666 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 12 predicate places. [2024-12-02 12:37:59,666 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 429 flow [2024-12-02 12:37:59,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:37:59,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:37:59,667 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:37:59,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 12:37:59,667 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:37:59,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:37:59,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1311434886, now seen corresponding path program 1 times [2024-12-02 12:37:59,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:37:59,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526058478] [2024-12-02 12:37:59,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:37:59,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:37:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:37:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:37:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:37:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526058478] [2024-12-02 12:37:59,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526058478] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:37:59,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:37:59,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:37:59,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296356282] [2024-12-02 12:37:59,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:37:59,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 12:37:59,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:37:59,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 12:37:59,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:37:59,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:37:59,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 429 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:37:59,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:37:59,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:37:59,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:02,161 INFO L124 PetriNetUnfolderBase]: 17727/26781 cut-off events. [2024-12-02 12:38:02,162 INFO L125 PetriNetUnfolderBase]: For 6272/6272 co-relation queries the response was YES. [2024-12-02 12:38:02,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66181 conditions, 26781 events. 17727/26781 cut-off events. For 6272/6272 co-relation queries the response was YES. Maximal size of possible extension queue 2158. Compared 228727 event pairs, 16757 based on Foata normal form. 0/16542 useless extension candidates. Maximal degree in co-relation 51958. Up to 24071 conditions per place. [2024-12-02 12:38:02,296 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 60 selfloop transitions, 6 changer transitions 0/84 dead transitions. [2024-12-02 12:38:02,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 84 transitions, 553 flow [2024-12-02 12:38:02,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 12:38:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 12:38:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2024-12-02 12:38:02,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4766666666666667 [2024-12-02 12:38:02,297 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 429 flow. Second operand 4 states and 143 transitions. [2024-12-02 12:38:02,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 84 transitions, 553 flow [2024-12-02 12:38:02,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 84 transitions, 548 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 12:38:02,307 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 428 flow [2024-12-02 12:38:02,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=428, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2024-12-02 12:38:02,308 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 12 predicate places. [2024-12-02 12:38:02,308 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 428 flow [2024-12-02 12:38:02,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:38:02,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:02,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:02,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 12:38:02,309 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:02,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:02,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1311434887, now seen corresponding path program 1 times [2024-12-02 12:38:02,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:02,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105379218] [2024-12-02 12:38:02,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:02,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:38:02,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:02,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105379218] [2024-12-02 12:38:02,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105379218] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:38:02,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:38:02,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:38:02,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586365880] [2024-12-02 12:38:02,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:38:02,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:38:02,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:02,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:38:02,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:38:02,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:38:02,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 428 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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-12-02 12:38:02,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:02,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:38:02,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:06,313 INFO L124 PetriNetUnfolderBase]: 36711/51254 cut-off events. [2024-12-02 12:38:06,314 INFO L125 PetriNetUnfolderBase]: For 13190/18038 co-relation queries the response was YES. [2024-12-02 12:38:06,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130848 conditions, 51254 events. 36711/51254 cut-off events. For 13190/18038 co-relation queries the response was YES. Maximal size of possible extension queue 3735. Compared 398887 event pairs, 15291 based on Foata normal form. 0/30864 useless extension candidates. Maximal degree in co-relation 106369. Up to 20324 conditions per place. [2024-12-02 12:38:06,564 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 160 selfloop transitions, 18 changer transitions 0/193 dead transitions. [2024-12-02 12:38:06,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 193 transitions, 1135 flow [2024-12-02 12:38:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 12:38:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 12:38:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 354 transitions. [2024-12-02 12:38:06,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2024-12-02 12:38:06,565 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 428 flow. Second operand 8 states and 354 transitions. [2024-12-02 12:38:06,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 193 transitions, 1135 flow [2024-12-02 12:38:06,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 193 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 12:38:06,576 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 493 flow [2024-12-02 12:38:06,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=493, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-12-02 12:38:06,576 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 20 predicate places. [2024-12-02 12:38:06,576 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 493 flow [2024-12-02 12:38:06,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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-12-02 12:38:06,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:06,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:06,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 12:38:06,577 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:06,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash 728800984, now seen corresponding path program 1 times [2024-12-02 12:38:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:06,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679286274] [2024-12-02 12:38:06,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:06,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:38:06,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:06,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679286274] [2024-12-02 12:38:06,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679286274] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:38:06,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:38:06,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:38:06,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883485928] [2024-12-02 12:38:06,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:38:06,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:38:06,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:06,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:38:06,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:38:06,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:38:06,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 493 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:38:06,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:06,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:38:06,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:09,587 INFO L124 PetriNetUnfolderBase]: 17091/25488 cut-off events. [2024-12-02 12:38:09,587 INFO L125 PetriNetUnfolderBase]: For 11533/11533 co-relation queries the response was YES. [2024-12-02 12:38:09,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66967 conditions, 25488 events. 17091/25488 cut-off events. For 11533/11533 co-relation queries the response was YES. Maximal size of possible extension queue 1827. Compared 208298 event pairs, 15535 based on Foata normal form. 0/17789 useless extension candidates. Maximal degree in co-relation 53812. Up to 22975 conditions per place. [2024-12-02 12:38:09,789 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 58 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2024-12-02 12:38:09,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 86 transitions, 619 flow [2024-12-02 12:38:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:38:09,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 12:38:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2024-12-02 12:38:09,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44266666666666665 [2024-12-02 12:38:09,790 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 493 flow. Second operand 5 states and 166 transitions. [2024-12-02 12:38:09,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 86 transitions, 619 flow [2024-12-02 12:38:09,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 86 transitions, 606 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 12:38:09,801 INFO L231 Difference]: Finished difference. Result has 97 places, 86 transitions, 490 flow [2024-12-02 12:38:09,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=490, PETRI_PLACES=97, PETRI_TRANSITIONS=86} [2024-12-02 12:38:09,802 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 21 predicate places. [2024-12-02 12:38:09,802 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 86 transitions, 490 flow [2024-12-02 12:38:09,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:38:09,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:09,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:09,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 12:38:09,802 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:09,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:09,803 INFO L85 PathProgramCache]: Analyzing trace with hash 728800985, now seen corresponding path program 1 times [2024-12-02 12:38:09,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:09,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862141825] [2024-12-02 12:38:09,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:09,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:38:10,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:10,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862141825] [2024-12-02 12:38:10,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862141825] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:10,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698479992] [2024-12-02 12:38:10,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:10,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:10,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:10,228 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:10,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 12:38:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:10,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 12:38:10,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:10,332 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-12-02 12:38:10,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 12:38:10,403 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-12-02 12:38:10,429 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 12:38:10,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 12:38:10,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 12:38:10,463 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-12-02 12:38:10,473 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 12:38:10,474 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-12-02 12:38:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:38:10,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:38:10,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698479992] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:38:10,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 12:38:10,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-12-02 12:38:10,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440694682] [2024-12-02 12:38:10,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:38:10,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:38:10,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:10,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:38:10,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-12-02 12:38:10,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:38:10,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 86 transitions, 490 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-12-02 12:38:10,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:10,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:38:10,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:12,028 INFO L124 PetriNetUnfolderBase]: 10670/16322 cut-off events. [2024-12-02 12:38:12,028 INFO L125 PetriNetUnfolderBase]: For 8259/8259 co-relation queries the response was YES. [2024-12-02 12:38:12,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42043 conditions, 16322 events. 10670/16322 cut-off events. For 8259/8259 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 130492 event pairs, 9596 based on Foata normal form. 0/12816 useless extension candidates. Maximal degree in co-relation 31013. Up to 14630 conditions per place. [2024-12-02 12:38:12,118 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 61 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2024-12-02 12:38:12,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 84 transitions, 612 flow [2024-12-02 12:38:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 12:38:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 12:38:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-12-02 12:38:12,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4633333333333333 [2024-12-02 12:38:12,119 INFO L175 Difference]: Start difference. First operand has 97 places, 86 transitions, 490 flow. Second operand 4 states and 139 transitions. [2024-12-02 12:38:12,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 84 transitions, 612 flow [2024-12-02 12:38:12,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 84 transitions, 599 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 12:38:12,125 INFO L231 Difference]: Finished difference. Result has 95 places, 84 transitions, 477 flow [2024-12-02 12:38:12,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=477, PETRI_PLACES=95, PETRI_TRANSITIONS=84} [2024-12-02 12:38:12,125 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 19 predicate places. [2024-12-02 12:38:12,125 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 84 transitions, 477 flow [2024-12-02 12:38:12,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-12-02 12:38:12,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:12,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:12,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 12:38:12,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-12-02 12:38:12,326 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:12,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash 728800987, now seen corresponding path program 1 times [2024-12-02 12:38:12,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:12,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082291142] [2024-12-02 12:38:12,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:38:12,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:12,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082291142] [2024-12-02 12:38:12,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082291142] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:12,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070872152] [2024-12-02 12:38:12,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:12,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:12,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:12,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:12,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 12:38:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:12,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-12-02 12:38:12,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:12,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:38:12,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:12,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-12-02 12:38:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:38:12,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070872152] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:12,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:12,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-12-02 12:38:12,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155393456] [2024-12-02 12:38:12,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:12,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:38:12,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:12,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:38:12,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:38:12,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2024-12-02 12:38:12,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 84 transitions, 477 flow. Second operand has 12 states, 12 states have (on average 29.833333333333332) internal successors, (358), 12 states have internal predecessors, (358), 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-12-02 12:38:12,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:12,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2024-12-02 12:38:12,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:14,116 INFO L124 PetriNetUnfolderBase]: 9324/14788 cut-off events. [2024-12-02 12:38:14,116 INFO L125 PetriNetUnfolderBase]: For 7639/7639 co-relation queries the response was YES. [2024-12-02 12:38:14,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37951 conditions, 14788 events. 9324/14788 cut-off events. For 7639/7639 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 117863 event pairs, 4601 based on Foata normal form. 420/12466 useless extension candidates. Maximal degree in co-relation 30273. Up to 5897 conditions per place. [2024-12-02 12:38:14,215 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 91 selfloop transitions, 20 changer transitions 0/130 dead transitions. [2024-12-02 12:38:14,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 130 transitions, 842 flow [2024-12-02 12:38:14,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 12:38:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 12:38:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 261 transitions. [2024-12-02 12:38:14,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58 [2024-12-02 12:38:14,216 INFO L175 Difference]: Start difference. First operand has 95 places, 84 transitions, 477 flow. Second operand 6 states and 261 transitions. [2024-12-02 12:38:14,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 130 transitions, 842 flow [2024-12-02 12:38:14,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 130 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 12:38:14,232 INFO L231 Difference]: Finished difference. Result has 99 places, 84 transitions, 516 flow [2024-12-02 12:38:14,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=516, PETRI_PLACES=99, PETRI_TRANSITIONS=84} [2024-12-02 12:38:14,232 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 23 predicate places. [2024-12-02 12:38:14,232 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 84 transitions, 516 flow [2024-12-02 12:38:14,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.833333333333332) internal successors, (358), 12 states have internal predecessors, (358), 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-12-02 12:38:14,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:14,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:14,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 12:38:14,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-12-02 12:38:14,433 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:14,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:14,433 INFO L85 PathProgramCache]: Analyzing trace with hash -238337946, now seen corresponding path program 1 times [2024-12-02 12:38:14,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:14,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170766592] [2024-12-02 12:38:14,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:14,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:38:14,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:14,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170766592] [2024-12-02 12:38:14,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170766592] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:14,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024608638] [2024-12-02 12:38:14,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:14,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:14,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:14,597 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:14,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 12:38:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:14,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-12-02 12:38:14,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:38:14,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:14,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-12-02 12:38:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:38:14,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024608638] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:14,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:14,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-12-02 12:38:14,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599790097] [2024-12-02 12:38:14,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:14,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:38:14,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:14,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:38:14,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:38:14,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2024-12-02 12:38:14,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 84 transitions, 516 flow. Second operand has 12 states, 12 states have (on average 30.333333333333332) internal successors, (364), 12 states have internal predecessors, (364), 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-12-02 12:38:14,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:14,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2024-12-02 12:38:14,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:16,203 INFO L124 PetriNetUnfolderBase]: 8550/13426 cut-off events. [2024-12-02 12:38:16,203 INFO L125 PetriNetUnfolderBase]: For 9091/9091 co-relation queries the response was YES. [2024-12-02 12:38:16,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35893 conditions, 13426 events. 8550/13426 cut-off events. For 9091/9091 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 104527 event pairs, 4079 based on Foata normal form. 0/11096 useless extension candidates. Maximal degree in co-relation 28650. Up to 4949 conditions per place. [2024-12-02 12:38:16,299 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 101 selfloop transitions, 22 changer transitions 0/142 dead transitions. [2024-12-02 12:38:16,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 142 transitions, 953 flow [2024-12-02 12:38:16,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 12:38:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 12:38:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 302 transitions. [2024-12-02 12:38:16,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5752380952380952 [2024-12-02 12:38:16,300 INFO L175 Difference]: Start difference. First operand has 99 places, 84 transitions, 516 flow. Second operand 7 states and 302 transitions. [2024-12-02 12:38:16,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 142 transitions, 953 flow [2024-12-02 12:38:16,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 142 transitions, 904 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-12-02 12:38:16,306 INFO L231 Difference]: Finished difference. Result has 103 places, 86 transitions, 535 flow [2024-12-02 12:38:16,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=535, PETRI_PLACES=103, PETRI_TRANSITIONS=86} [2024-12-02 12:38:16,307 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 27 predicate places. [2024-12-02 12:38:16,307 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 86 transitions, 535 flow [2024-12-02 12:38:16,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.333333333333332) internal successors, (364), 12 states have internal predecessors, (364), 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-12-02 12:38:16,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:16,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:16,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 12:38:16,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-02 12:38:16,508 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:16,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash -238337945, now seen corresponding path program 1 times [2024-12-02 12:38:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:16,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200438449] [2024-12-02 12:38:16,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:38:16,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:16,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200438449] [2024-12-02 12:38:16,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200438449] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:38:16,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:38:16,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 12:38:16,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766077612] [2024-12-02 12:38:16,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:38:16,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:38:16,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:16,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:38:16,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:38:16,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:38:16,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 86 transitions, 535 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:38:16,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:16,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:38:16,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:17,521 INFO L124 PetriNetUnfolderBase]: 7110/11106 cut-off events. [2024-12-02 12:38:17,521 INFO L125 PetriNetUnfolderBase]: For 10413/10413 co-relation queries the response was YES. [2024-12-02 12:38:17,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30969 conditions, 11106 events. 7110/11106 cut-off events. For 10413/10413 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 85447 event pairs, 6302 based on Foata normal form. 0/9568 useless extension candidates. Maximal degree in co-relation 24457. Up to 9877 conditions per place. [2024-12-02 12:38:17,580 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 54 selfloop transitions, 11 changer transitions 0/84 dead transitions. [2024-12-02 12:38:17,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 84 transitions, 652 flow [2024-12-02 12:38:17,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:38:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 12:38:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-12-02 12:38:17,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.432 [2024-12-02 12:38:17,582 INFO L175 Difference]: Start difference. First operand has 103 places, 86 transitions, 535 flow. Second operand 5 states and 162 transitions. [2024-12-02 12:38:17,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 84 transitions, 652 flow [2024-12-02 12:38:17,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 84 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 12:38:17,587 INFO L231 Difference]: Finished difference. Result has 104 places, 84 transitions, 512 flow [2024-12-02 12:38:17,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=512, PETRI_PLACES=104, PETRI_TRANSITIONS=84} [2024-12-02 12:38:17,587 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 28 predicate places. [2024-12-02 12:38:17,587 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 84 transitions, 512 flow [2024-12-02 12:38:17,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:38:17,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:17,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:17,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 12:38:17,588 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:17,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash -238337944, now seen corresponding path program 1 times [2024-12-02 12:38:17,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:17,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452904118] [2024-12-02 12:38:17,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:17,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:38:17,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:17,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452904118] [2024-12-02 12:38:17,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452904118] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:17,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522166726] [2024-12-02 12:38:17,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:17,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:17,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:17,734 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:17,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 12:38:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:17,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 12:38:17,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:17,834 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-12-02 12:38:17,884 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 12:38:17,885 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-12-02 12:38:17,888 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-12-02 12:38:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:38:17,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:38:17,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522166726] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:38:17,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 12:38:17,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2024-12-02 12:38:17,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103154565] [2024-12-02 12:38:17,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:38:17,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:38:17,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:17,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:38:17,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:38:17,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:38:17,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 84 transitions, 512 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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-12-02 12:38:17,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:17,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:38:17,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:18,611 INFO L124 PetriNetUnfolderBase]: 4723/7690 cut-off events. [2024-12-02 12:38:18,611 INFO L125 PetriNetUnfolderBase]: For 8241/8241 co-relation queries the response was YES. [2024-12-02 12:38:18,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20762 conditions, 7690 events. 4723/7690 cut-off events. For 8241/8241 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 58309 event pairs, 4115 based on Foata normal form. 444/7241 useless extension candidates. Maximal degree in co-relation 16193. Up to 6665 conditions per place. [2024-12-02 12:38:18,658 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 49 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2024-12-02 12:38:18,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 81 transitions, 619 flow [2024-12-02 12:38:18,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:38:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 12:38:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-12-02 12:38:18,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42933333333333334 [2024-12-02 12:38:18,660 INFO L175 Difference]: Start difference. First operand has 104 places, 84 transitions, 512 flow. Second operand 5 states and 161 transitions. [2024-12-02 12:38:18,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 81 transitions, 619 flow [2024-12-02 12:38:18,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 81 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 12:38:18,664 INFO L231 Difference]: Finished difference. Result has 100 places, 81 transitions, 500 flow [2024-12-02 12:38:18,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=500, PETRI_PLACES=100, PETRI_TRANSITIONS=81} [2024-12-02 12:38:18,665 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 24 predicate places. [2024-12-02 12:38:18,665 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 81 transitions, 500 flow [2024-12-02 12:38:18,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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-12-02 12:38:18,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:18,665 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:18,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 12:38:18,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-12-02 12:38:18,866 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:18,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash 651608561, now seen corresponding path program 1 times [2024-12-02 12:38:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633413598] [2024-12-02 12:38:18,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:38:18,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:18,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633413598] [2024-12-02 12:38:18,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633413598] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:18,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219964466] [2024-12-02 12:38:18,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:18,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:18,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:18,972 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:18,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 12:38:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:19,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 12:38:19,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:38:19,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:38:19,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219964466] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:19,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:19,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-12-02 12:38:19,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223507375] [2024-12-02 12:38:19,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:19,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:38:19,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:19,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:38:19,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:38:19,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2024-12-02 12:38:19,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 81 transitions, 500 flow. Second operand has 12 states, 12 states have (on average 29.916666666666668) internal successors, (359), 12 states have internal predecessors, (359), 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-12-02 12:38:19,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:19,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2024-12-02 12:38:19,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:20,601 INFO L124 PetriNetUnfolderBase]: 8666/14494 cut-off events. [2024-12-02 12:38:20,601 INFO L125 PetriNetUnfolderBase]: For 11546/11546 co-relation queries the response was YES. [2024-12-02 12:38:20,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37317 conditions, 14494 events. 8666/14494 cut-off events. For 11546/11546 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 120374 event pairs, 5136 based on Foata normal form. 532/13688 useless extension candidates. Maximal degree in co-relation 17444. Up to 5132 conditions per place. [2024-12-02 12:38:20,698 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 120 selfloop transitions, 47 changer transitions 0/186 dead transitions. [2024-12-02 12:38:20,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 186 transitions, 1331 flow [2024-12-02 12:38:20,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 12:38:20,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-12-02 12:38:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 473 transitions. [2024-12-02 12:38:20,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255555555555556 [2024-12-02 12:38:20,701 INFO L175 Difference]: Start difference. First operand has 100 places, 81 transitions, 500 flow. Second operand 12 states and 473 transitions. [2024-12-02 12:38:20,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 186 transitions, 1331 flow [2024-12-02 12:38:20,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 186 transitions, 1297 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 12:38:20,709 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 832 flow [2024-12-02 12:38:20,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=832, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2024-12-02 12:38:20,709 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 37 predicate places. [2024-12-02 12:38:20,709 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 832 flow [2024-12-02 12:38:20,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.916666666666668) internal successors, (359), 12 states have internal predecessors, (359), 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-12-02 12:38:20,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:20,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:20,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 12:38:20,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:20,910 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:20,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash 966127100, now seen corresponding path program 1 times [2024-12-02 12:38:20,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:20,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133147654] [2024-12-02 12:38:20,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:20,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:38:20,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:20,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133147654] [2024-12-02 12:38:20,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133147654] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:38:20,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:38:20,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 12:38:20,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603233620] [2024-12-02 12:38:20,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:38:20,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:38:20,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:20,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:38:20,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:38:20,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2024-12-02 12:38:20,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 832 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-12-02 12:38:20,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:20,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2024-12-02 12:38:20,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:22,130 INFO L124 PetriNetUnfolderBase]: 7518/12630 cut-off events. [2024-12-02 12:38:22,130 INFO L125 PetriNetUnfolderBase]: For 14108/14108 co-relation queries the response was YES. [2024-12-02 12:38:22,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34500 conditions, 12630 events. 7518/12630 cut-off events. For 14108/14108 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 98801 event pairs, 3226 based on Foata normal form. 136/11711 useless extension candidates. Maximal degree in co-relation 18280. Up to 5737 conditions per place. [2024-12-02 12:38:22,198 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 105 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2024-12-02 12:38:22,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 126 transitions, 1130 flow [2024-12-02 12:38:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:38:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 12:38:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-12-02 12:38:22,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2024-12-02 12:38:22,199 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 832 flow. Second operand 3 states and 138 transitions. [2024-12-02 12:38:22,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 126 transitions, 1130 flow [2024-12-02 12:38:22,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 126 transitions, 1088 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-12-02 12:38:22,209 INFO L231 Difference]: Finished difference. Result has 114 places, 107 transitions, 804 flow [2024-12-02 12:38:22,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=114, PETRI_TRANSITIONS=107} [2024-12-02 12:38:22,209 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 38 predicate places. [2024-12-02 12:38:22,209 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 107 transitions, 804 flow [2024-12-02 12:38:22,209 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-12-02 12:38:22,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:22,209 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:22,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 12:38:22,210 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:22,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:22,210 INFO L85 PathProgramCache]: Analyzing trace with hash -743591860, now seen corresponding path program 1 times [2024-12-02 12:38:22,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:22,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071823157] [2024-12-02 12:38:22,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:38:22,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:22,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071823157] [2024-12-02 12:38:22,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071823157] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:22,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124868632] [2024-12-02 12:38:22,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:22,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:22,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:22,306 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:22,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 12:38:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:22,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 12:38:22,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:38:22,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:38:22,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124868632] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:22,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:22,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-12-02 12:38:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630646081] [2024-12-02 12:38:22,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:22,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:38:22,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:22,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:38:22,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:38:22,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2024-12-02 12:38:22,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 107 transitions, 804 flow. Second operand has 12 states, 12 states have (on average 30.083333333333332) internal successors, (361), 12 states have internal predecessors, (361), 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-12-02 12:38:22,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:22,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2024-12-02 12:38:22,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:24,395 INFO L124 PetriNetUnfolderBase]: 11062/18786 cut-off events. [2024-12-02 12:38:24,396 INFO L125 PetriNetUnfolderBase]: For 24782/24782 co-relation queries the response was YES. [2024-12-02 12:38:24,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53024 conditions, 18786 events. 11062/18786 cut-off events. For 24782/24782 co-relation queries the response was YES. Maximal size of possible extension queue 1002. Compared 163173 event pairs, 7522 based on Foata normal form. 824/17829 useless extension candidates. Maximal degree in co-relation 44654. Up to 7400 conditions per place. [2024-12-02 12:38:24,545 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 122 selfloop transitions, 66 changer transitions 0/207 dead transitions. [2024-12-02 12:38:24,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 207 transitions, 1760 flow [2024-12-02 12:38:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 12:38:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-12-02 12:38:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 452 transitions. [2024-12-02 12:38:24,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5022222222222222 [2024-12-02 12:38:24,547 INFO L175 Difference]: Start difference. First operand has 114 places, 107 transitions, 804 flow. Second operand 12 states and 452 transitions. [2024-12-02 12:38:24,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 207 transitions, 1760 flow [2024-12-02 12:38:24,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 207 transitions, 1754 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 12:38:24,569 INFO L231 Difference]: Finished difference. Result has 128 places, 133 transitions, 1269 flow [2024-12-02 12:38:24,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1269, PETRI_PLACES=128, PETRI_TRANSITIONS=133} [2024-12-02 12:38:24,570 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 52 predicate places. [2024-12-02 12:38:24,570 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 133 transitions, 1269 flow [2024-12-02 12:38:24,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.083333333333332) internal successors, (361), 12 states have internal predecessors, (361), 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-12-02 12:38:24,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:24,571 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:24,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 12:38:24,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:24,771 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:24,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2091786085, now seen corresponding path program 2 times [2024-12-02 12:38:24,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:24,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416499630] [2024-12-02 12:38:24,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:38:24,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:24,789 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:38:24,789 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:38:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 12:38:24,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:24,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416499630] [2024-12-02 12:38:24,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416499630] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:24,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016929073] [2024-12-02 12:38:24,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:38:24,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:24,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:24,905 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:24,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 12:38:25,095 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:38:25,096 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:38:25,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-02 12:38:25,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 12:38:25,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 12:38:25,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016929073] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:25,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:25,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-12-02 12:38:25,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833854568] [2024-12-02 12:38:25,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:25,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 12:38:25,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:25,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 12:38:25,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-12-02 12:38:25,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:38:25,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 133 transitions, 1269 flow. Second operand has 16 states, 16 states have (on average 26.9375) internal successors, (431), 16 states have internal predecessors, (431), 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-12-02 12:38:25,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:25,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:38:25,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:30,546 INFO L124 PetriNetUnfolderBase]: 33905/51785 cut-off events. [2024-12-02 12:38:30,546 INFO L125 PetriNetUnfolderBase]: For 75220/76012 co-relation queries the response was YES. [2024-12-02 12:38:30,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156356 conditions, 51785 events. 33905/51785 cut-off events. For 75220/76012 co-relation queries the response was YES. Maximal size of possible extension queue 2681. Compared 450356 event pairs, 15721 based on Foata normal form. 605/48528 useless extension candidates. Maximal degree in co-relation 133337. Up to 16200 conditions per place. [2024-12-02 12:38:30,919 INFO L140 encePairwiseOnDemand]: 61/75 looper letters, 187 selfloop transitions, 85 changer transitions 0/287 dead transitions. [2024-12-02 12:38:30,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 287 transitions, 2576 flow [2024-12-02 12:38:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 12:38:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-12-02 12:38:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 491 transitions. [2024-12-02 12:38:30,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035897435897436 [2024-12-02 12:38:30,921 INFO L175 Difference]: Start difference. First operand has 128 places, 133 transitions, 1269 flow. Second operand 13 states and 491 transitions. [2024-12-02 12:38:30,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 287 transitions, 2576 flow [2024-12-02 12:38:30,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 287 transitions, 2545 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-12-02 12:38:30,997 INFO L231 Difference]: Finished difference. Result has 144 places, 151 transitions, 1701 flow [2024-12-02 12:38:30,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1701, PETRI_PLACES=144, PETRI_TRANSITIONS=151} [2024-12-02 12:38:30,998 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 68 predicate places. [2024-12-02 12:38:30,998 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 151 transitions, 1701 flow [2024-12-02 12:38:30,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 26.9375) internal successors, (431), 16 states have internal predecessors, (431), 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-12-02 12:38:30,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:30,998 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:31,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 12:38:31,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:31,199 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:31,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:31,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1335647824, now seen corresponding path program 2 times [2024-12-02 12:38:31,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:31,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638812490] [2024-12-02 12:38:31,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:38:31,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:31,216 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:38:31,216 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:38:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 12:38:31,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:31,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638812490] [2024-12-02 12:38:31,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638812490] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:31,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584357265] [2024-12-02 12:38:31,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:38:31,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:31,351 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:31,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 12:38:31,650 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:38:31,651 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:38:31,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-02 12:38:31,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 12:38:31,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 12:38:31,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584357265] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:31,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:31,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-12-02 12:38:31,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436479359] [2024-12-02 12:38:31,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:31,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 12:38:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:31,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 12:38:31,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-12-02 12:38:31,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:38:31,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 151 transitions, 1701 flow. Second operand has 16 states, 16 states have (on average 27.1875) internal successors, (435), 16 states have internal predecessors, (435), 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-12-02 12:38:31,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:31,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:38:31,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:38,269 INFO L124 PetriNetUnfolderBase]: 34672/51901 cut-off events. [2024-12-02 12:38:38,269 INFO L125 PetriNetUnfolderBase]: For 79172/80864 co-relation queries the response was YES. [2024-12-02 12:38:38,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163589 conditions, 51901 events. 34672/51901 cut-off events. For 79172/80864 co-relation queries the response was YES. Maximal size of possible extension queue 2774. Compared 436097 event pairs, 15843 based on Foata normal form. 820/48176 useless extension candidates. Maximal degree in co-relation 141288. Up to 19385 conditions per place. [2024-12-02 12:38:38,659 INFO L140 encePairwiseOnDemand]: 61/75 looper letters, 169 selfloop transitions, 86 changer transitions 0/271 dead transitions. [2024-12-02 12:38:38,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 271 transitions, 2730 flow [2024-12-02 12:38:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 12:38:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-12-02 12:38:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 477 transitions. [2024-12-02 12:38:38,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48923076923076925 [2024-12-02 12:38:38,661 INFO L175 Difference]: Start difference. First operand has 144 places, 151 transitions, 1701 flow. Second operand 13 states and 477 transitions. [2024-12-02 12:38:38,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 271 transitions, 2730 flow [2024-12-02 12:38:38,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 271 transitions, 2692 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-12-02 12:38:38,743 INFO L231 Difference]: Finished difference. Result has 157 places, 156 transitions, 1950 flow [2024-12-02 12:38:38,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1950, PETRI_PLACES=157, PETRI_TRANSITIONS=156} [2024-12-02 12:38:38,743 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 81 predicate places. [2024-12-02 12:38:38,743 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 156 transitions, 1950 flow [2024-12-02 12:38:38,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 27.1875) internal successors, (435), 16 states have internal predecessors, (435), 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-12-02 12:38:38,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:38,743 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:38,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 12:38:38,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:38,944 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:38,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:38,944 INFO L85 PathProgramCache]: Analyzing trace with hash 566277670, now seen corresponding path program 3 times [2024-12-02 12:38:38,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:38,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739720502] [2024-12-02 12:38:38,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 12:38:38,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:38,958 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-02 12:38:38,959 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:38:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 12:38:39,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:39,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739720502] [2024-12-02 12:38:39,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739720502] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:39,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670312115] [2024-12-02 12:38:39,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 12:38:39,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:39,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:39,186 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:39,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 12:38:39,289 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-02 12:38:39,289 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:38:39,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-02 12:38:39,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 12:38:39,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:39,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2024-12-02 12:38:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 12:38:39,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670312115] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:39,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:39,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2024-12-02 12:38:39,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800955732] [2024-12-02 12:38:39,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:39,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 12:38:39,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:39,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 12:38:39,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-12-02 12:38:40,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:38:40,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 156 transitions, 1950 flow. Second operand has 22 states, 22 states have (on average 27.0) internal successors, (594), 22 states have internal predecessors, (594), 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-12-02 12:38:40,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:40,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:38:40,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:46,635 INFO L124 PetriNetUnfolderBase]: 36463/53779 cut-off events. [2024-12-02 12:38:46,635 INFO L125 PetriNetUnfolderBase]: For 100309/100977 co-relation queries the response was YES. [2024-12-02 12:38:46,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183785 conditions, 53779 events. 36463/53779 cut-off events. For 100309/100977 co-relation queries the response was YES. Maximal size of possible extension queue 2723. Compared 423846 event pairs, 8679 based on Foata normal form. 286/50688 useless extension candidates. Maximal degree in co-relation 156704. Up to 19239 conditions per place. [2024-12-02 12:38:47,115 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 201 selfloop transitions, 55 changer transitions 0/272 dead transitions. [2024-12-02 12:38:47,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 272 transitions, 3175 flow [2024-12-02 12:38:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 12:38:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-12-02 12:38:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 395 transitions. [2024-12-02 12:38:47,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2024-12-02 12:38:47,117 INFO L175 Difference]: Start difference. First operand has 157 places, 156 transitions, 1950 flow. Second operand 11 states and 395 transitions. [2024-12-02 12:38:47,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 272 transitions, 3175 flow [2024-12-02 12:38:47,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 272 transitions, 3069 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-12-02 12:38:47,522 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 1952 flow [2024-12-02 12:38:47,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1952, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2024-12-02 12:38:47,522 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 84 predicate places. [2024-12-02 12:38:47,523 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 1952 flow [2024-12-02 12:38:47,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 27.0) internal successors, (594), 22 states have internal predecessors, (594), 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-12-02 12:38:47,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:47,523 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:38:47,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 12:38:47,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-12-02 12:38:47,723 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:47,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash -315386831, now seen corresponding path program 3 times [2024-12-02 12:38:47,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:47,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494842972] [2024-12-02 12:38:47,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 12:38:47,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:47,752 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-02 12:38:47,753 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:38:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 12:38:48,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:48,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494842972] [2024-12-02 12:38:48,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494842972] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:38:48,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872868666] [2024-12-02 12:38:48,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 12:38:48,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:48,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:38:48,127 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:38:48,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 12:38:48,298 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-02 12:38:48,298 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:38:48,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-12-02 12:38:48,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:38:48,323 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-12-02 12:38:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 12:38:48,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:38:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 12:38:48,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872868666] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:38:48,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:38:48,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2024-12-02 12:38:48,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107928075] [2024-12-02 12:38:48,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:38:48,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-12-02 12:38:48,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:48,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-12-02 12:38:48,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2024-12-02 12:38:49,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:38:49,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 1952 flow. Second operand has 23 states, 23 states have (on average 27.347826086956523) internal successors, (629), 23 states have internal predecessors, (629), 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-12-02 12:38:49,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:49,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:38:49,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:38:57,079 INFO L124 PetriNetUnfolderBase]: 38486/56567 cut-off events. [2024-12-02 12:38:57,079 INFO L125 PetriNetUnfolderBase]: For 107219/107219 co-relation queries the response was YES. [2024-12-02 12:38:57,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193840 conditions, 56567 events. 38486/56567 cut-off events. For 107219/107219 co-relation queries the response was YES. Maximal size of possible extension queue 2923. Compared 451781 event pairs, 1662 based on Foata normal form. 760/53823 useless extension candidates. Maximal degree in co-relation 167967. Up to 14152 conditions per place. [2024-12-02 12:38:57,522 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 231 selfloop transitions, 66 changer transitions 0/314 dead transitions. [2024-12-02 12:38:57,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 314 transitions, 3413 flow [2024-12-02 12:38:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 12:38:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-12-02 12:38:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 509 transitions. [2024-12-02 12:38:57,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2024-12-02 12:38:57,524 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 1952 flow. Second operand 14 states and 509 transitions. [2024-12-02 12:38:57,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 314 transitions, 3413 flow [2024-12-02 12:38:57,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 314 transitions, 3146 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-12-02 12:38:57,650 INFO L231 Difference]: Finished difference. Result has 164 places, 169 transitions, 2089 flow [2024-12-02 12:38:57,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2089, PETRI_PLACES=164, PETRI_TRANSITIONS=169} [2024-12-02 12:38:57,650 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 88 predicate places. [2024-12-02 12:38:57,651 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 169 transitions, 2089 flow [2024-12-02 12:38:57,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 27.347826086956523) internal successors, (629), 23 states have internal predecessors, (629), 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-12-02 12:38:57,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:38:57,651 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] [2024-12-02 12:38:57,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 12:38:57,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:38:57,852 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:38:57,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:38:57,852 INFO L85 PathProgramCache]: Analyzing trace with hash 677078008, now seen corresponding path program 1 times [2024-12-02 12:38:57,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:38:57,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193943169] [2024-12-02 12:38:57,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:38:57,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:38:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:38:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:38:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:38:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193943169] [2024-12-02 12:38:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193943169] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:38:57,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:38:57,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:38:57,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767557913] [2024-12-02 12:38:57,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:38:57,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:38:57,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:38:57,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:38:57,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:38:57,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2024-12-02 12:38:57,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 169 transitions, 2089 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-12-02 12:38:57,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:38:57,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2024-12-02 12:38:57,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:39:01,897 INFO L124 PetriNetUnfolderBase]: 18853/33763 cut-off events. [2024-12-02 12:39:01,897 INFO L125 PetriNetUnfolderBase]: For 80597/81329 co-relation queries the response was YES. [2024-12-02 12:39:02,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113040 conditions, 33763 events. 18853/33763 cut-off events. For 80597/81329 co-relation queries the response was YES. Maximal size of possible extension queue 2011. Compared 331246 event pairs, 8817 based on Foata normal form. 60/32308 useless extension candidates. Maximal degree in co-relation 99189. Up to 14363 conditions per place. [2024-12-02 12:39:02,154 INFO L140 encePairwiseOnDemand]: 73/75 looper letters, 159 selfloop transitions, 4 changer transitions 0/190 dead transitions. [2024-12-02 12:39:02,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 190 transitions, 2529 flow [2024-12-02 12:39:02,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:39:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 12:39:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2024-12-02 12:39:02,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5911111111111111 [2024-12-02 12:39:02,155 INFO L175 Difference]: Start difference. First operand has 164 places, 169 transitions, 2089 flow. Second operand 3 states and 133 transitions. [2024-12-02 12:39:02,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 190 transitions, 2529 flow [2024-12-02 12:39:02,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 190 transitions, 2392 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-12-02 12:39:02,278 INFO L231 Difference]: Finished difference. Result has 158 places, 168 transitions, 1954 flow [2024-12-02 12:39:02,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1954, PETRI_PLACES=158, PETRI_TRANSITIONS=168} [2024-12-02 12:39:02,278 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 82 predicate places. [2024-12-02 12:39:02,278 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 168 transitions, 1954 flow [2024-12-02 12:39:02,278 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-12-02 12:39:02,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:39:02,279 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] [2024-12-02 12:39:02,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 12:39:02,279 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:39:02,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:39:02,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1752820066, now seen corresponding path program 1 times [2024-12-02 12:39:02,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:39:02,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570629472] [2024-12-02 12:39:02,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:39:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:39:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:39:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:39:02,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:39:02,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570629472] [2024-12-02 12:39:02,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570629472] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:39:02,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:39:02,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:39:02,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049015284] [2024-12-02 12:39:02,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:39:02,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:39:02,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:39:02,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:39:02,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:39:02,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2024-12-02 12:39:02,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 168 transitions, 1954 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-12-02 12:39:02,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:39:02,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2024-12-02 12:39:02,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:39:07,651 INFO L124 PetriNetUnfolderBase]: 24519/43888 cut-off events. [2024-12-02 12:39:07,651 INFO L125 PetriNetUnfolderBase]: For 96406/96750 co-relation queries the response was YES. [2024-12-02 12:39:07,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133183 conditions, 43888 events. 24519/43888 cut-off events. For 96406/96750 co-relation queries the response was YES. Maximal size of possible extension queue 2379. Compared 434603 event pairs, 8869 based on Foata normal form. 76/42366 useless extension candidates. Maximal degree in co-relation 117315. Up to 20386 conditions per place. [2024-12-02 12:39:08,074 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 162 selfloop transitions, 4 changer transitions 10/203 dead transitions. [2024-12-02 12:39:08,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 203 transitions, 2584 flow [2024-12-02 12:39:08,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:39:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 12:39:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-12-02 12:39:08,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822222222222222 [2024-12-02 12:39:08,075 INFO L175 Difference]: Start difference. First operand has 158 places, 168 transitions, 1954 flow. Second operand 3 states and 131 transitions. [2024-12-02 12:39:08,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 203 transitions, 2584 flow [2024-12-02 12:39:08,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 203 transitions, 2569 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 12:39:08,240 INFO L231 Difference]: Finished difference. Result has 159 places, 162 transitions, 1818 flow [2024-12-02 12:39:08,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1818, PETRI_PLACES=159, PETRI_TRANSITIONS=162} [2024-12-02 12:39:08,241 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 83 predicate places. [2024-12-02 12:39:08,241 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 162 transitions, 1818 flow [2024-12-02 12:39:08,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-12-02 12:39:08,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:39:08,241 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] [2024-12-02 12:39:08,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 12:39:08,241 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:39:08,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:39:08,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1856814654, now seen corresponding path program 1 times [2024-12-02 12:39:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:39:08,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613732586] [2024-12-02 12:39:08,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:39:08,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:39:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:39:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:39:08,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:39:08,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613732586] [2024-12-02 12:39:08,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613732586] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:39:08,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:39:08,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:39:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229383990] [2024-12-02 12:39:08,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:39:08,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:39:08,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:39:08,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:39:08,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:39:08,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2024-12-02 12:39:08,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 162 transitions, 1818 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-12-02 12:39:08,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:39:08,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2024-12-02 12:39:08,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:39:12,283 INFO L124 PetriNetUnfolderBase]: 18322/32022 cut-off events. [2024-12-02 12:39:12,284 INFO L125 PetriNetUnfolderBase]: For 82191/82335 co-relation queries the response was YES. [2024-12-02 12:39:12,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106445 conditions, 32022 events. 18322/32022 cut-off events. For 82191/82335 co-relation queries the response was YES. Maximal size of possible extension queue 1771. Compared 299842 event pairs, 6761 based on Foata normal form. 848/31556 useless extension candidates. Maximal degree in co-relation 95258. Up to 16867 conditions per place. [2024-12-02 12:39:12,562 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 140 selfloop transitions, 13 changer transitions 10/188 dead transitions. [2024-12-02 12:39:12,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 188 transitions, 2283 flow [2024-12-02 12:39:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:39:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 12:39:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-12-02 12:39:12,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-12-02 12:39:12,564 INFO L175 Difference]: Start difference. First operand has 159 places, 162 transitions, 1818 flow. Second operand 3 states and 135 transitions. [2024-12-02 12:39:12,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 188 transitions, 2283 flow [2024-12-02 12:39:12,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 188 transitions, 2258 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-12-02 12:39:12,786 INFO L231 Difference]: Finished difference. Result has 160 places, 151 transitions, 1651 flow [2024-12-02 12:39:12,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1777, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=160, PETRI_TRANSITIONS=151} [2024-12-02 12:39:12,786 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 84 predicate places. [2024-12-02 12:39:12,786 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 151 transitions, 1651 flow [2024-12-02 12:39:12,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-12-02 12:39:12,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:39:12,787 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, 1, 1] [2024-12-02 12:39:12,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 12:39:12,787 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:39:12,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:39:12,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1421563271, now seen corresponding path program 1 times [2024-12-02 12:39:12,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:39:12,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950955087] [2024-12-02 12:39:12,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:39:12,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:39:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:39:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:39:12,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:39:12,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950955087] [2024-12-02 12:39:12,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950955087] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:39:12,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:39:12,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:39:12,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777467770] [2024-12-02 12:39:12,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:39:12,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:39:12,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:39:12,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:39:12,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:39:13,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 75 [2024-12-02 12:39:13,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 151 transitions, 1651 flow. Second operand has 6 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 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-12-02 12:39:13,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:39:13,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 75 [2024-12-02 12:39:13,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:39:17,367 INFO L124 PetriNetUnfolderBase]: 21774/35808 cut-off events. [2024-12-02 12:39:17,367 INFO L125 PetriNetUnfolderBase]: For 101564/101780 co-relation queries the response was YES. [2024-12-02 12:39:17,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125563 conditions, 35808 events. 21774/35808 cut-off events. For 101564/101780 co-relation queries the response was YES. Maximal size of possible extension queue 1960. Compared 307607 event pairs, 4130 based on Foata normal form. 1164/36382 useless extension candidates. Maximal degree in co-relation 117516. Up to 23959 conditions per place. [2024-12-02 12:39:17,626 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 129 selfloop transitions, 23 changer transitions 18/192 dead transitions. [2024-12-02 12:39:17,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 192 transitions, 2250 flow [2024-12-02 12:39:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 12:39:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 12:39:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2024-12-02 12:39:17,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-12-02 12:39:17,627 INFO L175 Difference]: Start difference. First operand has 160 places, 151 transitions, 1651 flow. Second operand 6 states and 216 transitions. [2024-12-02 12:39:17,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 192 transitions, 2250 flow [2024-12-02 12:39:17,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 192 transitions, 2162 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-12-02 12:39:17,988 INFO L231 Difference]: Finished difference. Result has 147 places, 132 transitions, 1372 flow [2024-12-02 12:39:17,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1372, PETRI_PLACES=147, PETRI_TRANSITIONS=132} [2024-12-02 12:39:17,989 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 71 predicate places. [2024-12-02 12:39:17,989 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 132 transitions, 1372 flow [2024-12-02 12:39:17,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 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-12-02 12:39:17,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:39:17,989 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, 1, 1] [2024-12-02 12:39:17,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 12:39:17,990 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:39:17,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:39:17,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1696069207, now seen corresponding path program 1 times [2024-12-02 12:39:17,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:39:17,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488800626] [2024-12-02 12:39:17,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:39:17,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:39:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:39:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 12:39:18,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:39:18,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488800626] [2024-12-02 12:39:18,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488800626] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:39:18,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:39:18,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:39:18,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347881990] [2024-12-02 12:39:18,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:39:18,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:39:18,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:39:18,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:39:18,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:39:18,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 75 [2024-12-02 12:39:18,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 132 transitions, 1372 flow. Second operand has 6 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 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-12-02 12:39:18,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:39:18,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 75 [2024-12-02 12:39:18,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:39:20,526 INFO L124 PetriNetUnfolderBase]: 14784/23661 cut-off events. [2024-12-02 12:39:20,526 INFO L125 PetriNetUnfolderBase]: For 72750/73408 co-relation queries the response was YES. [2024-12-02 12:39:20,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85204 conditions, 23661 events. 14784/23661 cut-off events. For 72750/73408 co-relation queries the response was YES. Maximal size of possible extension queue 1281. Compared 189650 event pairs, 2847 based on Foata normal form. 1452/24620 useless extension candidates. Maximal degree in co-relation 66256. Up to 13185 conditions per place. [2024-12-02 12:39:20,714 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 113 selfloop transitions, 15 changer transitions 12/160 dead transitions. [2024-12-02 12:39:20,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 160 transitions, 1814 flow [2024-12-02 12:39:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 12:39:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 12:39:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2024-12-02 12:39:20,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47555555555555556 [2024-12-02 12:39:20,715 INFO L175 Difference]: Start difference. First operand has 147 places, 132 transitions, 1372 flow. Second operand 6 states and 214 transitions. [2024-12-02 12:39:20,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 160 transitions, 1814 flow [2024-12-02 12:39:20,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 160 transitions, 1722 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-12-02 12:39:20,834 INFO L231 Difference]: Finished difference. Result has 139 places, 118 transitions, 1142 flow [2024-12-02 12:39:20,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1142, PETRI_PLACES=139, PETRI_TRANSITIONS=118} [2024-12-02 12:39:20,835 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 63 predicate places. [2024-12-02 12:39:20,835 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 118 transitions, 1142 flow [2024-12-02 12:39:20,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 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-12-02 12:39:20,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:39:20,835 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, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:39:20,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 12:39:20,835 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:39:20,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:39:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1793326187, now seen corresponding path program 1 times [2024-12-02 12:39:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:39:20,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992843948] [2024-12-02 12:39:20,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:39:20,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:39:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:39:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 12:39:20,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:39:20,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992843948] [2024-12-02 12:39:20,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992843948] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:39:20,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889724288] [2024-12-02 12:39:20,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:39:20,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:39:20,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:39:20,985 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:39:20,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 12:39:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:39:21,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-02 12:39:21,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:39:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 12:39:21,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:39:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 12:39:21,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889724288] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 12:39:21,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-02 12:39:21,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 5] total 15 [2024-12-02 12:39:21,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103650375] [2024-12-02 12:39:21,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:39:21,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 12:39:21,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:39:21,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 12:39:21,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-12-02 12:39:21,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75 [2024-12-02 12:39:21,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 118 transitions, 1142 flow. Second operand has 8 states, 8 states have (on average 26.25) internal successors, (210), 8 states have internal predecessors, (210), 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-12-02 12:39:21,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:39:21,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75 [2024-12-02 12:39:21,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:39:26,943 INFO L124 PetriNetUnfolderBase]: 32607/50585 cut-off events. [2024-12-02 12:39:26,944 INFO L125 PetriNetUnfolderBase]: For 123954/126004 co-relation queries the response was YES. [2024-12-02 12:39:27,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176593 conditions, 50585 events. 32607/50585 cut-off events. For 123954/126004 co-relation queries the response was YES. Maximal size of possible extension queue 2399. Compared 413274 event pairs, 2520 based on Foata normal form. 1128/46877 useless extension candidates. Maximal degree in co-relation 133927. Up to 13242 conditions per place. [2024-12-02 12:39:27,301 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 193 selfloop transitions, 82 changer transitions 0/294 dead transitions. [2024-12-02 12:39:27,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 294 transitions, 2797 flow [2024-12-02 12:39:27,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 12:39:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-12-02 12:39:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 498 transitions. [2024-12-02 12:39:27,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44266666666666665 [2024-12-02 12:39:27,302 INFO L175 Difference]: Start difference. First operand has 139 places, 118 transitions, 1142 flow. Second operand 15 states and 498 transitions. [2024-12-02 12:39:27,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 294 transitions, 2797 flow [2024-12-02 12:39:27,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 294 transitions, 2727 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-12-02 12:39:27,747 INFO L231 Difference]: Finished difference. Result has 155 places, 174 transitions, 2047 flow [2024-12-02 12:39:27,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2047, PETRI_PLACES=155, PETRI_TRANSITIONS=174} [2024-12-02 12:39:27,748 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 79 predicate places. [2024-12-02 12:39:27,748 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 174 transitions, 2047 flow [2024-12-02 12:39:27,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.25) internal successors, (210), 8 states have internal predecessors, (210), 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-12-02 12:39:27,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:39:27,748 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, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:39:27,753 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 12:39:27,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:39:27,949 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:39:27,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:39:27,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1643453829, now seen corresponding path program 2 times [2024-12-02 12:39:27,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:39:27,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584914650] [2024-12-02 12:39:27,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:39:27,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:39:27,969 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:39:27,969 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:39:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 12:39:28,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:39:28,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584914650] [2024-12-02 12:39:28,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584914650] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:39:28,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:39:28,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 12:39:28,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817849086] [2024-12-02 12:39:28,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:39:28,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:39:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:39:28,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:39:28,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:39:28,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 75 [2024-12-02 12:39:28,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 174 transitions, 2047 flow. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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-12-02 12:39:28,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:39:28,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 75 [2024-12-02 12:39:28,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:39:30,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][211], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, Black: 273#(<= ~n1~0 0), 21#L58true, 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 617#true, Black: 292#(<= ~n2~0 0), 62#L145true, 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 301#true, 160#(<= ~n2~0 2147483647), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 317#(= (select |#valid| ~q1~0.base) 1), Black: 621#(<= ~n1~0 1), Black: 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 738#true, Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 869#(<= 0 ~i~0), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 1368#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 17#L110true, 923#(and (<= 1 ~i~0) (<= ~N~0 1)), 1467#(= (select |#valid| ~q2~0.base) 1), 1803#(<= ~q2_front~0 ~q2_back~0), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))))]) [2024-12-02 12:39:30,933 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-12-02 12:39:30,933 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-12-02 12:39:30,933 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 12:39:30,933 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-12-02 12:39:31,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][211], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 273#(<= ~n1~0 0), 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 617#true, Black: 292#(<= ~n2~0 0), 62#L145true, 40#thread1EXITtrue, 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 301#true, 160#(<= ~n2~0 2147483647), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 317#(= (select |#valid| ~q1~0.base) 1), Black: 621#(<= ~n1~0 1), Black: 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 738#true, Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 1368#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), 1803#(<= ~q2_front~0 ~q2_back~0), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))))]) [2024-12-02 12:39:31,352 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-12-02 12:39:31,352 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 12:39:31,352 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 12:39:31,352 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 12:39:31,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][211], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 273#(<= ~n1~0 0), 21#L58true, 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 617#true, Black: 292#(<= ~n2~0 0), 62#L145true, 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 300#(= (select |#valid| ~f~0.base) 1), 1454#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 317#(= (select |#valid| ~q1~0.base) 1), Black: 621#(<= ~n1~0 1), Black: 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 738#true, Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 869#(<= 0 ~i~0), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 5#thread2EXITtrue, 17#L110true, 923#(and (<= 1 ~i~0) (<= ~N~0 1)), 1467#(= (select |#valid| ~q2~0.base) 1), 1803#(<= ~q2_front~0 ~q2_back~0), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))))]) [2024-12-02 12:39:31,357 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-12-02 12:39:31,357 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 12:39:31,357 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 12:39:31,357 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 12:39:31,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][211], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 273#(<= ~n1~0 0), 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 617#true, Black: 292#(<= ~n2~0 0), 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), 74#L145-1true, 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 301#true, 160#(<= ~n2~0 2147483647), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 317#(= (select |#valid| ~q1~0.base) 1), Black: 621#(<= ~n1~0 1), Black: 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 738#true, Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 1368#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), 1803#(<= ~q2_front~0 ~q2_back~0), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1))]) [2024-12-02 12:39:31,543 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-12-02 12:39:31,543 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 12:39:31,543 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 12:39:31,543 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 12:39:31,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][211], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 273#(<= ~n1~0 0), 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 617#true, Black: 292#(<= ~n2~0 0), 62#L145true, 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 40#thread1EXITtrue, Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 300#(= (select |#valid| ~f~0.base) 1), 1454#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 317#(= (select |#valid| ~q1~0.base) 1), Black: 621#(<= ~n1~0 1), Black: 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 738#true, Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 5#thread2EXITtrue, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), 1803#(<= ~q2_front~0 ~q2_back~0), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))))]) [2024-12-02 12:39:31,730 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-12-02 12:39:31,730 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 12:39:31,730 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 12:39:31,730 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 12:39:31,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][196], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), 869#(<= 0 ~i~0), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, Black: 273#(<= ~n1~0 0), 21#L58true, 1006#(<= 0 ~j~0), Black: 292#(<= ~n2~0 0), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 301#true, Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 300#(= (select |#valid| ~f~0.base) 1), 317#(= (select |#valid| ~q1~0.base) 1), Black: 617#true, Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 738#true, 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 38#L144-4true, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), 1458#(and (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1))]) [2024-12-02 12:39:31,964 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-12-02 12:39:31,964 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 12:39:31,964 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 12:39:31,964 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 12:39:32,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][211], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 273#(<= ~n1~0 0), 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 617#true, Black: 292#(<= ~n2~0 0), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 74#L145-1true, Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 300#(= (select |#valid| ~f~0.base) 1), 1454#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 317#(= (select |#valid| ~q1~0.base) 1), Black: 621#(<= ~n1~0 1), Black: 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 738#true, Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 5#thread2EXITtrue, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), 1803#(<= ~q2_front~0 ~q2_back~0), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1))]) [2024-12-02 12:39:32,048 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-12-02 12:39:32,048 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 12:39:32,048 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 12:39:32,048 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 12:39:32,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][211], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 273#(<= ~n1~0 0), 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 617#true, Black: 292#(<= ~n2~0 0), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 300#(= (select |#valid| ~f~0.base) 1), 1454#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 317#(= (select |#valid| ~q1~0.base) 1), 22#L146true, Black: 621#(<= ~n1~0 1), Black: 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 738#true, Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), 1803#(<= ~q2_front~0 ~q2_back~0), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))))]) [2024-12-02 12:39:32,048 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 12:39:32,048 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 12:39:32,048 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 12:39:32,048 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 12:39:32,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][196], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, 869#(<= 0 ~i~0), Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, Black: 273#(<= ~n1~0 0), 21#L58true, 1006#(<= 0 ~j~0), Black: 292#(<= ~n2~0 0), 62#L145true, 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 301#true, Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 300#(= (select |#valid| ~f~0.base) 1), 317#(= (select |#valid| ~q1~0.base) 1), Black: 617#true, Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 738#true, 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), 1458#(and (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))))]) [2024-12-02 12:39:32,093 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-12-02 12:39:32,093 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 12:39:32,093 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 12:39:32,093 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 12:39:32,189 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][196], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 996#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 56#thread3EXITtrue, Black: 273#(<= ~n1~0 0), 1006#(<= 0 ~j~0), Black: 292#(<= ~n2~0 0), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), 40#thread1EXITtrue, 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 301#true, Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 300#(= (select |#valid| ~f~0.base) 1), 317#(= (select |#valid| ~q1~0.base) 1), Black: 617#true, Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 738#true, 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 38#L144-4true, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), 1458#(and (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1))]) [2024-12-02 12:39:32,189 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 12:39:32,189 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 12:39:32,189 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 12:39:32,189 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 12:39:32,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][196], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, 869#(<= 0 ~i~0), Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, Black: 273#(<= ~n1~0 0), 21#L58true, Black: 292#(<= ~n2~0 0), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 300#(= (select |#valid| ~f~0.base) 1), 1145#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0)), 317#(= (select |#valid| ~q1~0.base) 1), Black: 617#true, 1460#(and (or (and (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~cond~1#1| 256))) (< (+ 3 (* ~j~0 4) ~f~0.offset) (select |#length| ~f~0.base))) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 738#true, 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 38#L144-4true, 5#thread2EXITtrue, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1))]) [2024-12-02 12:39:32,197 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 12:39:32,197 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 12:39:32,198 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 12:39:32,198 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 12:39:32,271 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][196], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 996#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 56#thread3EXITtrue, Black: 273#(<= ~n1~0 0), 1006#(<= 0 ~j~0), Black: 292#(<= ~n2~0 0), 62#L145true, 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), 40#thread1EXITtrue, 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 301#true, Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 300#(= (select |#valid| ~f~0.base) 1), 317#(= (select |#valid| ~q1~0.base) 1), Black: 617#true, Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 738#true, 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), 1458#(and (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1))]) [2024-12-02 12:39:32,271 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-12-02 12:39:32,271 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 12:39:32,271 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-12-02 12:39:32,271 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 12:39:32,271 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][196], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 996#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 56#thread3EXITtrue, Black: 273#(<= ~n1~0 0), 1006#(<= 0 ~j~0), Black: 292#(<= ~n2~0 0), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), 74#L145-1true, 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 301#true, Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 300#(= (select |#valid| ~f~0.base) 1), 317#(= (select |#valid| ~q1~0.base) 1), Black: 617#true, Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 738#true, 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), 1458#(and (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1))]) [2024-12-02 12:39:32,272 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-12-02 12:39:32,272 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 12:39:32,272 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-12-02 12:39:32,272 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 12:39:32,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][196], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, 869#(<= 0 ~i~0), Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, Black: 273#(<= ~n1~0 0), 21#L58true, Black: 292#(<= ~n2~0 0), 62#L145true, 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1145#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0)), 317#(= (select |#valid| ~q1~0.base) 1), Black: 617#true, 1460#(and (or (and (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~cond~1#1| 256))) (< (+ 3 (* ~j~0 4) ~f~0.offset) (select |#length| ~f~0.base))) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 738#true, 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 5#thread2EXITtrue, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1006#(<= 0 ~j~0), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1))]) [2024-12-02 12:39:32,277 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-12-02 12:39:32,277 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 12:39:32,277 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-12-02 12:39:32,277 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 12:39:32,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][196], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 996#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 56#thread3EXITtrue, Black: 273#(<= ~n1~0 0), Black: 292#(<= ~n2~0 0), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 40#thread1EXITtrue, 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 300#(= (select |#valid| ~f~0.base) 1), 1145#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0)), 317#(= (select |#valid| ~q1~0.base) 1), Black: 617#true, 1460#(and (or (and (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~cond~1#1| 256))) (< (+ 3 (* ~j~0 4) ~f~0.offset) (select |#length| ~f~0.base))) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 738#true, 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 38#L144-4true, 5#thread2EXITtrue, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))))]) [2024-12-02 12:39:32,325 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-12-02 12:39:32,325 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 12:39:32,325 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 12:39:32,325 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-12-02 12:39:32,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][196], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 996#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 56#thread3EXITtrue, Black: 273#(<= ~n1~0 0), Black: 292#(<= ~n2~0 0), 62#L145true, 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 40#thread1EXITtrue, 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1145#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0)), 317#(= (select |#valid| ~q1~0.base) 1), Black: 617#true, 1460#(and (or (and (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~cond~1#1| 256))) (< (+ 3 (* ~j~0 4) ~f~0.offset) (select |#length| ~f~0.base))) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 738#true, 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 5#thread2EXITtrue, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1006#(<= 0 ~j~0), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1))]) [2024-12-02 12:39:32,359 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-12-02 12:39:32,359 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 12:39:32,359 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 12:39:32,359 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-12-02 12:39:32,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][196], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 996#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 56#thread3EXITtrue, Black: 273#(<= ~n1~0 0), Black: 292#(<= ~n2~0 0), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 74#L145-1true, 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1145#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0)), 317#(= (select |#valid| ~q1~0.base) 1), Black: 617#true, 1460#(and (or (and (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~cond~1#1| 256))) (< (+ 3 (* ~j~0 4) ~f~0.offset) (select |#length| ~f~0.base))) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 738#true, 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 5#thread2EXITtrue, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1006#(<= 0 ~j~0), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1))]) [2024-12-02 12:39:32,360 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-12-02 12:39:32,360 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-12-02 12:39:32,360 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-12-02 12:39:32,360 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-12-02 12:39:32,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][196], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 996#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 56#thread3EXITtrue, Black: 273#(<= ~n1~0 0), Black: 292#(<= ~n2~0 0), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1145#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0)), 317#(= (select |#valid| ~q1~0.base) 1), Black: 617#true, 22#L146true, 1460#(and (or (and (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~cond~1#1| 256))) (< (+ 3 (* ~j~0 4) ~f~0.offset) (select |#length| ~f~0.base))) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 738#true, 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1006#(<= 0 ~j~0), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1))]) [2024-12-02 12:39:32,382 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-12-02 12:39:32,382 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-12-02 12:39:32,382 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-12-02 12:39:32,382 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-12-02 12:39:32,406 INFO L124 PetriNetUnfolderBase]: 19719/32351 cut-off events. [2024-12-02 12:39:32,406 INFO L125 PetriNetUnfolderBase]: For 170214/171412 co-relation queries the response was YES. [2024-12-02 12:39:32,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144484 conditions, 32351 events. 19719/32351 cut-off events. For 170214/171412 co-relation queries the response was YES. Maximal size of possible extension queue 1707. Compared 281422 event pairs, 3733 based on Foata normal form. 1464/33233 useless extension candidates. Maximal degree in co-relation 113475. Up to 13228 conditions per place. [2024-12-02 12:39:32,688 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 198 selfloop transitions, 40 changer transitions 0/264 dead transitions. [2024-12-02 12:39:32,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 264 transitions, 3331 flow [2024-12-02 12:39:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 12:39:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 12:39:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2024-12-02 12:39:32,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5177777777777778 [2024-12-02 12:39:32,689 INFO L175 Difference]: Start difference. First operand has 155 places, 174 transitions, 2047 flow. Second operand 6 states and 233 transitions. [2024-12-02 12:39:32,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 264 transitions, 3331 flow [2024-12-02 12:39:33,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 264 transitions, 3184 flow, removed 67 selfloop flow, removed 2 redundant places. [2024-12-02 12:39:33,754 INFO L231 Difference]: Finished difference. Result has 162 places, 187 transitions, 2259 flow [2024-12-02 12:39:33,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2259, PETRI_PLACES=162, PETRI_TRANSITIONS=187} [2024-12-02 12:39:33,754 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 86 predicate places. [2024-12-02 12:39:33,754 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 187 transitions, 2259 flow [2024-12-02 12:39:33,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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-12-02 12:39:33,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:39:33,755 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, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:39:33,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 12:39:33,755 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:39:33,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:39:33,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2129950741, now seen corresponding path program 1 times [2024-12-02 12:39:33,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:39:33,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885652099] [2024-12-02 12:39:33,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:39:33,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:39:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:39:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 12:39:33,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:39:33,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885652099] [2024-12-02 12:39:33,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885652099] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:39:33,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:39:33,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:39:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962393041] [2024-12-02 12:39:33,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:39:33,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:39:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:39:33,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:39:33,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:39:33,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 75 [2024-12-02 12:39:33,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 187 transitions, 2259 flow. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 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-12-02 12:39:33,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:39:33,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 75 [2024-12-02 12:39:33,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:39:36,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1075] L71-->L79: Formula: (let ((.cse1 (* v_~j~0_115 4))) (let ((.cse0 (* 4 v_~q2_back~0_145)) (.cse4 (+ v_~f~0.offset_129 .cse1))) (let ((.cse3 (select (select |v_#memory_int#1_110| v_~f~0.base_136) .cse4)) (.cse2 (+ v_~q2~0.offset_121 .cse0))) (and (= (select |v_#valid_276| v_~q2~0.base_129) 1) (<= (+ v_~q2~0.offset_121 4 .cse0) (select |v_#length_265| v_~q2~0.base_129)) (not (= (ite (< v_~q2_back~0_145 2147483647) 1 0) 0)) (<= (+ v_~f~0.offset_129 .cse1 4) (select |v_#length_265| v_~f~0.base_136)) (not (= (ite (= (+ (select (select |v_#memory_int#1_110| v_~q2~0.base_129) .cse2) .cse3) 0) 1 0) 0)) (not (= (ite (and (< v_~q2_back~0_145 v_~n2~0_108) (<= 0 v_~q2_back~0_145)) 1 0) 0)) (not (= (ite (< 0 (+ 2147483648 .cse3)) 1 0) 0)) (<= 0 .cse4) (= (+ v_~q2_back~0_145 1) v_~q2_back~0_144) (= (select |v_#valid_276| v_~f~0.base_136) 1) (<= 0 .cse2) (= v_~j~0_114 (+ v_~j~0_115 1)))))) InVars {~j~0=v_~j~0_115, ~n2~0=v_~n2~0_108, ~f~0.base=v_~f~0.base_136, ~q2~0.offset=v_~q2~0.offset_121, #valid=|v_#valid_276|, #length=|v_#length_265|, ~q2~0.base=v_~q2~0.base_129, #memory_int#1=|v_#memory_int#1_110|, ~f~0.offset=v_~f~0.offset_129, ~q2_back~0=v_~q2_back~0_145} OutVars{~j~0=v_~j~0_114, ~n2~0=v_~n2~0_108, ~f~0.base=v_~f~0.base_136, ~q2~0.offset=v_~q2~0.offset_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_110|, ~f~0.offset=v_~f~0.offset_129, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_5|, #valid=|v_#valid_276|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_9|, #length=|v_#length_265|, ~q2~0.base=v_~q2~0.base_129, ~q2_back~0=v_~q2_back~0_144} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][219], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1809#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1807#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 273#(<= ~n1~0 0), Black: 1803#(<= ~q2_front~0 ~q2_back~0), 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 292#(<= ~n2~0 0), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), 57#L118true, 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), 74#L145-1true, 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 301#true, 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 1814#true, 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 317#(= (select |#valid| ~q1~0.base) 1), Black: 617#true, Black: 621#(<= ~n1~0 1), Black: 738#true, Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 1368#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))))]) [2024-12-02 12:39:36,322 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-12-02 12:39:36,323 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-12-02 12:39:36,323 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-12-02 12:39:36,323 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-12-02 12:39:37,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1075] L71-->L79: Formula: (let ((.cse1 (* v_~j~0_115 4))) (let ((.cse0 (* 4 v_~q2_back~0_145)) (.cse4 (+ v_~f~0.offset_129 .cse1))) (let ((.cse3 (select (select |v_#memory_int#1_110| v_~f~0.base_136) .cse4)) (.cse2 (+ v_~q2~0.offset_121 .cse0))) (and (= (select |v_#valid_276| v_~q2~0.base_129) 1) (<= (+ v_~q2~0.offset_121 4 .cse0) (select |v_#length_265| v_~q2~0.base_129)) (not (= (ite (< v_~q2_back~0_145 2147483647) 1 0) 0)) (<= (+ v_~f~0.offset_129 .cse1 4) (select |v_#length_265| v_~f~0.base_136)) (not (= (ite (= (+ (select (select |v_#memory_int#1_110| v_~q2~0.base_129) .cse2) .cse3) 0) 1 0) 0)) (not (= (ite (and (< v_~q2_back~0_145 v_~n2~0_108) (<= 0 v_~q2_back~0_145)) 1 0) 0)) (not (= (ite (< 0 (+ 2147483648 .cse3)) 1 0) 0)) (<= 0 .cse4) (= (+ v_~q2_back~0_145 1) v_~q2_back~0_144) (= (select |v_#valid_276| v_~f~0.base_136) 1) (<= 0 .cse2) (= v_~j~0_114 (+ v_~j~0_115 1)))))) InVars {~j~0=v_~j~0_115, ~n2~0=v_~n2~0_108, ~f~0.base=v_~f~0.base_136, ~q2~0.offset=v_~q2~0.offset_121, #valid=|v_#valid_276|, #length=|v_#length_265|, ~q2~0.base=v_~q2~0.base_129, #memory_int#1=|v_#memory_int#1_110|, ~f~0.offset=v_~f~0.offset_129, ~q2_back~0=v_~q2_back~0_145} OutVars{~j~0=v_~j~0_114, ~n2~0=v_~n2~0_108, ~f~0.base=v_~f~0.base_136, ~q2~0.offset=v_~q2~0.offset_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_110|, ~f~0.offset=v_~f~0.offset_129, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_5|, #valid=|v_#valid_276|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_9|, #length=|v_#length_265|, ~q2~0.base=v_~q2~0.base_129, ~q2_back~0=v_~q2_back~0_144} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][231], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1774#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1809#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1807#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 273#(<= ~n1~0 0), Black: 1803#(<= ~q2_front~0 ~q2_back~0), Black: 292#(<= ~n2~0 0), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), 57#L118true, 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), 74#L145-1true, 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 301#true, 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 1814#true, Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 300#(= (select |#valid| ~f~0.base) 1), 317#(= (select |#valid| ~q1~0.base) 1), Black: 617#true, Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 738#true, 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 1368#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 1776#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))))]) [2024-12-02 12:39:37,203 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-12-02 12:39:37,203 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 12:39:37,203 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 12:39:37,203 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 12:39:40,169 INFO L124 PetriNetUnfolderBase]: 26230/43324 cut-off events. [2024-12-02 12:39:40,169 INFO L125 PetriNetUnfolderBase]: For 295449/299123 co-relation queries the response was YES. [2024-12-02 12:39:40,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195332 conditions, 43324 events. 26230/43324 cut-off events. For 295449/299123 co-relation queries the response was YES. Maximal size of possible extension queue 1909. Compared 376404 event pairs, 5989 based on Foata normal form. 4290/46576 useless extension candidates. Maximal degree in co-relation 140141. Up to 26156 conditions per place. [2024-12-02 12:39:40,605 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 186 selfloop transitions, 75 changer transitions 0/298 dead transitions. [2024-12-02 12:39:40,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 298 transitions, 4160 flow [2024-12-02 12:39:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 12:39:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 12:39:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 252 transitions. [2024-12-02 12:39:40,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-12-02 12:39:40,606 INFO L175 Difference]: Start difference. First operand has 162 places, 187 transitions, 2259 flow. Second operand 7 states and 252 transitions. [2024-12-02 12:39:40,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 298 transitions, 4160 flow [2024-12-02 12:39:42,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 298 transitions, 4011 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-12-02 12:39:42,502 INFO L231 Difference]: Finished difference. Result has 167 places, 220 transitions, 2926 flow [2024-12-02 12:39:42,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2926, PETRI_PLACES=167, PETRI_TRANSITIONS=220} [2024-12-02 12:39:42,502 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 91 predicate places. [2024-12-02 12:39:42,502 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 220 transitions, 2926 flow [2024-12-02 12:39:42,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 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-12-02 12:39:42,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:39:42,502 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, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:39:42,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-02 12:39:42,502 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:39:42,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:39:42,503 INFO L85 PathProgramCache]: Analyzing trace with hash -644666755, now seen corresponding path program 2 times [2024-12-02 12:39:42,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:39:42,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727103989] [2024-12-02 12:39:42,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:39:42,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:39:42,525 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:39:42,525 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:39:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 12:39:42,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:39:42,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727103989] [2024-12-02 12:39:42,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727103989] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:39:42,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:39:42,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 12:39:42,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654911435] [2024-12-02 12:39:42,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:39:42,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:39:42,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:39:42,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:39:42,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:39:42,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 75 [2024-12-02 12:39:42,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 220 transitions, 2926 flow. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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-12-02 12:39:42,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:39:42,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 75 [2024-12-02 12:39:42,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:39:51,257 INFO L124 PetriNetUnfolderBase]: 34203/55486 cut-off events. [2024-12-02 12:39:51,257 INFO L125 PetriNetUnfolderBase]: For 356935/360293 co-relation queries the response was YES. [2024-12-02 12:39:51,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249816 conditions, 55486 events. 34203/55486 cut-off events. For 356935/360293 co-relation queries the response was YES. Maximal size of possible extension queue 2218. Compared 479053 event pairs, 7095 based on Foata normal form. 4226/58566 useless extension candidates. Maximal degree in co-relation 179940. Up to 20898 conditions per place. [2024-12-02 12:39:52,098 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 218 selfloop transitions, 79 changer transitions 0/334 dead transitions. [2024-12-02 12:39:52,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 334 transitions, 4700 flow [2024-12-02 12:39:52,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 12:39:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 12:39:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-12-02 12:39:52,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2024-12-02 12:39:52,099 INFO L175 Difference]: Start difference. First operand has 167 places, 220 transitions, 2926 flow. Second operand 6 states and 237 transitions. [2024-12-02 12:39:52,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 334 transitions, 4700 flow [2024-12-02 12:39:53,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 334 transitions, 4652 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 12:39:53,662 INFO L231 Difference]: Finished difference. Result has 173 places, 232 transitions, 3317 flow [2024-12-02 12:39:53,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2879, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3317, PETRI_PLACES=173, PETRI_TRANSITIONS=232} [2024-12-02 12:39:53,662 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 97 predicate places. [2024-12-02 12:39:53,663 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 232 transitions, 3317 flow [2024-12-02 12:39:53,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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-12-02 12:39:53,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:39:53,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:39:53,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 12:39:53,663 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:39:53,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:39:53,663 INFO L85 PathProgramCache]: Analyzing trace with hash -282604241, now seen corresponding path program 1 times [2024-12-02 12:39:53,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:39:53,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131863470] [2024-12-02 12:39:53,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:39:53,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:39:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:39:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:39:55,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:39:55,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131863470] [2024-12-02 12:39:55,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131863470] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:39:55,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738336550] [2024-12-02 12:39:55,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:39:55,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:39:55,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:39:55,032 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:39:55,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 12:39:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:39:55,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-12-02 12:39:55,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:39:55,201 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-12-02 12:39:55,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-12-02 12:39:55,328 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 12:39:55,328 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-12-02 12:39:55,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-12-02 12:39:55,848 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2024-12-02 12:39:55,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 42 [2024-12-02 12:39:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:39:55,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:40:04,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 12:40:04,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 95 [2024-12-02 12:40:04,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 12:40:04,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 322 treesize of output 478 [2024-12-02 12:40:04,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 12:40:04,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 226 treesize of output 370 [2024-12-02 12:43:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 1 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:43:29,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738336550] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:43:29,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:43:29,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2024-12-02 12:43:29,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857355075] [2024-12-02 12:43:29,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:43:29,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-12-02 12:43:29,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:43:29,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-12-02 12:43:29,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=702, Unknown=6, NotChecked=0, Total=812 [2024-12-02 12:43:31,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 75 [2024-12-02 12:43:31,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 232 transitions, 3317 flow. Second operand has 29 states, 29 states have (on average 16.344827586206897) internal successors, (474), 29 states have internal predecessors, (474), 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-12-02 12:43:31,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:43:31,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 75 [2024-12-02 12:43:31,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:44:21,106 INFO L124 PetriNetUnfolderBase]: 219789/317686 cut-off events. [2024-12-02 12:44:21,106 INFO L125 PetriNetUnfolderBase]: For 1793941/1794347 co-relation queries the response was YES. [2024-12-02 12:44:23,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509272 conditions, 317686 events. 219789/317686 cut-off events. For 1793941/1794347 co-relation queries the response was YES. Maximal size of possible extension queue 9242. Compared 2620678 event pairs, 21264 based on Foata normal form. 327/316858 useless extension candidates. Maximal degree in co-relation 1058395. Up to 91957 conditions per place. [2024-12-02 12:44:24,616 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 564 selfloop transitions, 347 changer transitions 3/930 dead transitions. [2024-12-02 12:44:24,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 930 transitions, 11855 flow [2024-12-02 12:44:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-12-02 12:44:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-12-02 12:44:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 862 transitions. [2024-12-02 12:44:24,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3482828282828283 [2024-12-02 12:44:24,619 INFO L175 Difference]: Start difference. First operand has 173 places, 232 transitions, 3317 flow. Second operand 33 states and 862 transitions. [2024-12-02 12:44:24,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 930 transitions, 11855 flow [2024-12-02 12:45:18,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 930 transitions, 11589 flow, removed 87 selfloop flow, removed 2 redundant places. [2024-12-02 12:45:18,436 INFO L231 Difference]: Finished difference. Result has 214 places, 488 transitions, 8378 flow [2024-12-02 12:45:18,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=3261, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=8378, PETRI_PLACES=214, PETRI_TRANSITIONS=488} [2024-12-02 12:45:18,436 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 138 predicate places. [2024-12-02 12:45:18,436 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 488 transitions, 8378 flow [2024-12-02 12:45:18,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 16.344827586206897) internal successors, (474), 29 states have internal predecessors, (474), 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-12-02 12:45:18,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:45:18,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:45:18,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-12-02 12:45:18,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:45:18,637 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:45:18,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:45:18,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1267216209, now seen corresponding path program 2 times [2024-12-02 12:45:18,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:45:18,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999240530] [2024-12-02 12:45:18,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:45:18,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:45:18,687 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:45:18,688 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:45:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:45:19,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:45:19,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999240530] [2024-12-02 12:45:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999240530] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:45:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259292842] [2024-12-02 12:45:19,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:45:19,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:45:19,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:45:19,526 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:45:19,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 12:45:19,643 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:45:19,643 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:45:19,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-02 12:45:19,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:45:20,323 INFO L349 Elim1Store]: treesize reduction 12, result has 73.3 percent of original size [2024-12-02 12:45:20,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 46 [2024-12-02 12:45:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:45:20,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:45:20,744 INFO L349 Elim1Store]: treesize reduction 19, result has 92.5 percent of original size [2024-12-02 12:45:20,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 250 [2024-12-02 12:45:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:45:24,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259292842] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:45:24,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:45:24,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 25 [2024-12-02 12:45:24,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111120908] [2024-12-02 12:45:24,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:45:24,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-12-02 12:45:24,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:45:24,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-12-02 12:45:24,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2024-12-02 12:45:25,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2024-12-02 12:45:25,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 488 transitions, 8378 flow. Second operand has 26 states, 26 states have (on average 31.26923076923077) internal successors, (813), 26 states have internal predecessors, (813), 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-12-02 12:45:25,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:45:25,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2024-12-02 12:45:25,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:45:44,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][448], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, 869#(<= 0 ~i~0), Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, Black: 2187#(and (= ~total~0 0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (and (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= ~j~0 ~i~0))) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 2173#(and (= ~total~0 0) (or (and (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (= ~q2_back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) (select (select |#memory_int#1| ~f~0.base) ~f~0.offset)) (= (+ (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset) (select (select |#memory_int#1| ~f~0.base) ~f~0.offset)) 0))) (= 0 ~q2_front~0) (or (forall ((v_subst_15 Int) (v_subst_16 Int) (~f~0.offset Int) (~f~0.base Int)) (or (not (= (select (select |#memory_int#1| v_subst_16) (+ (* ~q1_back~0 4) v_subst_15)) (select (select |#memory_int#1| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)))) (not (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int#1| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) 0)) (= (+ (select (select |#memory_int#1| v_subst_16) (+ v_subst_15 (* ~q1_front~0 4))) (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset)) 0))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)) (or (forall ((v_ArrVal_479 (Array Int Int)) (v_subst_14 Int) (v_subst_13 Int) (~f~0.offset Int) (~f~0.base Int)) (or (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) v_subst_14) (+ (* ~q1_back~0 4) v_subst_13)))) (not (= (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4)))) 0)) (= (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) v_subst_14) (+ v_subst_13 (* ~q1_front~0 4))) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~q2~0.base) ~q2~0.offset)) 0))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 2169#(and (= ~total~0 0) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 2177#(and (or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (or (and (= ~total~0 0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= ~j~0 ~i~0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 1837#true, Black: 2035#(= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~total~0) 0), Black: 1809#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2185#(and (= ~total~0 0) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), Black: 1807#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2175#(and (= ~total~0 0) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), Black: 2183#(and (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~total~0) 0) (or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 273#(<= ~n1~0 0), Black: 1803#(<= ~q2_front~0 ~q2_back~0), Black: 1849#(= ~total~0 0), 21#L58true, Black: 1819#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 1826#(<= ~q1_front~0 ~q1_back~0), Black: 292#(<= ~n2~0 0), Black: 1827#(<= (+ ~q1_front~0 1) ~q1_back~0), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 1830#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1832#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1145#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0)), 317#(= (select |#valid| ~q1~0.base) 1), 2199#true, Black: 617#true, 2141#(or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))), Black: 621#(<= ~n1~0 1), 1460#(and (or (and (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~cond~1#1| 256))) (< (+ 3 (* ~j~0 4) ~f~0.offset) (select |#length| ~f~0.base))) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 738#true, Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 5#thread2EXITtrue, 38#L144-4true, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1006#(<= 0 ~j~0), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))))]) [2024-12-02 12:45:44,813 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-12-02 12:45:44,813 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 12:45:44,813 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 12:45:44,813 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 12:45:45,955 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][448], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), 869#(<= 0 ~i~0), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 56#thread3EXITtrue, Black: 2187#(and (= ~total~0 0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (and (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= ~j~0 ~i~0))) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 2173#(and (= ~total~0 0) (or (and (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (= ~q2_back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) (select (select |#memory_int#1| ~f~0.base) ~f~0.offset)) (= (+ (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset) (select (select |#memory_int#1| ~f~0.base) ~f~0.offset)) 0))) (= 0 ~q2_front~0) (or (forall ((v_subst_15 Int) (v_subst_16 Int) (~f~0.offset Int) (~f~0.base Int)) (or (not (= (select (select |#memory_int#1| v_subst_16) (+ (* ~q1_back~0 4) v_subst_15)) (select (select |#memory_int#1| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)))) (not (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int#1| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) 0)) (= (+ (select (select |#memory_int#1| v_subst_16) (+ v_subst_15 (* ~q1_front~0 4))) (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset)) 0))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)) (or (forall ((v_ArrVal_479 (Array Int Int)) (v_subst_14 Int) (v_subst_13 Int) (~f~0.offset Int) (~f~0.base Int)) (or (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) v_subst_14) (+ (* ~q1_back~0 4) v_subst_13)))) (not (= (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4)))) 0)) (= (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) v_subst_14) (+ v_subst_13 (* ~q1_front~0 4))) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~q2~0.base) ~q2~0.offset)) 0))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 2169#(and (= ~total~0 0) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 2177#(and (or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (or (and (= ~total~0 0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= ~j~0 ~i~0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 1837#true, Black: 2035#(= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~total~0) 0), Black: 1809#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2185#(and (= ~total~0 0) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), Black: 1807#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2175#(and (= ~total~0 0) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), Black: 2183#(and (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~total~0) 0) (or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 273#(<= ~n1~0 0), Black: 1803#(<= ~q2_front~0 ~q2_back~0), Black: 1849#(= ~total~0 0), 21#L58true, Black: 1819#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 1826#(<= ~q1_front~0 ~q1_back~0), Black: 292#(<= ~n2~0 0), Black: 1827#(<= (+ ~q1_front~0 1) ~q1_back~0), 62#L145true, Black: 1830#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 1832#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1145#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0)), 317#(= (select |#valid| ~q1~0.base) 1), 2199#true, Black: 617#true, 2141#(or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))), 1460#(and (or (and (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~cond~1#1| 256))) (< (+ 3 (* ~j~0 4) ~f~0.offset) (select |#length| ~f~0.base))) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 738#true, Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 5#thread2EXITtrue, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0))]) [2024-12-02 12:45:45,955 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-12-02 12:45:45,955 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-12-02 12:45:45,955 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-12-02 12:45:45,955 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-12-02 12:45:46,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][448], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 996#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 56#thread3EXITtrue, Black: 2187#(and (= ~total~0 0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (and (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= ~j~0 ~i~0))) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 2173#(and (= ~total~0 0) (or (and (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (= ~q2_back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) (select (select |#memory_int#1| ~f~0.base) ~f~0.offset)) (= (+ (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset) (select (select |#memory_int#1| ~f~0.base) ~f~0.offset)) 0))) (= 0 ~q2_front~0) (or (forall ((v_subst_15 Int) (v_subst_16 Int) (~f~0.offset Int) (~f~0.base Int)) (or (not (= (select (select |#memory_int#1| v_subst_16) (+ (* ~q1_back~0 4) v_subst_15)) (select (select |#memory_int#1| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)))) (not (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int#1| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) 0)) (= (+ (select (select |#memory_int#1| v_subst_16) (+ v_subst_15 (* ~q1_front~0 4))) (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset)) 0))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)) (or (forall ((v_ArrVal_479 (Array Int Int)) (v_subst_14 Int) (v_subst_13 Int) (~f~0.offset Int) (~f~0.base Int)) (or (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) v_subst_14) (+ (* ~q1_back~0 4) v_subst_13)))) (not (= (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4)))) 0)) (= (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) v_subst_14) (+ v_subst_13 (* ~q1_front~0 4))) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~q2~0.base) ~q2~0.offset)) 0))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 2169#(and (= ~total~0 0) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 2177#(and (or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (or (and (= ~total~0 0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= ~j~0 ~i~0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 1837#true, Black: 2035#(= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~total~0) 0), Black: 1809#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2185#(and (= ~total~0 0) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), Black: 1807#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2175#(and (= ~total~0 0) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), Black: 2183#(and (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~total~0) 0) (or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 273#(<= ~n1~0 0), Black: 1803#(<= ~q2_front~0 ~q2_back~0), Black: 1849#(= ~total~0 0), Black: 1819#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 1826#(<= ~q1_front~0 ~q1_back~0), Black: 292#(<= ~n2~0 0), Black: 1827#(<= (+ ~q1_front~0 1) ~q1_back~0), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 1830#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1832#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 40#thread1EXITtrue, 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1145#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0)), 317#(= (select |#valid| ~q1~0.base) 1), 2199#true, Black: 617#true, 2141#(or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))), 1460#(and (or (and (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~cond~1#1| 256))) (< (+ 3 (* ~j~0 4) ~f~0.offset) (select |#length| ~f~0.base))) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 621#(<= ~n1~0 1), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 738#true, Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 5#thread2EXITtrue, 38#L144-4true, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1006#(<= 0 ~j~0), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))))]) [2024-12-02 12:45:46,964 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-12-02 12:45:46,964 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-12-02 12:45:46,964 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-12-02 12:45:46,964 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-12-02 12:45:47,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][448], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 996#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 56#thread3EXITtrue, Black: 2187#(and (= ~total~0 0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (and (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= ~j~0 ~i~0))) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 2173#(and (= ~total~0 0) (or (and (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (= ~q2_back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) (select (select |#memory_int#1| ~f~0.base) ~f~0.offset)) (= (+ (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset) (select (select |#memory_int#1| ~f~0.base) ~f~0.offset)) 0))) (= 0 ~q2_front~0) (or (forall ((v_subst_15 Int) (v_subst_16 Int) (~f~0.offset Int) (~f~0.base Int)) (or (not (= (select (select |#memory_int#1| v_subst_16) (+ (* ~q1_back~0 4) v_subst_15)) (select (select |#memory_int#1| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)))) (not (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int#1| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) 0)) (= (+ (select (select |#memory_int#1| v_subst_16) (+ v_subst_15 (* ~q1_front~0 4))) (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset)) 0))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)) (or (forall ((v_ArrVal_479 (Array Int Int)) (v_subst_14 Int) (v_subst_13 Int) (~f~0.offset Int) (~f~0.base Int)) (or (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) v_subst_14) (+ (* ~q1_back~0 4) v_subst_13)))) (not (= (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4)))) 0)) (= (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) v_subst_14) (+ v_subst_13 (* ~q1_front~0 4))) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~q2~0.base) ~q2~0.offset)) 0))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 2169#(and (= ~total~0 0) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 2177#(and (or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (or (and (= ~total~0 0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= ~j~0 ~i~0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 1837#true, Black: 2035#(= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~total~0) 0), Black: 1809#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2185#(and (= ~total~0 0) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), Black: 1807#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2175#(and (= ~total~0 0) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), Black: 2183#(and (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~total~0) 0) (or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 1803#(<= ~q2_front~0 ~q2_back~0), Black: 273#(<= ~n1~0 0), Black: 1849#(= ~total~0 0), Black: 1819#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 1826#(<= ~q1_front~0 ~q1_back~0), Black: 292#(<= ~n2~0 0), Black: 1827#(<= (+ ~q1_front~0 1) ~q1_back~0), 62#L145true, 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 1830#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1832#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 40#thread1EXITtrue, 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1145#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0)), 317#(= (select |#valid| ~q1~0.base) 1), 2199#true, Black: 617#true, 2141#(or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))), Black: 621#(<= ~n1~0 1), 1460#(and (or (and (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~cond~1#1| 256))) (< (+ 3 (* ~j~0 4) ~f~0.offset) (select |#length| ~f~0.base))) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 738#true, Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 5#thread2EXITtrue, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0))]) [2024-12-02 12:45:47,602 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-12-02 12:45:47,602 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-12-02 12:45:47,602 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-12-02 12:45:47,602 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-12-02 12:45:48,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][448], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 996#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 56#thread3EXITtrue, Black: 2187#(and (= ~total~0 0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (and (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= ~j~0 ~i~0))) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 2173#(and (= ~total~0 0) (or (and (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (= ~q2_back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) (select (select |#memory_int#1| ~f~0.base) ~f~0.offset)) (= (+ (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset) (select (select |#memory_int#1| ~f~0.base) ~f~0.offset)) 0))) (= 0 ~q2_front~0) (or (forall ((v_subst_15 Int) (v_subst_16 Int) (~f~0.offset Int) (~f~0.base Int)) (or (not (= (select (select |#memory_int#1| v_subst_16) (+ (* ~q1_back~0 4) v_subst_15)) (select (select |#memory_int#1| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)))) (not (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int#1| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) 0)) (= (+ (select (select |#memory_int#1| v_subst_16) (+ v_subst_15 (* ~q1_front~0 4))) (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset)) 0))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)) (or (forall ((v_ArrVal_479 (Array Int Int)) (v_subst_14 Int) (v_subst_13 Int) (~f~0.offset Int) (~f~0.base Int)) (or (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) v_subst_14) (+ (* ~q1_back~0 4) v_subst_13)))) (not (= (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4)))) 0)) (= (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) v_subst_14) (+ v_subst_13 (* ~q1_front~0 4))) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~q2~0.base) ~q2~0.offset)) 0))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 2169#(and (= ~total~0 0) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 2177#(and (or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (or (and (= ~total~0 0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= ~j~0 ~i~0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 1837#true, Black: 2035#(= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~total~0) 0), Black: 1809#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2185#(and (= ~total~0 0) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), Black: 1807#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2175#(and (= ~total~0 0) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), Black: 2183#(and (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~total~0) 0) (or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 1803#(<= ~q2_front~0 ~q2_back~0), Black: 273#(<= ~n1~0 0), Black: 1849#(= ~total~0 0), Black: 1819#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 1826#(<= ~q1_front~0 ~q1_back~0), Black: 292#(<= ~n2~0 0), Black: 1827#(<= (+ ~q1_front~0 1) ~q1_back~0), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 1830#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1832#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 74#L145-1true, 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1145#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0)), 317#(= (select |#valid| ~q1~0.base) 1), 2199#true, Black: 617#true, 2141#(or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))), Black: 621#(<= ~n1~0 1), 1460#(and (or (and (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~cond~1#1| 256))) (< (+ 3 (* ~j~0 4) ~f~0.offset) (select |#length| ~f~0.base))) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 738#true, Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 5#thread2EXITtrue, 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))))]) [2024-12-02 12:45:48,364 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-12-02 12:45:48,364 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-12-02 12:45:48,364 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-12-02 12:45:48,364 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-12-02 12:45:48,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L100-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_5|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][448], [Black: 1782#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 1780#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), Black: 1778#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0)), 1295#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1489#true, Black: 1682#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 1672#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1786#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 996#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 56#thread3EXITtrue, Black: 2187#(and (= ~total~0 0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (and (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= ~j~0 ~i~0))) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 2173#(and (= ~total~0 0) (or (and (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (= ~q2_back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) (select (select |#memory_int#1| ~f~0.base) ~f~0.offset)) (= (+ (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset) (select (select |#memory_int#1| ~f~0.base) ~f~0.offset)) 0))) (= 0 ~q2_front~0) (or (forall ((v_subst_15 Int) (v_subst_16 Int) (~f~0.offset Int) (~f~0.base Int)) (or (not (= (select (select |#memory_int#1| v_subst_16) (+ (* ~q1_back~0 4) v_subst_15)) (select (select |#memory_int#1| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)))) (not (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int#1| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) 0)) (= (+ (select (select |#memory_int#1| v_subst_16) (+ v_subst_15 (* ~q1_front~0 4))) (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset)) 0))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)) (or (forall ((v_ArrVal_479 (Array Int Int)) (v_subst_14 Int) (v_subst_13 Int) (~f~0.offset Int) (~f~0.base Int)) (or (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) v_subst_14) (+ (* ~q1_back~0 4) v_subst_13)))) (not (= (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4)))) 0)) (= (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) v_subst_14) (+ v_subst_13 (* ~q1_front~0 4))) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_479) ~q2~0.base) ~q2~0.offset)) 0))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 2169#(and (= ~total~0 0) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 2177#(and (or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (or (and (= ~total~0 0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= ~j~0 ~i~0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_205|) 0))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 1837#true, Black: 2035#(= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~total~0) 0), Black: 1809#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2185#(and (= ~total~0 0) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), Black: 1807#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2175#(and (= ~total~0 0) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), Black: 2183#(and (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~total~0) 0) (or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0)))), Black: 1803#(<= ~q2_front~0 ~q2_back~0), Black: 273#(<= ~n1~0 0), Black: 1849#(= ~total~0 0), Black: 1819#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 1826#(<= ~q1_front~0 ~q1_back~0), Black: 292#(<= ~n2~0 0), Black: 1827#(<= (+ ~q1_front~0 1) ~q1_back~0), 664#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 1830#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1832#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 306#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), 1804#(<= (+ 1 ~q2_front~0) ~q2_back~0), 598#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1346#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1450#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 160#(<= ~n2~0 2147483647), Black: 1470#(= ~total~0 0), Black: 1474#(<= ~q1_back~0 ~q1_front~0), 300#(= (select |#valid| ~f~0.base) 1), Black: 1481#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1145#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0)), 317#(= (select |#valid| ~q1~0.base) 1), 2199#true, Black: 617#true, 22#L146true, 2141#(or (and (= ~total~0 0) (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= ~j~0 ~i~0)) (not (= ~q2_back~0 0))), Black: 621#(<= ~n1~0 1), 1460#(and (or (and (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 (div |thread2Thread1of1ForFork1_~cond~1#1| 256))) (< (+ 3 (* ~j~0 4) ~f~0.offset) (select |#length| ~f~0.base))) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~j~0) (<= 4 (+ (* ~j~0 4) ~f~0.offset))), Black: 791#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 736#(<= ~q2_back~0 ~q2_front~0), Black: 742#(<= ~n2~0 1), 565#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 738#true, Black: 923#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 869#(<= 0 ~i~0), Black: 998#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 907#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 990#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 17#L110true, 1467#(= (select |#valid| ~q2~0.base) 1), Black: 1066#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1044#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1668#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1784#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1006#(<= 0 ~j~0), 342#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), Black: 1147#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 1788#(and (<= 1 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))))]) [2024-12-02 12:45:48,736 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2024-12-02 12:45:48,736 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-12-02 12:45:48,736 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-12-02 12:45:48,736 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-12-02 12:45:49,233 INFO L124 PetriNetUnfolderBase]: 76054/126721 cut-off events. [2024-12-02 12:45:49,233 INFO L125 PetriNetUnfolderBase]: For 1440319/1456844 co-relation queries the response was YES. [2024-12-02 12:45:50,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681855 conditions, 126721 events. 76054/126721 cut-off events. For 1440319/1456844 co-relation queries the response was YES. Maximal size of possible extension queue 5821. Compared 1263374 event pairs, 10540 based on Foata normal form. 12517/135861 useless extension candidates. Maximal degree in co-relation 663083. Up to 76879 conditions per place. [2024-12-02 12:45:50,925 INFO L140 encePairwiseOnDemand]: 61/75 looper letters, 411 selfloop transitions, 250 changer transitions 1/706 dead transitions. [2024-12-02 12:45:50,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 706 transitions, 12142 flow [2024-12-02 12:45:50,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 12:45:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-12-02 12:45:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 600 transitions. [2024-12-02 12:45:50,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-12-02 12:45:50,927 INFO L175 Difference]: Start difference. First operand has 214 places, 488 transitions, 8378 flow. Second operand 16 states and 600 transitions. [2024-12-02 12:45:50,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 706 transitions, 12142 flow [2024-12-02 12:46:16,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 706 transitions, 11625 flow, removed 251 selfloop flow, removed 4 redundant places. [2024-12-02 12:46:16,226 INFO L231 Difference]: Finished difference. Result has 228 places, 557 transitions, 9668 flow [2024-12-02 12:46:16,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=8011, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=9668, PETRI_PLACES=228, PETRI_TRANSITIONS=557} [2024-12-02 12:46:16,227 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 152 predicate places. [2024-12-02 12:46:16,227 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 557 transitions, 9668 flow [2024-12-02 12:46:16,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 31.26923076923077) internal successors, (813), 26 states have internal predecessors, (813), 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-12-02 12:46:16,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:46:16,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:46:16,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-12-02 12:46:16,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:46:16,428 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:46:16,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:46:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1483583533, now seen corresponding path program 3 times [2024-12-02 12:46:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:46:16,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687069942] [2024-12-02 12:46:16,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 12:46:16,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:46:16,474 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-02 12:46:16,474 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:46:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:46:17,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:46:17,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687069942] [2024-12-02 12:46:17,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687069942] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:46:17,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121226494] [2024-12-02 12:46:17,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 12:46:17,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:46:17,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:46:17,510 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:46:17,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 12:46:17,614 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-02 12:46:17,614 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:46:17,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-12-02 12:46:17,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:46:17,672 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-12-02 12:46:17,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-12-02 12:46:17,801 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 12:46:17,802 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-12-02 12:46:17,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-12-02 12:46:18,438 INFO L349 Elim1Store]: treesize reduction 17, result has 48.5 percent of original size [2024-12-02 12:46:18,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 30 [2024-12-02 12:46:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 12:46:18,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:46:27,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 12:46:27,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2024-12-02 12:46:27,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 12:46:27,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 238 [2024-12-02 12:46:27,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 12:46:27,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 146 treesize of output 294 [2024-12-02 12:47:09,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-12-02 12:47:09,808 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-12-02 12:47:09,809 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-12-02 12:47:09,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-12-02 12:47:10,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:10,010 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:584) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:238) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-12-02 12:47:10,016 INFO L158 Benchmark]: Toolchain (without parser) took 572292.15ms. Allocated memory was 142.6MB in the beginning and 15.3GB in the end (delta: 15.2GB). Free memory was 117.7MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 10.7GB. Max. memory is 16.1GB. [2024-12-02 12:47:10,016 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 12:47:10,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.36ms. Allocated memory is still 142.6MB. Free memory was 117.5MB in the beginning and 104.4MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 12:47:10,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.16ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 101.8MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 12:47:10,017 INFO L158 Benchmark]: Boogie Preprocessor took 58.91ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 98.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 12:47:10,017 INFO L158 Benchmark]: RCFGBuilder took 956.65ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 49.7MB in the end (delta: 49.1MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2024-12-02 12:47:10,017 INFO L158 Benchmark]: TraceAbstraction took 571003.14ms. Allocated memory was 142.6MB in the beginning and 15.3GB in the end (delta: 15.2GB). Free memory was 49.1MB in the beginning and 7.5GB in the end (delta: -7.5GB). Peak memory consumption was 10.6GB. Max. memory is 16.1GB. [2024-12-02 12:47:10,019 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.36ms. Allocated memory is still 142.6MB. Free memory was 117.5MB in the beginning and 104.4MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.16ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 101.8MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.91ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 98.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 956.65ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 49.7MB in the end (delta: 49.1MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * TraceAbstraction took 571003.14ms. Allocated memory was 142.6MB in the beginning and 15.3GB in the end (delta: 15.2GB). Free memory was 49.1MB in the beginning and 7.5GB in the end (delta: -7.5GB). Peak memory consumption was 10.6GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1 --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 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 12:47:12,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 12:47:12,664 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-12-02 12:47:12,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 12:47:12,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 12:47:12,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 12:47:12,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 12:47:12,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 12:47:12,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 12:47:12,695 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 12:47:12,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 12:47:12,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 12:47:12,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 12:47:12,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 12:47:12,696 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 12:47:12,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 12:47:12,696 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 12:47:12,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 12:47:12,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 12:47:12,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 12:47:12,696 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 12:47:12,696 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 12:47:12,697 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 12:47:12,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 12:47:12,697 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 12:47:12,697 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 12:47:12,697 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 12:47:12,697 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 12:47:12,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 12:47:12,697 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 12:47:12,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 12:47:12,698 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 12:47:12,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 12:47:12,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 12:47:12,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 12:47:12,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:47:12,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 12:47:12,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 12:47:12,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 12:47:12,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 12:47:12,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:47:12,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 12:47:12,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 12:47:12,699 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 12:47:12,699 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 12:47:12,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 12:47:12,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 12:47:12,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 12:47:12,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 12:47:12,700 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_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1 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 -> 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 [2024-12-02 12:47:12,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 12:47:12,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 12:47:12,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 12:47:12,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 12:47:12,952 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 12:47:12,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2024-12-02 12:47:15,624 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/data/f0eb4a29d/02fba3c1f36341c5be96ef945b6db9c1/FLAG6dae05a87 [2024-12-02 12:47:15,790 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 12:47:15,790 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2024-12-02 12:47:15,797 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/data/f0eb4a29d/02fba3c1f36341c5be96ef945b6db9c1/FLAG6dae05a87 [2024-12-02 12:47:15,813 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/data/f0eb4a29d/02fba3c1f36341c5be96ef945b6db9c1 [2024-12-02 12:47:15,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 12:47:15,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 12:47:15,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 12:47:15,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 12:47:15,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 12:47:15,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:47:15" (1/1) ... [2024-12-02 12:47:15,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3a616f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:15, skipping insertion in model container [2024-12-02 12:47:15,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:47:15" (1/1) ... [2024-12-02 12:47:15,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 12:47:16,008 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 12:47:16,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 12:47:16,025 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 12:47:16,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 12:47:16,071 INFO L204 MainTranslator]: Completed translation [2024-12-02 12:47:16,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16 WrapperNode [2024-12-02 12:47:16,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 12:47:16,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 12:47:16,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 12:47:16,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 12:47:16,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (1/1) ... [2024-12-02 12:47:16,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (1/1) ... [2024-12-02 12:47:16,119 INFO L138 Inliner]: procedures = 28, calls = 64, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 321 [2024-12-02 12:47:16,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 12:47:16,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 12:47:16,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 12:47:16,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 12:47:16,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (1/1) ... [2024-12-02 12:47:16,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (1/1) ... [2024-12-02 12:47:16,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (1/1) ... [2024-12-02 12:47:16,153 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-12-02 12:47:16,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (1/1) ... [2024-12-02 12:47:16,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (1/1) ... [2024-12-02 12:47:16,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (1/1) ... [2024-12-02 12:47:16,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (1/1) ... [2024-12-02 12:47:16,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (1/1) ... [2024-12-02 12:47:16,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (1/1) ... [2024-12-02 12:47:16,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (1/1) ... [2024-12-02 12:47:16,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 12:47:16,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 12:47:16,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 12:47:16,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 12:47:16,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (1/1) ... [2024-12-02 12:47:16,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:47:16,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:47:16,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 12:47:16,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 12:47:16,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 12:47:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 12:47:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-12-02 12:47:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-12-02 12:47:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-12-02 12:47:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-12-02 12:47:16,228 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-12-02 12:47:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-12-02 12:47:16,228 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-12-02 12:47:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-12-02 12:47:16,228 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-12-02 12:47:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-12-02 12:47:16,229 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-12-02 12:47:16,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 12:47:16,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 12:47:16,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 12:47:16,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 12:47:16,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 12:47:16,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-12-02 12:47:16,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-12-02 12:47:16,230 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 12:47:16,338 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 12:47:16,340 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 12:47:17,026 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 12:47:17,026 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 12:47:17,515 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 12:47:17,516 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2024-12-02 12:47:17,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:47:17 BoogieIcfgContainer [2024-12-02 12:47:17,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 12:47:17,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 12:47:17,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 12:47:17,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 12:47:17,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:47:15" (1/3) ... [2024-12-02 12:47:17,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e31b3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:47:17, skipping insertion in model container [2024-12-02 12:47:17,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:16" (2/3) ... [2024-12-02 12:47:17,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e31b3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:47:17, skipping insertion in model container [2024-12-02 12:47:17,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:47:17" (3/3) ... [2024-12-02 12:47:17,527 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2024-12-02 12:47:17,543 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 12:47:17,545 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series2.wvr.c that has 5 procedures, 69 locations, 1 initial locations, 7 loop locations, and 22 error locations. [2024-12-02 12:47:17,545 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 12:47:17,635 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-12-02 12:47:17,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 75 transitions, 178 flow [2024-12-02 12:47:17,697 INFO L124 PetriNetUnfolderBase]: 7/71 cut-off events. [2024-12-02 12:47:17,699 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-12-02 12:47:17,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 71 events. 7/71 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 188 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2024-12-02 12:47:17,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 75 transitions, 178 flow [2024-12-02 12:47:17,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 70 transitions, 164 flow [2024-12-02 12:47:17,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 12:47:17,722 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;@3f3df1c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 12:47:17,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2024-12-02 12:47:17,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 12:47:17,726 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-12-02 12:47:17,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 12:47:17,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:47:17,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-12-02 12:47:17,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:47:17,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:47:17,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1023973, now seen corresponding path program 1 times [2024-12-02 12:47:17,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:47:17,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [431538070] [2024-12-02 12:47:17,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:17,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:17,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:47:17,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:47:17,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 12:47:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:47:17,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 12:47:17,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:47:17,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-12-02 12:47:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:47:17,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:47:17,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:47:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431538070] [2024-12-02 12:47:17,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431538070] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:47:17,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:47:17,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 12:47:17,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472975891] [2024-12-02 12:47:17,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:47:17,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:47:17,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:47:17,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:47:17,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:47:17,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:47:17,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-12-02 12:47:17,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:47:17,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:47:17,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:47:19,862 INFO L124 PetriNetUnfolderBase]: 9087/13263 cut-off events. [2024-12-02 12:47:19,862 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2024-12-02 12:47:19,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26130 conditions, 13263 events. 9087/13263 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 104222 event pairs, 8782 based on Foata normal form. 1/6627 useless extension candidates. Maximal degree in co-relation 24528. Up to 12043 conditions per place. [2024-12-02 12:47:19,987 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 41 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-12-02 12:47:19,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 236 flow [2024-12-02 12:47:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:47:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 12:47:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-12-02 12:47:20,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5511111111111111 [2024-12-02 12:47:20,003 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 164 flow. Second operand 3 states and 124 transitions. [2024-12-02 12:47:20,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 236 flow [2024-12-02 12:47:20,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 220 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-12-02 12:47:20,047 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 138 flow [2024-12-02 12:47:20,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2024-12-02 12:47:20,053 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -13 predicate places. [2024-12-02 12:47:20,053 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 138 flow [2024-12-02 12:47:20,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-12-02 12:47:20,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:47:20,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-12-02 12:47:20,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 12:47:20,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:20,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:47:20,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:47:20,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1023974, now seen corresponding path program 1 times [2024-12-02 12:47:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:47:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [132554300] [2024-12-02 12:47:20,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:20,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:47:20,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:47:20,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 12:47:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:47:20,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-02 12:47:20,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:47:20,356 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 7 [2024-12-02 12:47:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:47:20,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:47:20,443 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:47:20,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132554300] [2024-12-02 12:47:20,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132554300] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:47:20,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:47:20,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:47:20,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180799208] [2024-12-02 12:47:20,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:47:20,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 12:47:20,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:47:20,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 12:47:20,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:47:20,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:47:20,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 138 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-12-02 12:47:20,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:47:20,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:47:20,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:47:22,346 INFO L124 PetriNetUnfolderBase]: 9090/13272 cut-off events. [2024-12-02 12:47:22,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 12:47:22,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25643 conditions, 13272 events. 9090/13272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 104091 event pairs, 8782 based on Foata normal form. 0/6631 useless extension candidates. Maximal degree in co-relation 25593. Up to 12056 conditions per place. [2024-12-02 12:47:22,435 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 45 selfloop transitions, 10 changer transitions 0/72 dead transitions. [2024-12-02 12:47:22,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 72 transitions, 268 flow [2024-12-02 12:47:22,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 12:47:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 12:47:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2024-12-02 12:47:22,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2024-12-02 12:47:22,438 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 138 flow. Second operand 4 states and 158 transitions. [2024-12-02 12:47:22,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 72 transitions, 268 flow [2024-12-02 12:47:22,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 12:47:22,441 INFO L231 Difference]: Finished difference. Result has 67 places, 72 transitions, 216 flow [2024-12-02 12:47:22,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=67, PETRI_TRANSITIONS=72} [2024-12-02 12:47:22,442 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -9 predicate places. [2024-12-02 12:47:22,442 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 216 flow [2024-12-02 12:47:22,442 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-12-02 12:47:22,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:47:22,442 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-12-02 12:47:22,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 12:47:22,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:22,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:47:22,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:47:22,644 INFO L85 PathProgramCache]: Analyzing trace with hash 984072197, now seen corresponding path program 1 times [2024-12-02 12:47:22,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:47:22,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253319345] [2024-12-02 12:47:22,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:22,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:22,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:47:22,646 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:47:22,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 12:47:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:47:22,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 12:47:22,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:47:22,737 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 7 [2024-12-02 12:47:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:47:22,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:47:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:47:23,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:47:23,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253319345] [2024-12-02 12:47:23,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253319345] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:47:23,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 12:47:23,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-12-02 12:47:23,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401843069] [2024-12-02 12:47:23,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 12:47:23,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 12:47:23,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:47:23,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 12:47:23,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-12-02 12:47:23,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:47:23,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 72 transitions, 216 flow. Second operand has 8 states, 8 states have (on average 26.25) internal successors, (210), 8 states have internal predecessors, (210), 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-12-02 12:47:23,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:47:23,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:47:23,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:47:25,641 INFO L124 PetriNetUnfolderBase]: 9099/13299 cut-off events. [2024-12-02 12:47:25,641 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-12-02 12:47:25,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25761 conditions, 13299 events. 9099/13299 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 104193 event pairs, 8782 based on Foata normal form. 0/6658 useless extension candidates. Maximal degree in co-relation 25607. Up to 12059 conditions per place. [2024-12-02 12:47:25,699 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 45 selfloop transitions, 37 changer transitions 0/99 dead transitions. [2024-12-02 12:47:25,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 500 flow [2024-12-02 12:47:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:47:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 12:47:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 341 transitions. [2024-12-02 12:47:25,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45466666666666666 [2024-12-02 12:47:25,703 INFO L175 Difference]: Start difference. First operand has 67 places, 72 transitions, 216 flow. Second operand 10 states and 341 transitions. [2024-12-02 12:47:25,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 500 flow [2024-12-02 12:47:25,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 99 transitions, 500 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 12:47:25,707 INFO L231 Difference]: Finished difference. Result has 79 places, 99 transitions, 460 flow [2024-12-02 12:47:25,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=460, PETRI_PLACES=79, PETRI_TRANSITIONS=99} [2024-12-02 12:47:25,708 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2024-12-02 12:47:25,708 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 99 transitions, 460 flow [2024-12-02 12:47:25,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.25) internal successors, (210), 8 states have internal predecessors, (210), 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-12-02 12:47:25,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:47:25,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:47:25,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 12:47:25,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:25,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:47:25,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:47:25,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1708911795, now seen corresponding path program 1 times [2024-12-02 12:47:25,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:47:25,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [421026229] [2024-12-02 12:47:25,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:25,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:25,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:47:25,912 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:47:25,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 12:47:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:47:25,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-02 12:47:25,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:47:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:47:26,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:47:26,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:47:26,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421026229] [2024-12-02 12:47:26,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421026229] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:47:26,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:47:26,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:47:26,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27272124] [2024-12-02 12:47:26,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:47:26,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 12:47:26,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:47:26,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 12:47:26,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:47:26,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2024-12-02 12:47:26,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 99 transitions, 460 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-12-02 12:47:26,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:47:26,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2024-12-02 12:47:26,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:47:27,682 INFO L124 PetriNetUnfolderBase]: 10055/14869 cut-off events. [2024-12-02 12:47:27,682 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-12-02 12:47:27,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28923 conditions, 14869 events. 10055/14869 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 1543. Compared 119119 event pairs, 9699 based on Foata normal form. 362/8134 useless extension candidates. Maximal degree in co-relation 28781. Up to 12085 conditions per place. [2024-12-02 12:47:27,773 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 131 selfloop transitions, 3 changer transitions 0/154 dead transitions. [2024-12-02 12:47:27,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 154 transitions, 994 flow [2024-12-02 12:47:27,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 12:47:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 12:47:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2024-12-02 12:47:27,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6566666666666666 [2024-12-02 12:47:27,775 INFO L175 Difference]: Start difference. First operand has 79 places, 99 transitions, 460 flow. Second operand 4 states and 197 transitions. [2024-12-02 12:47:27,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 154 transitions, 994 flow [2024-12-02 12:47:27,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 154 transitions, 838 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-12-02 12:47:27,782 INFO L231 Difference]: Finished difference. Result has 79 places, 99 transitions, 388 flow [2024-12-02 12:47:27,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=388, PETRI_PLACES=79, PETRI_TRANSITIONS=99} [2024-12-02 12:47:27,783 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2024-12-02 12:47:27,783 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 99 transitions, 388 flow [2024-12-02 12:47:27,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-12-02 12:47:27,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:47:27,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:47:27,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 12:47:27,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:27,985 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:47:27,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:47:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash 138924598, now seen corresponding path program 1 times [2024-12-02 12:47:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:47:27,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1171887852] [2024-12-02 12:47:27,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:27,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:27,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:47:27,988 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:47:27,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 12:47:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:47:28,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-02 12:47:28,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:47:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:47:28,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:47:28,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:47:28,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171887852] [2024-12-02 12:47:28,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171887852] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:47:28,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:47:28,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:47:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571174496] [2024-12-02 12:47:28,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:47:28,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 12:47:28,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:47:28,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 12:47:28,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:47:28,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2024-12-02 12:47:28,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 99 transitions, 388 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:47:28,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:47:28,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2024-12-02 12:47:28,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:47:29,851 INFO L124 PetriNetUnfolderBase]: 11185/16918 cut-off events. [2024-12-02 12:47:29,851 INFO L125 PetriNetUnfolderBase]: For 1239/1239 co-relation queries the response was YES. [2024-12-02 12:47:29,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37428 conditions, 16918 events. 11185/16918 cut-off events. For 1239/1239 co-relation queries the response was YES. Maximal size of possible extension queue 1656. Compared 140658 event pairs, 10806 based on Foata normal form. 328/9565 useless extension candidates. Maximal degree in co-relation 37262. Up to 13481 conditions per place. [2024-12-02 12:47:29,925 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 112 selfloop transitions, 7 changer transitions 0/139 dead transitions. [2024-12-02 12:47:29,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 139 transitions, 772 flow [2024-12-02 12:47:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 12:47:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 12:47:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2024-12-02 12:47:29,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2024-12-02 12:47:29,926 INFO L175 Difference]: Start difference. First operand has 79 places, 99 transitions, 388 flow. Second operand 4 states and 194 transitions. [2024-12-02 12:47:29,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 139 transitions, 772 flow [2024-12-02 12:47:29,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 139 transitions, 768 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-12-02 12:47:29,931 INFO L231 Difference]: Finished difference. Result has 82 places, 99 transitions, 415 flow [2024-12-02 12:47:29,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=82, PETRI_TRANSITIONS=99} [2024-12-02 12:47:29,932 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 6 predicate places. [2024-12-02 12:47:29,932 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 99 transitions, 415 flow [2024-12-02 12:47:29,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:47:29,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:47:29,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:47:29,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 12:47:30,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:30,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:47:30,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:47:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2109553042, now seen corresponding path program 1 times [2024-12-02 12:47:30,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:47:30,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582354014] [2024-12-02 12:47:30,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:30,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:30,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:47:30,135 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:47:30,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 12:47:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:47:30,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-02 12:47:30,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:47:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:47:30,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:47:30,285 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:47:30,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582354014] [2024-12-02 12:47:30,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582354014] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:47:30,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:47:30,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:47:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668465117] [2024-12-02 12:47:30,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:47:30,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:47:30,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:47:30,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:47:30,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:47:30,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:47:30,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 99 transitions, 415 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-12-02 12:47:30,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:47:30,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:47:30,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:47:35,022 INFO L124 PetriNetUnfolderBase]: 34679/48291 cut-off events. [2024-12-02 12:47:35,022 INFO L125 PetriNetUnfolderBase]: For 5704/6964 co-relation queries the response was YES. [2024-12-02 12:47:35,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122013 conditions, 48291 events. 34679/48291 cut-off events. For 5704/6964 co-relation queries the response was YES. Maximal size of possible extension queue 3702. Compared 371254 event pairs, 14797 based on Foata normal form. 0/26498 useless extension candidates. Maximal degree in co-relation 121845. Up to 14863 conditions per place. [2024-12-02 12:47:35,245 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 195 selfloop transitions, 12 changer transitions 0/224 dead transitions. [2024-12-02 12:47:35,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 224 transitions, 1223 flow [2024-12-02 12:47:35,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 12:47:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 12:47:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 375 transitions. [2024-12-02 12:47:35,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-12-02 12:47:35,246 INFO L175 Difference]: Start difference. First operand has 82 places, 99 transitions, 415 flow. Second operand 8 states and 375 transitions. [2024-12-02 12:47:35,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 224 transitions, 1223 flow [2024-12-02 12:47:35,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 224 transitions, 1215 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-12-02 12:47:35,259 INFO L231 Difference]: Finished difference. Result has 91 places, 103 transitions, 461 flow [2024-12-02 12:47:35,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=461, PETRI_PLACES=91, PETRI_TRANSITIONS=103} [2024-12-02 12:47:35,260 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 15 predicate places. [2024-12-02 12:47:35,260 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 103 transitions, 461 flow [2024-12-02 12:47:35,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-12-02 12:47:35,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:47:35,260 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2024-12-02 12:47:35,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 12:47:35,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:35,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:47:35,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:47:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash 987142626, now seen corresponding path program 2 times [2024-12-02 12:47:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:47:35,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153750201] [2024-12-02 12:47:35,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:47:35,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:35,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:47:35,463 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:47:35,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 12:47:35,532 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:47:35,532 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:47:35,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-02 12:47:35,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:47:35,543 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 7 [2024-12-02 12:47:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:47:35,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:47:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:47:36,416 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:47:36,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153750201] [2024-12-02 12:47:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153750201] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:47:36,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 12:47:36,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-12-02 12:47:36,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074113865] [2024-12-02 12:47:36,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 12:47:36,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 12:47:36,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:47:36,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 12:47:36,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-12-02 12:47:36,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:47:36,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 103 transitions, 461 flow. Second operand has 14 states, 14 states have (on average 26.571428571428573) internal successors, (372), 14 states have internal predecessors, (372), 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-12-02 12:47:36,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:47:36,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:47:36,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:47:40,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 12:47:42,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 12:47:45,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 12:47:46,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 12:47:50,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 12:47:57,981 INFO L124 PetriNetUnfolderBase]: 23398/35114 cut-off events. [2024-12-02 12:47:57,981 INFO L125 PetriNetUnfolderBase]: For 9668/9668 co-relation queries the response was YES. [2024-12-02 12:47:58,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90880 conditions, 35114 events. 23398/35114 cut-off events. For 9668/9668 co-relation queries the response was YES. Maximal size of possible extension queue 2918. Compared 307017 event pairs, 22136 based on Foata normal form. 42/20296 useless extension candidates. Maximal degree in co-relation 90230. Up to 31524 conditions per place. [2024-12-02 12:47:58,167 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 48 selfloop transitions, 91 changer transitions 0/157 dead transitions. [2024-12-02 12:47:58,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 157 transitions, 1027 flow [2024-12-02 12:47:58,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-12-02 12:47:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-12-02 12:47:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 704 transitions. [2024-12-02 12:47:58,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2024-12-02 12:47:58,170 INFO L175 Difference]: Start difference. First operand has 91 places, 103 transitions, 461 flow. Second operand 22 states and 704 transitions. [2024-12-02 12:47:58,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 157 transitions, 1027 flow [2024-12-02 12:47:58,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 157 transitions, 1002 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 12:47:58,191 INFO L231 Difference]: Finished difference. Result has 117 places, 157 transitions, 992 flow [2024-12-02 12:47:58,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=992, PETRI_PLACES=117, PETRI_TRANSITIONS=157} [2024-12-02 12:47:58,192 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 41 predicate places. [2024-12-02 12:47:58,192 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 157 transitions, 992 flow [2024-12-02 12:47:58,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 26.571428571428573) internal successors, (372), 14 states have internal predecessors, (372), 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-12-02 12:47:58,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:47:58,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:47:58,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 12:47:58,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:58,393 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:47:58,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:47:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash 369547098, now seen corresponding path program 1 times [2024-12-02 12:47:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:47:58,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935514991] [2024-12-02 12:47:58,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:58,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:47:58,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:47:58,395 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:47:58,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 12:47:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:47:58,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-02 12:47:58,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:47:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:47:58,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:47:58,535 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:47:58,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935514991] [2024-12-02 12:47:58,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935514991] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:47:58,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:47:58,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:47:58,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282506628] [2024-12-02 12:47:58,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:47:58,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:47:58,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:47:58,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:47:58,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:47:58,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:47:58,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 157 transitions, 992 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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-12-02 12:47:58,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:47:58,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:47:58,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:48:05,293 INFO L124 PetriNetUnfolderBase]: 47715/66305 cut-off events. [2024-12-02 12:48:05,293 INFO L125 PetriNetUnfolderBase]: For 18817/27257 co-relation queries the response was YES. [2024-12-02 12:48:05,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177479 conditions, 66305 events. 47715/66305 cut-off events. For 18817/27257 co-relation queries the response was YES. Maximal size of possible extension queue 5104. Compared 528585 event pairs, 20332 based on Foata normal form. 0/37416 useless extension candidates. Maximal degree in co-relation 177216. Up to 27391 conditions per place. [2024-12-02 12:48:05,694 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 236 selfloop transitions, 18 changer transitions 0/272 dead transitions. [2024-12-02 12:48:05,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 272 transitions, 1891 flow [2024-12-02 12:48:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 12:48:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 12:48:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 360 transitions. [2024-12-02 12:48:05,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-12-02 12:48:05,696 INFO L175 Difference]: Start difference. First operand has 117 places, 157 transitions, 992 flow. Second operand 8 states and 360 transitions. [2024-12-02 12:48:05,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 272 transitions, 1891 flow [2024-12-02 12:48:05,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 272 transitions, 1659 flow, removed 67 selfloop flow, removed 9 redundant places. [2024-12-02 12:48:05,720 INFO L231 Difference]: Finished difference. Result has 118 places, 161 transitions, 832 flow [2024-12-02 12:48:05,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=832, PETRI_PLACES=118, PETRI_TRANSITIONS=161} [2024-12-02 12:48:05,721 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 42 predicate places. [2024-12-02 12:48:05,721 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 161 transitions, 832 flow [2024-12-02 12:48:05,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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-12-02 12:48:05,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:48:05,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:48:05,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 12:48:05,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:48:05,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:48:05,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:48:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash -806067846, now seen corresponding path program 1 times [2024-12-02 12:48:05,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:48:05,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1487179598] [2024-12-02 12:48:05,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:48:05,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:48:05,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:48:05,923 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:48:05,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 12:48:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:48:05,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 12:48:05,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:48:05,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-12-02 12:48:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:48:06,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:48:06,018 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:48:06,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487179598] [2024-12-02 12:48:06,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487179598] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:48:06,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:48:06,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:48:06,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043209062] [2024-12-02 12:48:06,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:48:06,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 12:48:06,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:48:06,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 12:48:06,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:48:06,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:48:06,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 161 transitions, 832 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:48:06,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:48:06,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:48:06,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:48:09,597 INFO L124 PetriNetUnfolderBase]: 25292/37233 cut-off events. [2024-12-02 12:48:09,597 INFO L125 PetriNetUnfolderBase]: For 17487/17487 co-relation queries the response was YES. [2024-12-02 12:48:09,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102903 conditions, 37233 events. 25292/37233 cut-off events. For 17487/17487 co-relation queries the response was YES. Maximal size of possible extension queue 2745. Compared 311509 event pairs, 23106 based on Foata normal form. 0/23649 useless extension candidates. Maximal degree in co-relation 102675. Up to 33601 conditions per place. [2024-12-02 12:48:09,827 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 125 selfloop transitions, 12 changer transitions 0/159 dead transitions. [2024-12-02 12:48:09,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 159 transitions, 1098 flow [2024-12-02 12:48:09,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 12:48:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 12:48:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2024-12-02 12:48:09,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4766666666666667 [2024-12-02 12:48:09,828 INFO L175 Difference]: Start difference. First operand has 118 places, 161 transitions, 832 flow. Second operand 4 states and 143 transitions. [2024-12-02 12:48:09,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 159 transitions, 1098 flow [2024-12-02 12:48:09,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 159 transitions, 1085 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 12:48:09,848 INFO L231 Difference]: Finished difference. Result has 118 places, 159 transitions, 835 flow [2024-12-02 12:48:09,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=835, PETRI_PLACES=118, PETRI_TRANSITIONS=159} [2024-12-02 12:48:09,849 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 42 predicate places. [2024-12-02 12:48:09,849 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 159 transitions, 835 flow [2024-12-02 12:48:09,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:48:09,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:48:09,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:48:10,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:48:10,067 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:48:10,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 12:48:10,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:48:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash -806067845, now seen corresponding path program 1 times [2024-12-02 12:48:10,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:48:10,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1040328836] [2024-12-02 12:48:10,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:48:10,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:48:10,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:48:10,069 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:48:10,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 12:48:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:48:10,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-02 12:48:10,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:48:10,166 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 7 [2024-12-02 12:48:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:48:10,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:48:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:48:10,820 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:48:10,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040328836] [2024-12-02 12:48:10,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040328836] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:48:10,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 12:48:10,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-12-02 12:48:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274267737] [2024-12-02 12:48:10,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 12:48:10,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:48:10,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:48:10,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:48:10,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:48:11,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:48:11,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 159 transitions, 835 flow. Second operand has 12 states, 12 states have (on average 26.666666666666668) internal successors, (320), 12 states have internal predecessors, (320), 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-12-02 12:48:11,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:48:11,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:48:11,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:48:19,919 INFO L124 PetriNetUnfolderBase]: 46288/68449 cut-off events. [2024-12-02 12:48:19,919 INFO L125 PetriNetUnfolderBase]: For 33263/33263 co-relation queries the response was YES. [2024-12-02 12:48:20,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191877 conditions, 68449 events. 46288/68449 cut-off events. For 33263/33263 co-relation queries the response was YES. Maximal size of possible extension queue 5006. Compared 608830 event pairs, 31255 based on Foata normal form. 0/45404 useless extension candidates. Maximal degree in co-relation 191639. Up to 18552 conditions per place. [2024-12-02 12:48:20,420 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 149 selfloop transitions, 85 changer transitions 0/253 dead transitions. [2024-12-02 12:48:20,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 253 transitions, 1640 flow [2024-12-02 12:48:20,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:48:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 12:48:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 419 transitions. [2024-12-02 12:48:20,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5586666666666666 [2024-12-02 12:48:20,422 INFO L175 Difference]: Start difference. First operand has 118 places, 159 transitions, 835 flow. Second operand 10 states and 419 transitions. [2024-12-02 12:48:20,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 253 transitions, 1640 flow [2024-12-02 12:48:20,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 253 transitions, 1627 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 12:48:20,470 INFO L231 Difference]: Finished difference. Result has 127 places, 161 transitions, 1015 flow [2024-12-02 12:48:20,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1015, PETRI_PLACES=127, PETRI_TRANSITIONS=161} [2024-12-02 12:48:20,471 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 51 predicate places. [2024-12-02 12:48:20,471 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 161 transitions, 1015 flow [2024-12-02 12:48:20,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.666666666666668) internal successors, (320), 12 states have internal predecessors, (320), 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-12-02 12:48:20,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:48:20,472 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:48:20,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 12:48:20,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:48:20,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:48:20,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:48:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash -806067848, now seen corresponding path program 1 times [2024-12-02 12:48:20,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:48:20,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1950379539] [2024-12-02 12:48:20,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:48:20,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:48:20,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:48:20,675 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:48:20,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 12:48:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:48:20,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-02 12:48:20,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:48:20,786 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-12-02 12:48:20,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-12-02 12:48:20,814 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-12-02 12:48:20,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-12-02 12:48:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:48:20,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:48:20,855 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:48:20,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950379539] [2024-12-02 12:48:20,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950379539] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:48:20,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:48:20,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 12:48:20,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793953181] [2024-12-02 12:48:20,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:48:20,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:48:20,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:48:20,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:48:20,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:48:20,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:48:20,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 161 transitions, 1015 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:48:20,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:48:20,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:48:20,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:48:26,708 INFO L124 PetriNetUnfolderBase]: 31379/46907 cut-off events. [2024-12-02 12:48:26,708 INFO L125 PetriNetUnfolderBase]: For 36885/36885 co-relation queries the response was YES. [2024-12-02 12:48:26,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136027 conditions, 46907 events. 31379/46907 cut-off events. For 36885/36885 co-relation queries the response was YES. Maximal size of possible extension queue 3182. Compared 411259 event pairs, 27803 based on Foata normal form. 0/34393 useless extension candidates. Maximal degree in co-relation 135763. Up to 42223 conditions per place. [2024-12-02 12:48:27,184 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 114 selfloop transitions, 23 changer transitions 0/159 dead transitions. [2024-12-02 12:48:27,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 159 transitions, 1281 flow [2024-12-02 12:48:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:48:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 12:48:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2024-12-02 12:48:27,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44266666666666665 [2024-12-02 12:48:27,185 INFO L175 Difference]: Start difference. First operand has 127 places, 161 transitions, 1015 flow. Second operand 5 states and 166 transitions. [2024-12-02 12:48:27,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 159 transitions, 1281 flow [2024-12-02 12:48:27,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 159 transitions, 1228 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 12:48:27,254 INFO L231 Difference]: Finished difference. Result has 124 places, 159 transitions, 1000 flow [2024-12-02 12:48:27,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1000, PETRI_PLACES=124, PETRI_TRANSITIONS=159} [2024-12-02 12:48:27,255 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 48 predicate places. [2024-12-02 12:48:27,255 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 159 transitions, 1000 flow [2024-12-02 12:48:27,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:48:27,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:48:27,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:48:27,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 12:48:27,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:48:27,456 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:48:27,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:48:27,456 INFO L85 PathProgramCache]: Analyzing trace with hash -806067847, now seen corresponding path program 1 times [2024-12-02 12:48:27,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:48:27,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275298091] [2024-12-02 12:48:27,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:48:27,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:48:27,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:48:27,458 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:48:27,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 12:48:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:48:27,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-12-02 12:48:27,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:48:27,574 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 7 [2024-12-02 12:48:27,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 12:48:27,711 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 16 treesize of output 11 [2024-12-02 12:48:27,727 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-12-02 12:48:27,727 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 13 treesize of output 13 [2024-12-02 12:48:27,786 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-12-02 12:48:27,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2024-12-02 12:48:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:48:28,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:48:29,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 12:48:29,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 101 [2024-12-02 12:48:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:48:31,992 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:48:31,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275298091] [2024-12-02 12:48:31,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275298091] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:48:31,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 12:48:31,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2024-12-02 12:48:31,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022466578] [2024-12-02 12:48:31,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 12:48:31,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 12:48:31,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:48:31,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 12:48:31,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-12-02 12:48:33,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75 [2024-12-02 12:48:33,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 159 transitions, 1000 flow. Second operand has 17 states, 17 states have (on average 23.176470588235293) internal successors, (394), 17 states have internal predecessors, (394), 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-12-02 12:48:33,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:48:33,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75 [2024-12-02 12:48:33,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:48:37,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:48:48,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:49:21,059 INFO L124 PetriNetUnfolderBase]: 49522/73734 cut-off events. [2024-12-02 12:49:21,059 INFO L125 PetriNetUnfolderBase]: For 67083/67083 co-relation queries the response was YES. [2024-12-02 12:49:21,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213571 conditions, 73734 events. 49522/73734 cut-off events. For 67083/67083 co-relation queries the response was YES. Maximal size of possible extension queue 4876. Compared 671613 event pairs, 43532 based on Foata normal form. 2104/57510 useless extension candidates. Maximal degree in co-relation 213192. Up to 40066 conditions per place. [2024-12-02 12:49:21,671 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 177 selfloop transitions, 159 changer transitions 0/355 dead transitions. [2024-12-02 12:49:21,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 355 transitions, 2853 flow [2024-12-02 12:49:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-12-02 12:49:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-12-02 12:49:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 626 transitions. [2024-12-02 12:49:21,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39746031746031746 [2024-12-02 12:49:21,675 INFO L175 Difference]: Start difference. First operand has 124 places, 159 transitions, 1000 flow. Second operand 21 states and 626 transitions. [2024-12-02 12:49:21,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 355 transitions, 2853 flow [2024-12-02 12:49:21,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 355 transitions, 2805 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 12:49:21,797 INFO L231 Difference]: Finished difference. Result has 144 places, 252 transitions, 2161 flow [2024-12-02 12:49:21,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2161, PETRI_PLACES=144, PETRI_TRANSITIONS=252} [2024-12-02 12:49:21,798 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 68 predicate places. [2024-12-02 12:49:21,798 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 252 transitions, 2161 flow [2024-12-02 12:49:21,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 23.176470588235293) internal successors, (394), 17 states have internal predecessors, (394), 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-12-02 12:49:21,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:49:21,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:49:21,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 12:49:21,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:49:21,999 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:49:21,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:49:21,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1837544513, now seen corresponding path program 1 times [2024-12-02 12:49:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:49:21,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2052714477] [2024-12-02 12:49:21,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:49:22,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:49:22,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:49:22,001 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:49:22,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 12:49:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:49:22,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-12-02 12:49:22,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:49:22,113 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 7 [2024-12-02 12:49:22,417 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-12-02 12:49:22,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2024-12-02 12:49:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:49:23,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:49:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:49:26,726 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:49:26,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052714477] [2024-12-02 12:49:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052714477] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:49:26,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 12:49:26,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-12-02 12:49:26,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739441328] [2024-12-02 12:49:26,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 12:49:26,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 12:49:26,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:49:26,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 12:49:26,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-12-02 12:49:27,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:49:27,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 252 transitions, 2161 flow. Second operand has 16 states, 16 states have (on average 26.4375) internal successors, (423), 16 states have internal predecessors, (423), 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-12-02 12:49:27,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:49:27,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:49:27,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:49:54,916 INFO L124 PetriNetUnfolderBase]: 83779/124457 cut-off events. [2024-12-02 12:49:54,916 INFO L125 PetriNetUnfolderBase]: For 155311/155311 co-relation queries the response was YES. [2024-12-02 12:49:55,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376224 conditions, 124457 events. 83779/124457 cut-off events. For 155311/155311 co-relation queries the response was YES. Maximal size of possible extension queue 8320. Compared 1190671 event pairs, 73277 based on Foata normal form. 0/98814 useless extension candidates. Maximal degree in co-relation 375656. Up to 60854 conditions per place. [2024-12-02 12:49:55,883 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 166 selfloop transitions, 211 changer transitions 0/396 dead transitions. [2024-12-02 12:49:55,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 396 transitions, 3957 flow [2024-12-02 12:49:55,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 12:49:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-12-02 12:49:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 471 transitions. [2024-12-02 12:49:55,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44857142857142857 [2024-12-02 12:49:55,885 INFO L175 Difference]: Start difference. First operand has 144 places, 252 transitions, 2161 flow. Second operand 14 states and 471 transitions. [2024-12-02 12:49:55,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 396 transitions, 3957 flow [2024-12-02 12:49:56,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 396 transitions, 3954 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 12:49:56,401 INFO L231 Difference]: Finished difference. Result has 159 places, 318 transitions, 3463 flow [2024-12-02 12:49:56,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3463, PETRI_PLACES=159, PETRI_TRANSITIONS=318} [2024-12-02 12:49:56,402 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 83 predicate places. [2024-12-02 12:49:56,402 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 318 transitions, 3463 flow [2024-12-02 12:49:56,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 26.4375) internal successors, (423), 16 states have internal predecessors, (423), 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-12-02 12:49:56,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:49:56,402 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:49:56,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 12:49:56,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:49:56,602 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:49:56,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:49:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1251354328, now seen corresponding path program 2 times [2024-12-02 12:49:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:49:56,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2082115747] [2024-12-02 12:49:56,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:49:56,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:49:56,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:49:56,605 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:49:56,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 12:49:56,686 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 12:49:56,686 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:49:56,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 12:49:56,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:49:56,702 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 7 [2024-12-02 12:49:56,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-12-02 12:49:56,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 12:49:56,883 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 16 treesize of output 11 [2024-12-02 12:49:56,954 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-12-02 12:49:56,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-12-02 12:49:57,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 12:49:57,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-12-02 12:49:57,124 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-12-02 12:49:57,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-12-02 12:49:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 12:49:57,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:49:57,331 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:49:57,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082115747] [2024-12-02 12:49:57,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082115747] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:49:57,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:49:57,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:49:57,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882205482] [2024-12-02 12:49:57,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:49:57,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:49:57,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:49:57,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:49:57,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:49:57,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:49:57,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 318 transitions, 3463 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:49:57,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:49:57,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:49:57,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:50:09,749 INFO L124 PetriNetUnfolderBase]: 62968/94742 cut-off events. [2024-12-02 12:50:09,749 INFO L125 PetriNetUnfolderBase]: For 153017/153017 co-relation queries the response was YES. [2024-12-02 12:50:10,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285590 conditions, 94742 events. 62968/94742 cut-off events. For 153017/153017 co-relation queries the response was YES. Maximal size of possible extension queue 6245. Compared 901625 event pairs, 54418 based on Foata normal form. 5413/83132 useless extension candidates. Maximal degree in co-relation 284952. Up to 85025 conditions per place. [2024-12-02 12:50:10,604 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 282 selfloop transitions, 12 changer transitions 0/316 dead transitions. [2024-12-02 12:50:10,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 316 transitions, 4035 flow [2024-12-02 12:50:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 12:50:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 12:50:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-12-02 12:50:10,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4633333333333333 [2024-12-02 12:50:10,606 INFO L175 Difference]: Start difference. First operand has 159 places, 318 transitions, 3463 flow. Second operand 4 states and 139 transitions. [2024-12-02 12:50:10,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 316 transitions, 4035 flow [2024-12-02 12:50:11,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 316 transitions, 3920 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 12:50:11,210 INFO L231 Difference]: Finished difference. Result has 157 places, 316 transitions, 3356 flow [2024-12-02 12:50:11,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=3332, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3356, PETRI_PLACES=157, PETRI_TRANSITIONS=316} [2024-12-02 12:50:11,211 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 81 predicate places. [2024-12-02 12:50:11,211 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 316 transitions, 3356 flow [2024-12-02 12:50:11,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:50:11,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:50:11,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:50:11,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 12:50:11,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:50:11,411 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 12:50:11,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:50:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1837544511, now seen corresponding path program 1 times [2024-12-02 12:50:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 12:50:11,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2041704408] [2024-12-02 12:50:11,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:50:11,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:50:11,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:50:11,414 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:50:11,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9be5a10-9ff3-4bcb-ab55-7ab1f5d6a41f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 12:50:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:50:11,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-02 12:50:11,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:50:11,547 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 7 [2024-12-02 12:50:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:50:12,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:50:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 12:50:12,825 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 12:50:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041704408] [2024-12-02 12:50:12,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041704408] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:50:12,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 12:50:12,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-12-02 12:50:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367177425] [2024-12-02 12:50:12,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 12:50:12,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:50:12,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 12:50:12,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:50:12,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:50:13,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-12-02 12:50:13,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 316 transitions, 3356 flow. Second operand has 12 states, 12 states have (on average 27.0) internal successors, (324), 12 states have internal predecessors, (324), 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-12-02 12:50:13,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:50:13,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-12-02 12:50:13,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand