./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:13:03,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:13:03,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:13:03,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:13:03,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:13:03,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:13:03,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:13:03,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:13:03,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:13:03,125 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:13:03,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:13:03,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:13:03,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:13:03,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:13:03,127 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:13:03,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:13:03,127 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:13:03,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:13:03,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:13:03,128 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:13:03,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:13:03,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:13:03,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:13:03,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:13:03,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:13:03,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:13:03,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:13:03,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:13:03,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:13:03,129 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 [2025-03-04 10:13:03,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:13:03,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:13:03,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:13:03,365 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:13:03,365 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:13:03,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-03-04 10:13:04,471 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0281c5437/18026d5288c0460b85f94a89f7d7ec8c/FLAG875df2956 [2025-03-04 10:13:04,722 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:13:04,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-03-04 10:13:04,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0281c5437/18026d5288c0460b85f94a89f7d7ec8c/FLAG875df2956 [2025-03-04 10:13:05,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0281c5437/18026d5288c0460b85f94a89f7d7ec8c [2025-03-04 10:13:05,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:13:05,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:13:05,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:13:05,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:13:05,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:13:05,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9efe1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05, skipping insertion in model container [2025-03-04 10:13:05,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:13:05,217 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:13:05,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:13:05,235 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:13:05,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:13:05,276 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:13:05,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05 WrapperNode [2025-03-04 10:13:05,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:13:05,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:13:05,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:13:05,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:13:05,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,311 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 276 [2025-03-04 10:13:05,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:13:05,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:13:05,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:13:05,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:13:05,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,341 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 10:13:05,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:13:05,353 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:13:05,353 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:13:05,353 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:13:05,354 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05" (1/1) ... [2025-03-04 10:13:05,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:13:05,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:05,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:13:05,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:13:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:13:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:13:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:13:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 10:13:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:13:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:13:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:13:05,401 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:13:05,497 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:13:05,498 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:13:05,851 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:13:05,852 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:13:06,092 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:13:06,092 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:13:06,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:13:06 BoogieIcfgContainer [2025-03-04 10:13:06,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:13:06,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:13:06,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:13:06,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:13:06,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:13:05" (1/3) ... [2025-03-04 10:13:06,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b616a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:13:06, skipping insertion in model container [2025-03-04 10:13:06,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:05" (2/3) ... [2025-03-04 10:13:06,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b616a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:13:06, skipping insertion in model container [2025-03-04 10:13:06,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:13:06" (3/3) ... [2025-03-04 10:13:06,098 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2025-03-04 10:13:06,108 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:13:06,109 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult2.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-03-04 10:13:06,110 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:13:06,153 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 10:13:06,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 64 transitions, 156 flow [2025-03-04 10:13:06,207 INFO L124 PetriNetUnfolderBase]: 6/60 cut-off events. [2025-03-04 10:13:06,208 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:13:06,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 60 events. 6/60 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 122 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-03-04 10:13:06,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 64 transitions, 156 flow [2025-03-04 10:13:06,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 59 transitions, 142 flow [2025-03-04 10:13:06,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:13:06,236 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;@6217108c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:13:06,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 10:13:06,240 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:13:06,240 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:13:06,240 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:13:06,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:06,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:13:06,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:06,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:06,244 INFO L85 PathProgramCache]: Analyzing trace with hash 766275, now seen corresponding path program 1 times [2025-03-04 10:13:06,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:06,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661137911] [2025-03-04 10:13:06,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:06,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:06,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:13:06,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:13:06,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:06,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:06,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661137911] [2025-03-04 10:13:06,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661137911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:06,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:06,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:13:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769202964] [2025-03-04 10:13:06,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:06,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:13:06,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:06,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:13:06,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:13:06,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-04 10:13:06,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2025-03-04 10:13:06,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:06,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-04 10:13:06,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:07,753 INFO L124 PetriNetUnfolderBase]: 11253/15061 cut-off events. [2025-03-04 10:13:07,753 INFO L125 PetriNetUnfolderBase]: For 464/464 co-relation queries the response was YES. [2025-03-04 10:13:07,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30470 conditions, 15061 events. 11253/15061 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 86463 event pairs, 9160 based on Foata normal form. 1/10403 useless extension candidates. Maximal degree in co-relation 28212. Up to 14621 conditions per place. [2025-03-04 10:13:07,859 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 42 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-03-04 10:13:07,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 222 flow [2025-03-04 10:13:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:13:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:13:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-03-04 10:13:07,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2025-03-04 10:13:07,874 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 142 flow. Second operand 3 states and 95 transitions. [2025-03-04 10:13:07,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 222 flow [2025-03-04 10:13:07,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 206 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 10:13:07,897 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 122 flow [2025-03-04 10:13:07,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2025-03-04 10:13:07,902 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2025-03-04 10:13:07,903 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 122 flow [2025-03-04 10:13:07,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2025-03-04 10:13:07,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:07,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:13:07,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:13:07,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:07,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash 766276, now seen corresponding path program 1 times [2025-03-04 10:13:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:07,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032825580] [2025-03-04 10:13:07,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:07,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:07,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:13:07,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:13:07,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:07,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:08,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:08,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032825580] [2025-03-04 10:13:08,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032825580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:08,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:08,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:08,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167786389] [2025-03-04 10:13:08,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:08,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:08,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:08,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:08,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:08,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-04 10:13:08,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2025-03-04 10:13:08,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:08,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-04 10:13:08,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:09,227 INFO L124 PetriNetUnfolderBase]: 11254/15064 cut-off events. [2025-03-04 10:13:09,227 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-04 10:13:09,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29959 conditions, 15064 events. 11254/15064 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 86479 event pairs, 9160 based on Foata normal form. 0/10403 useless extension candidates. Maximal degree in co-relation 29930. Up to 14630 conditions per place. [2025-03-04 10:13:09,294 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 45 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-03-04 10:13:09,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 226 flow [2025-03-04 10:13:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-04 10:13:09,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4453125 [2025-03-04 10:13:09,298 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 122 flow. Second operand 4 states and 114 transitions. [2025-03-04 10:13:09,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 226 flow [2025-03-04 10:13:09,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:09,300 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 145 flow [2025-03-04 10:13:09,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2025-03-04 10:13:09,301 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2025-03-04 10:13:09,301 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 145 flow [2025-03-04 10:13:09,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2025-03-04 10:13:09,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:09,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:13:09,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:13:09,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:09,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:09,304 INFO L85 PathProgramCache]: Analyzing trace with hash 23755538, now seen corresponding path program 1 times [2025-03-04 10:13:09,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:09,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752999772] [2025-03-04 10:13:09,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:09,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:09,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:13:09,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:13:09,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:09,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:09,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:09,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752999772] [2025-03-04 10:13:09,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752999772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:09,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:09,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:09,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657663507] [2025-03-04 10:13:09,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:09,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:09,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:09,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:09,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:13:09,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-04 10:13:09,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:09,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:09,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-04 10:13:09,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:10,323 INFO L124 PetriNetUnfolderBase]: 11255/15067 cut-off events. [2025-03-04 10:13:10,323 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-04 10:13:10,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29976 conditions, 15067 events. 11255/15067 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 86499 event pairs, 9160 based on Foata normal form. 0/10405 useless extension candidates. Maximal degree in co-relation 29951. Up to 14629 conditions per place. [2025-03-04 10:13:10,380 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 45 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-03-04 10:13:10,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 255 flow [2025-03-04 10:13:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-04 10:13:10,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.415625 [2025-03-04 10:13:10,382 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 145 flow. Second operand 5 states and 133 transitions. [2025-03-04 10:13:10,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 255 flow [2025-03-04 10:13:10,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:10,383 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 179 flow [2025-03-04 10:13:10,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2025-03-04 10:13:10,384 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-03-04 10:13:10,384 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 179 flow [2025-03-04 10:13:10,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:10,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:10,384 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:13:10,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:13:10,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:10,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash 736414659, now seen corresponding path program 1 times [2025-03-04 10:13:10,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:10,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734758820] [2025-03-04 10:13:10,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:10,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:10,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:13:10,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:13:10,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:10,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:10,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734758820] [2025-03-04 10:13:10,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734758820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124240866] [2025-03-04 10:13:10,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:10,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:10,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:10,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:10,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:13:10,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:13:10,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:13:10,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:10,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:10,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:13:10,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:10,652 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 [2025-03-04 10:13:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:10,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:10,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124240866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:10,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:10,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:13:10,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933354185] [2025-03-04 10:13:10,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:10,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:13:10,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:10,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:13:10,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:13:11,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-04 10:13:11,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 179 flow. Second operand has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 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) [2025-03-04 10:13:11,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:11,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-04 10:13:11,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:12,332 INFO L124 PetriNetUnfolderBase]: 11255/15066 cut-off events. [2025-03-04 10:13:12,332 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-03-04 10:13:12,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29989 conditions, 15066 events. 11255/15066 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 86429 event pairs, 9160 based on Foata normal form. 0/10407 useless extension candidates. Maximal degree in co-relation 29961. Up to 14629 conditions per place. [2025-03-04 10:13:12,435 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 44 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-03-04 10:13:12,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 277 flow [2025-03-04 10:13:12,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:13:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:13:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-03-04 10:13:12,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3776041666666667 [2025-03-04 10:13:12,437 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 179 flow. Second operand 6 states and 145 transitions. [2025-03-04 10:13:12,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 277 flow [2025-03-04 10:13:12,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 60 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:12,439 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 188 flow [2025-03-04 10:13:12,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2025-03-04 10:13:12,440 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2025-03-04 10:13:12,441 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 188 flow [2025-03-04 10:13:12,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 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) [2025-03-04 10:13:12,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:12,441 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 10:13:12,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:13:12,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:12,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:12,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:12,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1354259181, now seen corresponding path program 1 times [2025-03-04 10:13:12,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:12,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009045220] [2025-03-04 10:13:12,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:12,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:12,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:13:12,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:13:12,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:12,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:12,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009045220] [2025-03-04 10:13:12,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009045220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:12,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317926753] [2025-03-04 10:13:12,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:12,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:12,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:12,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:12,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:13:12,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:13:12,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:13:12,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:12,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:12,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:13:12,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:12,900 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 [2025-03-04 10:13:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:13,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:13,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317926753] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:13,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:13,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:13:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585275412] [2025-03-04 10:13:13,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:13,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:13:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:13,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:13:13,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:13:13,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-04 10:13:13,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 188 flow. Second operand has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 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) [2025-03-04 10:13:13,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:13,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-04 10:13:13,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:14,109 INFO L124 PetriNetUnfolderBase]: 11257/15071 cut-off events. [2025-03-04 10:13:14,109 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-04 10:13:14,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30015 conditions, 15071 events. 11257/15071 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 86581 event pairs, 9160 based on Foata normal form. 0/10412 useless extension candidates. Maximal degree in co-relation 29969. Up to 14622 conditions per place. [2025-03-04 10:13:14,166 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 38 selfloop transitions, 18 changer transitions 0/65 dead transitions. [2025-03-04 10:13:14,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 65 transitions, 329 flow [2025-03-04 10:13:14,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:13:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:13:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions. [2025-03-04 10:13:14,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2025-03-04 10:13:14,168 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 188 flow. Second operand 9 states and 202 transitions. [2025-03-04 10:13:14,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 65 transitions, 329 flow [2025-03-04 10:13:14,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 282 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-04 10:13:14,170 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 206 flow [2025-03-04 10:13:14,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=206, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2025-03-04 10:13:14,170 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-03-04 10:13:14,171 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 206 flow [2025-03-04 10:13:14,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 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) [2025-03-04 10:13:14,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:14,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:14,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:14,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:14,372 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:14,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:14,372 INFO L85 PathProgramCache]: Analyzing trace with hash 145094952, now seen corresponding path program 1 times [2025-03-04 10:13:14,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:14,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870083733] [2025-03-04 10:13:14,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:14,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:13:14,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:13:14,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:14,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:14,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:14,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870083733] [2025-03-04 10:13:14,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870083733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:14,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:14,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:14,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249615648] [2025-03-04 10:13:14,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:14,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:14,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:14,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:14,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-03-04 10:13:14,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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) [2025-03-04 10:13:14,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:14,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-03-04 10:13:14,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:15,334 INFO L124 PetriNetUnfolderBase]: 13736/18598 cut-off events. [2025-03-04 10:13:15,334 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-03-04 10:13:15,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37047 conditions, 18598 events. 13736/18598 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 110185 event pairs, 11357 based on Foata normal form. 541/14023 useless extension candidates. Maximal degree in co-relation 29954. Up to 14636 conditions per place. [2025-03-04 10:13:15,401 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 91 selfloop transitions, 3 changer transitions 0/103 dead transitions. [2025-03-04 10:13:15,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 516 flow [2025-03-04 10:13:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2025-03-04 10:13:15,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61328125 [2025-03-04 10:13:15,402 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 206 flow. Second operand 4 states and 157 transitions. [2025-03-04 10:13:15,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 516 flow [2025-03-04 10:13:15,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 103 transitions, 463 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 10:13:15,404 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 192 flow [2025-03-04 10:13:15,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2025-03-04 10:13:15,404 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-03-04 10:13:15,405 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 192 flow [2025-03-04 10:13:15,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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) [2025-03-04 10:13:15,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:15,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:15,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:13:15,405 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:15,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:15,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1826318839, now seen corresponding path program 1 times [2025-03-04 10:13:15,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:15,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966110732] [2025-03-04 10:13:15,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:15,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:15,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:13:15,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:13:15,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:15,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:15,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:15,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966110732] [2025-03-04 10:13:15,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966110732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:15,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:15,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:15,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840535448] [2025-03-04 10:13:15,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:15,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:15,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:15,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:15,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:15,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-04 10:13:15,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-04 10:13:15,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:15,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-04 10:13:15,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:16,101 INFO L124 PetriNetUnfolderBase]: 10422/14172 cut-off events. [2025-03-04 10:13:16,101 INFO L125 PetriNetUnfolderBase]: For 994/994 co-relation queries the response was YES. [2025-03-04 10:13:16,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30022 conditions, 14172 events. 10422/14172 cut-off events. For 994/994 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 81726 event pairs, 8512 based on Foata normal form. 0/10809 useless extension candidates. Maximal degree in co-relation 22974. Up to 13740 conditions per place. [2025-03-04 10:13:16,147 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 47 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-04 10:13:16,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 292 flow [2025-03-04 10:13:16,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-03-04 10:13:16,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3875 [2025-03-04 10:13:16,148 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 192 flow. Second operand 5 states and 124 transitions. [2025-03-04 10:13:16,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 292 flow [2025-03-04 10:13:16,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:16,149 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 193 flow [2025-03-04 10:13:16,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2025-03-04 10:13:16,150 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-03-04 10:13:16,150 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 193 flow [2025-03-04 10:13:16,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-04 10:13:16,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:16,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:16,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:13:16,150 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:16,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:16,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1343650501, now seen corresponding path program 1 times [2025-03-04 10:13:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:16,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935366784] [2025-03-04 10:13:16,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:16,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:16,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:13:16,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:13:16,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:16,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:16,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:16,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935366784] [2025-03-04 10:13:16,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935366784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:16,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:16,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:16,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623905642] [2025-03-04 10:13:16,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:16,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:16,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:16,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:16,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:16,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-04 10:13:16,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-04 10:13:16,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:16,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-04 10:13:16,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:16,627 INFO L124 PetriNetUnfolderBase]: 7444/10196 cut-off events. [2025-03-04 10:13:16,627 INFO L125 PetriNetUnfolderBase]: For 714/714 co-relation queries the response was YES. [2025-03-04 10:13:16,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21596 conditions, 10196 events. 7444/10196 cut-off events. For 714/714 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 56393 event pairs, 5940 based on Foata normal form. 0/8326 useless extension candidates. Maximal degree in co-relation 16457. Up to 9832 conditions per place. [2025-03-04 10:13:16,670 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 48 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2025-03-04 10:13:16,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 293 flow [2025-03-04 10:13:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-04 10:13:16,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4140625 [2025-03-04 10:13:16,671 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 193 flow. Second operand 4 states and 106 transitions. [2025-03-04 10:13:16,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 293 flow [2025-03-04 10:13:16,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 282 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:13:16,673 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 186 flow [2025-03-04 10:13:16,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2025-03-04 10:13:16,674 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2025-03-04 10:13:16,674 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 186 flow [2025-03-04 10:13:16,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-04 10:13:16,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:16,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:16,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:13:16,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:16,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:16,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1343650502, now seen corresponding path program 1 times [2025-03-04 10:13:16,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:16,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188860981] [2025-03-04 10:13:16,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:16,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:16,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:13:16,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:13:16,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:16,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:16,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:16,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188860981] [2025-03-04 10:13:16,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188860981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:16,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:16,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:16,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49898999] [2025-03-04 10:13:16,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:16,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:16,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:16,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:16,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:16,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-03-04 10:13:16,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2025-03-04 10:13:16,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:16,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-03-04 10:13:16,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:17,493 INFO L124 PetriNetUnfolderBase]: 9866/13812 cut-off events. [2025-03-04 10:13:17,493 INFO L125 PetriNetUnfolderBase]: For 967/967 co-relation queries the response was YES. [2025-03-04 10:13:17,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29281 conditions, 13812 events. 9866/13812 cut-off events. For 967/967 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 82058 event pairs, 8104 based on Foata normal form. 440/12376 useless extension candidates. Maximal degree in co-relation 16457. Up to 9848 conditions per place. [2025-03-04 10:13:17,558 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 74 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2025-03-04 10:13:17,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 414 flow [2025-03-04 10:13:17,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2025-03-04 10:13:17,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5703125 [2025-03-04 10:13:17,559 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 186 flow. Second operand 4 states and 146 transitions. [2025-03-04 10:13:17,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 414 flow [2025-03-04 10:13:17,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:17,562 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 200 flow [2025-03-04 10:13:17,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2025-03-04 10:13:17,562 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-03-04 10:13:17,562 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 200 flow [2025-03-04 10:13:17,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2025-03-04 10:13:17,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:17,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:17,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:13:17,563 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:17,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1826318838, now seen corresponding path program 1 times [2025-03-04 10:13:17,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:17,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706955964] [2025-03-04 10:13:17,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:17,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:17,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:13:17,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:13:17,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:17,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:17,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:17,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706955964] [2025-03-04 10:13:17,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706955964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:17,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:17,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:17,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694528014] [2025-03-04 10:13:17,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:17,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:17,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:17,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:17,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:13:17,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-04 10:13:17,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 200 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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) [2025-03-04 10:13:17,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:17,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-04 10:13:17,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:18,397 INFO L124 PetriNetUnfolderBase]: 7273/10257 cut-off events. [2025-03-04 10:13:18,397 INFO L125 PetriNetUnfolderBase]: For 1445/1445 co-relation queries the response was YES. [2025-03-04 10:13:18,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22456 conditions, 10257 events. 7273/10257 cut-off events. For 1445/1445 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 59027 event pairs, 5890 based on Foata normal form. 0/9244 useless extension candidates. Maximal degree in co-relation 11318. Up to 9846 conditions per place. [2025-03-04 10:13:18,464 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 46 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-03-04 10:13:18,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 59 transitions, 292 flow [2025-03-04 10:13:18,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-03-04 10:13:18,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-03-04 10:13:18,465 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 200 flow. Second operand 4 states and 104 transitions. [2025-03-04 10:13:18,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 59 transitions, 292 flow [2025-03-04 10:13:18,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:18,468 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 196 flow [2025-03-04 10:13:18,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2025-03-04 10:13:18,469 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-03-04 10:13:18,469 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 196 flow [2025-03-04 10:13:18,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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) [2025-03-04 10:13:18,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:18,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:18,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:13:18,469 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:18,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash 3525217, now seen corresponding path program 1 times [2025-03-04 10:13:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:18,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497768752] [2025-03-04 10:13:18,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:18,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:18,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:13:18,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:13:18,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:18,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:18,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:18,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497768752] [2025-03-04 10:13:18,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497768752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:18,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256217792] [2025-03-04 10:13:18,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:18,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:18,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:18,626 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:18,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:13:18,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:13:18,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:13:18,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:18,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:18,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:13:18,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:18,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:13:18,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256217792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:18,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:13:18,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 10:13:18,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408916078] [2025-03-04 10:13:18,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:18,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:18,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:18,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:18,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:13:18,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-03-04 10:13:18,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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) [2025-03-04 10:13:18,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:18,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-03-04 10:13:18,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:19,261 INFO L124 PetriNetUnfolderBase]: 5447/7795 cut-off events. [2025-03-04 10:13:19,261 INFO L125 PetriNetUnfolderBase]: For 1154/1154 co-relation queries the response was YES. [2025-03-04 10:13:19,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16623 conditions, 7795 events. 5447/7795 cut-off events. For 1154/1154 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 44185 event pairs, 4350 based on Foata normal form. 0/7479 useless extension candidates. Maximal degree in co-relation 11183. Up to 7419 conditions per place. [2025-03-04 10:13:19,296 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 42 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2025-03-04 10:13:19,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 284 flow [2025-03-04 10:13:19,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-04 10:13:19,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4296875 [2025-03-04 10:13:19,298 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 196 flow. Second operand 4 states and 110 transitions. [2025-03-04 10:13:19,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 284 flow [2025-03-04 10:13:19,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:19,300 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 195 flow [2025-03-04 10:13:19,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-03-04 10:13:19,301 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-03-04 10:13:19,301 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 195 flow [2025-03-04 10:13:19,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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) [2025-03-04 10:13:19,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:19,302 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] [2025-03-04 10:13:19,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:19,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:19,507 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:19,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:19,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1443936286, now seen corresponding path program 1 times [2025-03-04 10:13:19,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:19,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498783309] [2025-03-04 10:13:19,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:19,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:19,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:13:19,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:13:19,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:19,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:19,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:19,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498783309] [2025-03-04 10:13:19,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498783309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:19,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:19,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:19,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684906192] [2025-03-04 10:13:19,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:19,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:13:19,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:19,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:13:19,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:13:19,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-03-04 10:13:19,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 195 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) [2025-03-04 10:13:19,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:19,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-03-04 10:13:19,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:20,005 INFO L124 PetriNetUnfolderBase]: 7724/11151 cut-off events. [2025-03-04 10:13:20,005 INFO L125 PetriNetUnfolderBase]: For 1919/1919 co-relation queries the response was YES. [2025-03-04 10:13:20,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23789 conditions, 11151 events. 7724/11151 cut-off events. For 1919/1919 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 65506 event pairs, 3089 based on Foata normal form. 4/10887 useless extension candidates. Maximal degree in co-relation 16807. Up to 5496 conditions per place. [2025-03-04 10:13:20,048 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 65 selfloop transitions, 3 changer transitions 1/78 dead transitions. [2025-03-04 10:13:20,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 388 flow [2025-03-04 10:13:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:13:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:13:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-03-04 10:13:20,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 10:13:20,049 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 195 flow. Second operand 3 states and 112 transitions. [2025-03-04 10:13:20,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 388 flow [2025-03-04 10:13:20,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:20,051 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 209 flow [2025-03-04 10:13:20,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2025-03-04 10:13:20,052 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-03-04 10:13:20,052 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 209 flow [2025-03-04 10:13:20,052 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) [2025-03-04 10:13:20,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:20,052 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] [2025-03-04 10:13:20,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:13:20,052 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:20,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash 623933665, now seen corresponding path program 1 times [2025-03-04 10:13:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:20,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318199873] [2025-03-04 10:13:20,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:20,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:13:20,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:13:20,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:20,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:20,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:20,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318199873] [2025-03-04 10:13:20,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318199873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:20,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:20,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:20,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246577983] [2025-03-04 10:13:20,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:20,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:13:20,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:20,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:13:20,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:13:20,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-03-04 10:13:20,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2025-03-04 10:13:20,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:20,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-03-04 10:13:20,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:20,675 INFO L124 PetriNetUnfolderBase]: 8953/13036 cut-off events. [2025-03-04 10:13:20,675 INFO L125 PetriNetUnfolderBase]: For 4875/4875 co-relation queries the response was YES. [2025-03-04 10:13:20,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29237 conditions, 13036 events. 8953/13036 cut-off events. For 4875/4875 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 79067 event pairs, 4404 based on Foata normal form. 261/13085 useless extension candidates. Maximal degree in co-relation 21995. Up to 6296 conditions per place. [2025-03-04 10:13:20,746 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 73 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2025-03-04 10:13:20,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 431 flow [2025-03-04 10:13:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:13:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:13:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-03-04 10:13:20,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-03-04 10:13:20,748 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 209 flow. Second operand 3 states and 115 transitions. [2025-03-04 10:13:20,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 431 flow [2025-03-04 10:13:20,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 84 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:20,751 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 222 flow [2025-03-04 10:13:20,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2025-03-04 10:13:20,752 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2025-03-04 10:13:20,752 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 222 flow [2025-03-04 10:13:20,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2025-03-04 10:13:20,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:20,752 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] [2025-03-04 10:13:20,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:13:20,752 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:20,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1036480421, now seen corresponding path program 1 times [2025-03-04 10:13:20,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:20,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712650415] [2025-03-04 10:13:20,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:20,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:20,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:13:20,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:13:20,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:20,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:20,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:20,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712650415] [2025-03-04 10:13:20,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712650415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:20,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:20,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:20,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904492435] [2025-03-04 10:13:20,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:20,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:13:20,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:20,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:13:20,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:13:20,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-03-04 10:13:20,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2025-03-04 10:13:20,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:20,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-03-04 10:13:20,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:21,535 INFO L124 PetriNetUnfolderBase]: 10319/15161 cut-off events. [2025-03-04 10:13:21,536 INFO L125 PetriNetUnfolderBase]: For 8478/8478 co-relation queries the response was YES. [2025-03-04 10:13:21,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34943 conditions, 15161 events. 10319/15161 cut-off events. For 8478/8478 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 92765 event pairs, 5083 based on Foata normal form. 193/15179 useless extension candidates. Maximal degree in co-relation 27000. Up to 7410 conditions per place. [2025-03-04 10:13:21,579 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 73 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2025-03-04 10:13:21,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 451 flow [2025-03-04 10:13:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:13:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:13:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-03-04 10:13:21,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5885416666666666 [2025-03-04 10:13:21,580 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 222 flow. Second operand 3 states and 113 transitions. [2025-03-04 10:13:21,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 451 flow [2025-03-04 10:13:21,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 84 transitions, 436 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:21,583 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 230 flow [2025-03-04 10:13:21,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2025-03-04 10:13:21,583 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2025-03-04 10:13:21,583 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 230 flow [2025-03-04 10:13:21,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2025-03-04 10:13:21,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:21,583 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] [2025-03-04 10:13:21,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:13:21,583 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:21,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1116394045, now seen corresponding path program 1 times [2025-03-04 10:13:21,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:21,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307511404] [2025-03-04 10:13:21,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:21,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:21,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 10:13:21,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:13:21,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:21,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:21,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307511404] [2025-03-04 10:13:21,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307511404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:21,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:21,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:13:21,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814288346] [2025-03-04 10:13:21,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:21,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:13:21,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:21,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:13:21,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:13:21,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2025-03-04 10:13:21,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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) [2025-03-04 10:13:21,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:21,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2025-03-04 10:13:21,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:22,828 INFO L124 PetriNetUnfolderBase]: 14723/21473 cut-off events. [2025-03-04 10:13:22,828 INFO L125 PetriNetUnfolderBase]: For 10143/10143 co-relation queries the response was YES. [2025-03-04 10:13:22,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50340 conditions, 21473 events. 14723/21473 cut-off events. For 10143/10143 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 136759 event pairs, 1023 based on Foata normal form. 540/20795 useless extension candidates. Maximal degree in co-relation 39085. Up to 8994 conditions per place. [2025-03-04 10:13:22,960 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 140 selfloop transitions, 17 changer transitions 3/168 dead transitions. [2025-03-04 10:13:22,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 168 transitions, 859 flow [2025-03-04 10:13:22,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:13:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:13:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 277 transitions. [2025-03-04 10:13:22,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.541015625 [2025-03-04 10:13:22,962 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 230 flow. Second operand 8 states and 277 transitions. [2025-03-04 10:13:22,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 168 transitions, 859 flow [2025-03-04 10:13:22,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 168 transitions, 846 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:22,973 INFO L231 Difference]: Finished difference. Result has 81 places, 76 transitions, 363 flow [2025-03-04 10:13:22,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=363, PETRI_PLACES=81, PETRI_TRANSITIONS=76} [2025-03-04 10:13:22,974 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2025-03-04 10:13:22,974 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 76 transitions, 363 flow [2025-03-04 10:13:22,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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) [2025-03-04 10:13:22,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:22,974 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] [2025-03-04 10:13:22,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:13:22,974 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:22,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash -596923829, now seen corresponding path program 2 times [2025-03-04 10:13:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:22,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825581686] [2025-03-04 10:13:22,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:22,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:22,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 10:13:22,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:13:22,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:22,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:23,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:23,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825581686] [2025-03-04 10:13:23,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825581686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:23,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:23,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:13:23,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236501221] [2025-03-04 10:13:23,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:23,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:13:23,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:23,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:13:23,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:13:23,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-04 10:13:23,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 363 flow. Second operand has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 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) [2025-03-04 10:13:23,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:23,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-04 10:13:23,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:26,566 INFO L124 PetriNetUnfolderBase]: 38558/54336 cut-off events. [2025-03-04 10:13:26,566 INFO L125 PetriNetUnfolderBase]: For 53190/53194 co-relation queries the response was YES. [2025-03-04 10:13:26,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149072 conditions, 54336 events. 38558/54336 cut-off events. For 53190/53194 co-relation queries the response was YES. Maximal size of possible extension queue 1749. Compared 362074 event pairs, 4003 based on Foata normal form. 0/51121 useless extension candidates. Maximal degree in co-relation 119874. Up to 14278 conditions per place. [2025-03-04 10:13:26,943 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 251 selfloop transitions, 71 changer transitions 0/330 dead transitions. [2025-03-04 10:13:26,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 330 transitions, 2104 flow [2025-03-04 10:13:26,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:13:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:13:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 488 transitions. [2025-03-04 10:13:26,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2025-03-04 10:13:26,945 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 363 flow. Second operand 15 states and 488 transitions. [2025-03-04 10:13:26,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 330 transitions, 2104 flow [2025-03-04 10:13:27,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 330 transitions, 2075 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:27,640 INFO L231 Difference]: Finished difference. Result has 106 places, 140 transitions, 1131 flow [2025-03-04 10:13:27,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1131, PETRI_PLACES=106, PETRI_TRANSITIONS=140} [2025-03-04 10:13:27,641 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 40 predicate places. [2025-03-04 10:13:27,641 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 140 transitions, 1131 flow [2025-03-04 10:13:27,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 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) [2025-03-04 10:13:27,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:27,641 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] [2025-03-04 10:13:27,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:13:27,641 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:27,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:27,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2097134643, now seen corresponding path program 3 times [2025-03-04 10:13:27,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:27,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361149003] [2025-03-04 10:13:27,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:13:27,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:27,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-03-04 10:13:27,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 37 statements. [2025-03-04 10:13:27,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:13:27,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:28,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:28,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361149003] [2025-03-04 10:13:28,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361149003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:28,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:28,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:13:28,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2794119] [2025-03-04 10:13:28,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:28,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:13:28,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:28,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:13:28,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:13:28,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2025-03-04 10:13:28,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 140 transitions, 1131 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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) [2025-03-04 10:13:28,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:28,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2025-03-04 10:13:28,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:33,780 INFO L124 PetriNetUnfolderBase]: 40754/60856 cut-off events. [2025-03-04 10:13:33,780 INFO L125 PetriNetUnfolderBase]: For 192974/193061 co-relation queries the response was YES. [2025-03-04 10:13:34,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232357 conditions, 60856 events. 40754/60856 cut-off events. For 192974/193061 co-relation queries the response was YES. Maximal size of possible extension queue 2194. Compared 452149 event pairs, 6761 based on Foata normal form. 1528/62204 useless extension candidates. Maximal degree in co-relation 219127. Up to 31429 conditions per place. [2025-03-04 10:13:34,297 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 278 selfloop transitions, 140 changer transitions 13/441 dead transitions. [2025-03-04 10:13:34,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 441 transitions, 4348 flow [2025-03-04 10:13:34,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:13:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:13:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 376 transitions. [2025-03-04 10:13:34,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2025-03-04 10:13:34,299 INFO L175 Difference]: Start difference. First operand has 106 places, 140 transitions, 1131 flow. Second operand 11 states and 376 transitions. [2025-03-04 10:13:34,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 441 transitions, 4348 flow [2025-03-04 10:13:36,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 441 transitions, 4348 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:13:36,321 INFO L231 Difference]: Finished difference. Result has 125 places, 268 transitions, 3105 flow [2025-03-04 10:13:36,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3105, PETRI_PLACES=125, PETRI_TRANSITIONS=268} [2025-03-04 10:13:36,322 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 59 predicate places. [2025-03-04 10:13:36,324 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 268 transitions, 3105 flow [2025-03-04 10:13:36,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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) [2025-03-04 10:13:36,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:36,324 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] [2025-03-04 10:13:36,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:13:36,325 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:36,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:36,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2011086709, now seen corresponding path program 4 times [2025-03-04 10:13:36,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:36,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330449031] [2025-03-04 10:13:36,325 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:13:36,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:36,331 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-04 10:13:36,338 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:13:36,339 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:13:36,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:13:36,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:36,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330449031] [2025-03-04 10:13:36,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330449031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:36,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:36,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:13:36,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577926464] [2025-03-04 10:13:36,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:36,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:13:36,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:36,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:13:36,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:13:36,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2025-03-04 10:13:36,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 268 transitions, 3105 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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) [2025-03-04 10:13:36,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:36,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2025-03-04 10:13:36,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:43,334 INFO L124 PetriNetUnfolderBase]: 44367/66576 cut-off events. [2025-03-04 10:13:43,334 INFO L125 PetriNetUnfolderBase]: For 399858/399908 co-relation queries the response was YES. [2025-03-04 10:13:43,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317621 conditions, 66576 events. 44367/66576 cut-off events. For 399858/399908 co-relation queries the response was YES. Maximal size of possible extension queue 2591. Compared 506932 event pairs, 9545 based on Foata normal form. 288/66580 useless extension candidates. Maximal degree in co-relation 294936. Up to 41571 conditions per place. [2025-03-04 10:13:44,236 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 261 selfloop transitions, 218 changer transitions 55/544 dead transitions. [2025-03-04 10:13:44,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 544 transitions, 7281 flow [2025-03-04 10:13:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:13:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:13:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 294 transitions. [2025-03-04 10:13:44,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2025-03-04 10:13:44,238 INFO L175 Difference]: Start difference. First operand has 125 places, 268 transitions, 3105 flow. Second operand 9 states and 294 transitions. [2025-03-04 10:13:44,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 544 transitions, 7281 flow [2025-03-04 10:13:49,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 544 transitions, 7227 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-03-04 10:13:49,366 INFO L231 Difference]: Finished difference. Result has 139 places, 402 transitions, 5727 flow [2025-03-04 10:13:49,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=3065, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5727, PETRI_PLACES=139, PETRI_TRANSITIONS=402} [2025-03-04 10:13:49,366 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 73 predicate places. [2025-03-04 10:13:49,366 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 402 transitions, 5727 flow [2025-03-04 10:13:49,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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) [2025-03-04 10:13:49,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:49,366 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] [2025-03-04 10:13:49,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:13:49,366 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 10:13:49,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2058253197, now seen corresponding path program 5 times [2025-03-04 10:13:49,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:49,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911495975] [2025-03-04 10:13:49,367 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:13:49,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:49,373 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 3 equivalence classes. [2025-03-04 10:13:49,380 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:13:49,380 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:13:49,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:49,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:49,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911495975] [2025-03-04 10:13:49,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911495975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:49,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:49,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:13:49,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509413944] [2025-03-04 10:13:49,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:49,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:13:49,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:49,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:13:49,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:13:49,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2025-03-04 10:13:49,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 402 transitions, 5727 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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) [2025-03-04 10:13:49,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:49,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2025-03-04 10:13:49,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:00,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([767] L71-->L77: Formula: (let ((.cse0 (* v_~q2_back~0_88 4))) (let ((.cse1 (+ v_~q2~0.offset_55 .cse0))) (and (= (select |v_#valid_168| v_~q2~0.base_61) 1) (<= (+ v_~q2~0.offset_55 .cse0 4) (select |v_#length_133| v_~q2~0.base_61)) (= v_~q2_back~0_87 (+ v_~q2_back~0_88 1)) (<= 0 .cse1) (= v_~j~0_66 (+ v_~j~0_67 1)) (not (= (ite (and (< v_~q2_back~0_88 v_~n2~0_90) (<= 0 v_~q2_back~0_88)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_65| v_~q2~0.base_61) .cse1) v_~C~0_84) 0) 1 0) 0))))) InVars {~j~0=v_~j~0_67, ~n2~0=v_~n2~0_90, ~C~0=v_~C~0_84, ~q2~0.offset=v_~q2~0.offset_55, #valid=|v_#valid_168|, ~q2~0.base=v_~q2~0.base_61, #length=|v_#length_133|, #memory_int#1=|v_#memory_int#1_65|, ~q2_back~0=v_~q2_back~0_88} OutVars{~j~0=v_~j~0_66, ~n2~0=v_~n2~0_90, ~C~0=v_~C~0_84, ~q2~0.offset=v_~q2~0.offset_55, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, #memory_int#1=|v_#memory_int#1_65|, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_1|, #valid=|v_#valid_168|, ~q2~0.base=v_~q2~0.base_61, #length=|v_#length_133|, thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~q2_back~0=v_~q2_back~0_87} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post6#1, ~q2_back~0][114], [139#(<= ~n2~0 2147483647), Black: 260#(= ~total~0 0), Black: 264#(<= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(<= ~q2_back~0 ~q2_front~0), 354#true, Black: 281#(and (<= (+ ~j~0 1) ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 277#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 274#(< ~j~0 ~N~0), Black: 275#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 272#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), Black: 279#(and (<= (+ ~j~0 1) ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 52#L90true, 206#(= (select |#valid| ~q2~0.base) 1), Black: 310#(and (or (and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 308#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= ~j~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 298#(and (<= ~j~0 ~i~0) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 314#(and (or (and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0)) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 291#(and (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0)) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 302#(and (<= ~j~0 ~i~0) (or (and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 304#(and (<= ~j~0 ~i~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 312#(and (<= ~j~0 ~i~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (<= (+ ~q1_front~0 2) ~q1_back~0) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 300#(and (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (<= ~j~0 ~i~0) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 288#true, Black: 296#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 195#(<= ~n1~0 0), Black: 306#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= ~j~0 ~i~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 293#(or (and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))), 376#true, Black: 210#(<= ~n2~0 0), Black: 329#(or (and (<= ~q1_back~0 ~q1_front~0) (<= ~j~0 ~i~0)) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 336#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< 0 |thread4Thread1of1ForFork3_~cond~3#1|) (< |thread3Thread1of1ForFork1_~cond~2#1| 1)) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 338#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 334#(and (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 332#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 327#true, Black: 344#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), 270#true, Black: 340#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 331#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< 0 |thread4Thread1of1ForFork3_~cond~3#1|) (< |thread3Thread1of1ForFork1_~cond~2#1| 1))), Black: 342#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< 0 |thread4Thread1of1ForFork3_~cond~3#1|) (< |thread3Thread1of1ForFork1_~cond~2#1| 1)) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), 37#L143true, 34#L77true, 17#L107true, Black: 369#(and (<= ~q1_back~0 ~q1_front~0) (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 365#(and (<= ~q1_back~0 ~q1_front~0) (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 356#(and (<= ~q1_back~0 ~q1_front~0) (<= ~j~0 ~i~0)), 200#(= (select |#valid| ~q1~0.base) 1), Black: 367#(and (<= ~q1_back~0 ~q1_front~0) (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= ~N~0 ~i~0)), Black: 357#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (<= ~q1_back~0 ~q1_front~0) (<= ~N~0 ~i~0)) (< 0 |thread4Thread1of1ForFork3_~cond~3#1|))), Black: 363#(and (<= ~q1_back~0 ~q1_front~0) (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base)))]) [2025-03-04 10:14:00,842 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-03-04 10:14:00,842 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:14:00,843 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-03-04 10:14:00,843 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:14:00,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([767] L71-->L77: Formula: (let ((.cse0 (* v_~q2_back~0_88 4))) (let ((.cse1 (+ v_~q2~0.offset_55 .cse0))) (and (= (select |v_#valid_168| v_~q2~0.base_61) 1) (<= (+ v_~q2~0.offset_55 .cse0 4) (select |v_#length_133| v_~q2~0.base_61)) (= v_~q2_back~0_87 (+ v_~q2_back~0_88 1)) (<= 0 .cse1) (= v_~j~0_66 (+ v_~j~0_67 1)) (not (= (ite (and (< v_~q2_back~0_88 v_~n2~0_90) (<= 0 v_~q2_back~0_88)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_65| v_~q2~0.base_61) .cse1) v_~C~0_84) 0) 1 0) 0))))) InVars {~j~0=v_~j~0_67, ~n2~0=v_~n2~0_90, ~C~0=v_~C~0_84, ~q2~0.offset=v_~q2~0.offset_55, #valid=|v_#valid_168|, ~q2~0.base=v_~q2~0.base_61, #length=|v_#length_133|, #memory_int#1=|v_#memory_int#1_65|, ~q2_back~0=v_~q2_back~0_88} OutVars{~j~0=v_~j~0_66, ~n2~0=v_~n2~0_90, ~C~0=v_~C~0_84, ~q2~0.offset=v_~q2~0.offset_55, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, #memory_int#1=|v_#memory_int#1_65|, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_1|, #valid=|v_#valid_168|, ~q2~0.base=v_~q2~0.base_61, #length=|v_#length_133|, thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~q2_back~0=v_~q2_back~0_87} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post6#1, ~q2_back~0][114], [139#(<= ~n2~0 2147483647), Black: 260#(= ~total~0 0), Black: 264#(<= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(<= ~q2_back~0 ~q2_front~0), 354#true, Black: 281#(and (<= (+ ~j~0 1) ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 277#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 274#(< ~j~0 ~N~0), Black: 275#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 272#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), Black: 279#(and (<= (+ ~j~0 1) ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 52#L90true, 4#thread4EXITtrue, 206#(= (select |#valid| ~q2~0.base) 1), Black: 310#(and (or (and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 308#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= ~j~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 298#(and (<= ~j~0 ~i~0) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 314#(and (or (and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0)) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 291#(and (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0)) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 302#(and (<= ~j~0 ~i~0) (or (and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 304#(and (<= ~j~0 ~i~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 312#(and (<= ~j~0 ~i~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (<= (+ ~q1_front~0 2) ~q1_back~0) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 300#(and (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (<= ~j~0 ~i~0) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 296#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 195#(<= ~n1~0 0), 288#true, Black: 306#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= ~j~0 ~i~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 376#true, Black: 293#(or (and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))), Black: 210#(<= ~n2~0 0), Black: 329#(or (and (<= ~q1_back~0 ~q1_front~0) (<= ~j~0 ~i~0)) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 336#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< 0 |thread4Thread1of1ForFork3_~cond~3#1|) (< |thread3Thread1of1ForFork1_~cond~2#1| 1)) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 338#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 334#(and (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 332#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 327#true, 270#true, Black: 344#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 340#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 331#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< 0 |thread4Thread1of1ForFork3_~cond~3#1|) (< |thread3Thread1of1ForFork1_~cond~2#1| 1))), Black: 342#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< 0 |thread4Thread1of1ForFork3_~cond~3#1|) (< |thread3Thread1of1ForFork1_~cond~2#1| 1)) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), 37#L143true, 34#L77true, Black: 369#(and (<= ~q1_back~0 ~q1_front~0) (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 365#(and (<= ~q1_back~0 ~q1_front~0) (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 356#(and (<= ~q1_back~0 ~q1_front~0) (<= ~j~0 ~i~0)), 200#(= (select |#valid| ~q1~0.base) 1), Black: 367#(and (<= ~q1_back~0 ~q1_front~0) (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= ~N~0 ~i~0)), Black: 357#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (<= ~q1_back~0 ~q1_front~0) (<= ~N~0 ~i~0)) (< 0 |thread4Thread1of1ForFork3_~cond~3#1|))), Black: 363#(and (<= ~q1_back~0 ~q1_front~0) (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base)))]) [2025-03-04 10:14:00,893 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-04 10:14:00,894 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-03-04 10:14:00,894 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:14:00,894 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:14:00,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([767] L71-->L77: Formula: (let ((.cse0 (* v_~q2_back~0_88 4))) (let ((.cse1 (+ v_~q2~0.offset_55 .cse0))) (and (= (select |v_#valid_168| v_~q2~0.base_61) 1) (<= (+ v_~q2~0.offset_55 .cse0 4) (select |v_#length_133| v_~q2~0.base_61)) (= v_~q2_back~0_87 (+ v_~q2_back~0_88 1)) (<= 0 .cse1) (= v_~j~0_66 (+ v_~j~0_67 1)) (not (= (ite (and (< v_~q2_back~0_88 v_~n2~0_90) (<= 0 v_~q2_back~0_88)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_65| v_~q2~0.base_61) .cse1) v_~C~0_84) 0) 1 0) 0))))) InVars {~j~0=v_~j~0_67, ~n2~0=v_~n2~0_90, ~C~0=v_~C~0_84, ~q2~0.offset=v_~q2~0.offset_55, #valid=|v_#valid_168|, ~q2~0.base=v_~q2~0.base_61, #length=|v_#length_133|, #memory_int#1=|v_#memory_int#1_65|, ~q2_back~0=v_~q2_back~0_88} OutVars{~j~0=v_~j~0_66, ~n2~0=v_~n2~0_90, ~C~0=v_~C~0_84, ~q2~0.offset=v_~q2~0.offset_55, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, #memory_int#1=|v_#memory_int#1_65|, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_1|, #valid=|v_#valid_168|, ~q2~0.base=v_~q2~0.base_61, #length=|v_#length_133|, thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~q2_back~0=v_~q2_back~0_87} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post6#1, ~q2_back~0][114], [139#(<= ~n2~0 2147483647), Black: 260#(= ~total~0 0), Black: 264#(<= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(<= ~q2_back~0 ~q2_front~0), 354#true, Black: 281#(and (<= (+ ~j~0 1) ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 277#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 274#(< ~j~0 ~N~0), Black: 275#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 272#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)), Black: 279#(and (<= (+ ~j~0 1) ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 52#L90true, 28#L113true, 206#(= (select |#valid| ~q2~0.base) 1), Black: 310#(and (or (and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 308#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= ~j~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 298#(and (<= ~j~0 ~i~0) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 314#(and (or (and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0)) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 291#(and (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0)) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 302#(and (<= ~j~0 ~i~0) (or (and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 304#(and (<= ~j~0 ~i~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 312#(and (<= ~j~0 ~i~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (<= (+ ~q1_front~0 2) ~q1_back~0) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 300#(and (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (<= ~j~0 ~i~0) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 296#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 195#(<= ~n1~0 0), 288#true, Black: 306#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= ~j~0 ~i~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 293#(or (and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))), 376#true, Black: 210#(<= ~n2~0 0), Black: 329#(or (and (<= ~q1_back~0 ~q1_front~0) (<= ~j~0 ~i~0)) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 336#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< 0 |thread4Thread1of1ForFork3_~cond~3#1|) (< |thread3Thread1of1ForFork1_~cond~2#1| 1)) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 338#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 334#(and (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 332#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 327#true, 270#true, Black: 344#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), Black: 340#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 331#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< 0 |thread4Thread1of1ForFork3_~cond~3#1|) (< |thread3Thread1of1ForFork1_~cond~2#1| 1))), Black: 342#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0))) (or (< 0 |thread4Thread1of1ForFork3_~cond~3#1|) (< |thread3Thread1of1ForFork1_~cond~2#1| 1)) (or (< |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0))), 37#L143true, 34#L77true, Black: 369#(and (<= ~q1_back~0 ~q1_front~0) (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 365#(and (<= ~q1_back~0 ~q1_front~0) (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 356#(and (<= ~q1_back~0 ~q1_front~0) (<= ~j~0 ~i~0)), 200#(= (select |#valid| ~q1~0.base) 1), Black: 367#(and (<= ~q1_back~0 ~q1_front~0) (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= ~N~0 ~i~0)), Black: 357#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (and (<= ~q1_back~0 ~q1_front~0) (<= ~N~0 ~i~0)) (< 0 |thread4Thread1of1ForFork3_~cond~3#1|))), Black: 363#(and (<= ~q1_back~0 ~q1_front~0) (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base)))]) [2025-03-04 10:14:00,923 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-04 10:14:00,923 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 10:14:00,923 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:14:00,923 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:14:00,949 INFO L124 PetriNetUnfolderBase]: 64103/96640 cut-off events. [2025-03-04 10:14:00,950 INFO L125 PetriNetUnfolderBase]: For 698736/703498 co-relation queries the response was YES. [2025-03-04 10:14:02,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489090 conditions, 96640 events. 64103/96640 cut-off events. For 698736/703498 co-relation queries the response was YES. Maximal size of possible extension queue 3994. Compared 779615 event pairs, 12136 based on Foata normal form. 1752/96229 useless extension candidates. Maximal degree in co-relation 448223. Up to 57383 conditions per place. [2025-03-04 10:14:02,381 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 330 selfloop transitions, 465 changer transitions 13/824 dead transitions. [2025-03-04 10:14:02,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 824 transitions, 13140 flow [2025-03-04 10:14:02,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:14:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:14:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 304 transitions. [2025-03-04 10:14:02,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-03-04 10:14:02,382 INFO L175 Difference]: Start difference. First operand has 139 places, 402 transitions, 5727 flow. Second operand 9 states and 304 transitions. [2025-03-04 10:14:02,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 824 transitions, 13140 flow