./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-lamport.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/parallel-lamport.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 7641d1105b9de7b20c96680ae1baa82cbf27158c037dacb66ff49f347bd2fa94 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:09:05,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:09:05,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:09:05,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:09:05,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:09:05,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:09:05,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:09:05,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:09:05,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:09:05,284 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:09:05,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:09:05,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:09:05,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:09:05,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:09:05,285 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:09:05,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:09:05,286 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:09:05,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:09:05,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:09:05,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:09:05,286 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:09:05,286 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:09:05,286 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:09:05,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:09:05,286 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:09:05,286 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:09:05,286 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:09:05,286 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:09:05,286 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:09:05,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:09:05,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:09:05,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:09:05,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:09:05,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:09:05,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:09:05,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:09:05,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:09:05,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:09:05,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:09:05,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:09:05,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:09:05,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:09:05,287 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 -> 7641d1105b9de7b20c96680ae1baa82cbf27158c037dacb66ff49f347bd2fa94 [2025-03-04 10:09:05,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:09:05,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:09:05,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:09:05,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:09:05,508 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:09:05,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2025-03-04 10:09:06,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10999a218/2f0038b52984403aa97f80679ed5a967/FLAG494e0a92e [2025-03-04 10:09:06,912 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:09:06,913 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2025-03-04 10:09:06,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10999a218/2f0038b52984403aa97f80679ed5a967/FLAG494e0a92e [2025-03-04 10:09:07,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10999a218/2f0038b52984403aa97f80679ed5a967 [2025-03-04 10:09:07,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:09:07,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:09:07,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:09:07,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:09:07,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:09:07,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:09:07" (1/1) ... [2025-03-04 10:09:07,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374b78d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:07, skipping insertion in model container [2025-03-04 10:09:07,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:09:07" (1/1) ... [2025-03-04 10:09:07,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:09:07,397 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:09:07,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:09:07,413 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:09:07,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:09:07,452 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:09:07,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:07 WrapperNode [2025-03-04 10:09:07,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:09:07,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:09:07,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:09:07,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:09:07,459 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:09:07" (1/1) ... [2025-03-04 10:09:07,464 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:09:07" (1/1) ... [2025-03-04 10:09:07,486 INFO L138 Inliner]: procedures = 22, calls = 30, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 206 [2025-03-04 10:09:07,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:09:07,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:09:07,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:09:07,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:09:07,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:07" (1/1) ... [2025-03-04 10:09:07,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:07" (1/1) ... [2025-03-04 10:09:07,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:07" (1/1) ... [2025-03-04 10:09:07,519 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 10:09:07,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:07" (1/1) ... [2025-03-04 10:09:07,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:07" (1/1) ... [2025-03-04 10:09:07,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:07" (1/1) ... [2025-03-04 10:09:07,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:07" (1/1) ... [2025-03-04 10:09:07,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:07" (1/1) ... [2025-03-04 10:09:07,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:07" (1/1) ... [2025-03-04 10:09:07,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:09:07,539 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:09:07,542 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:09:07,542 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:09:07,543 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:07" (1/1) ... [2025-03-04 10:09:07,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:09:07,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:07,571 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:09:07,573 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:09:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:09:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:09:07,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:09:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:09:07,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:09:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:09:07,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:09:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:09:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:09:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:09:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:09:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:09:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:09:07,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:09:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:09:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:09:07,595 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:09:07,677 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:09:07,678 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:09:07,969 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:09:07,970 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:09:08,125 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:09:08,125 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:09:08,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:09:08 BoogieIcfgContainer [2025-03-04 10:09:08,126 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:09:08,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:09:08,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:09:08,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:09:08,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:09:07" (1/3) ... [2025-03-04 10:09:08,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4e055d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:09:08, skipping insertion in model container [2025-03-04 10:09:08,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:07" (2/3) ... [2025-03-04 10:09:08,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4e055d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:09:08, skipping insertion in model container [2025-03-04 10:09:08,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:09:08" (3/3) ... [2025-03-04 10:09:08,135 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2025-03-04 10:09:08,149 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:09:08,150 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-lamport.wvr.c that has 4 procedures, 75 locations, 1 initial locations, 1 loop locations, and 12 error locations. [2025-03-04 10:09:08,150 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:09:08,224 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:09:08,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 75 transitions, 171 flow [2025-03-04 10:09:08,287 INFO L124 PetriNetUnfolderBase]: 1/72 cut-off events. [2025-03-04 10:09:08,288 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:09:08,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 72 events. 1/72 cut-off events. For 3/3 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/59 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-03-04 10:09:08,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 75 transitions, 171 flow [2025-03-04 10:09:08,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 71 transitions, 160 flow [2025-03-04 10:09:08,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:09:08,315 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;@e9818e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:09:08,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 10:09:08,321 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:09:08,322 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2025-03-04 10:09:08,322 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:09:08,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:08,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:08,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:08,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1046519274, now seen corresponding path program 1 times [2025-03-04 10:09:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:08,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750020463] [2025-03-04 10:09:08,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:08,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:08,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:09:08,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:09:08,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:08,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:08,568 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:09:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:08,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750020463] [2025-03-04 10:09:08,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750020463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:08,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:08,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:09:08,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130514468] [2025-03-04 10:09:08,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:08,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:09:08,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:08,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:09:08,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:09:08,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-03-04 10:09:08,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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:09:08,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:08,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-03-04 10:09:08,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:09,143 INFO L124 PetriNetUnfolderBase]: 2569/4391 cut-off events. [2025-03-04 10:09:09,144 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2025-03-04 10:09:09,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8538 conditions, 4391 events. 2569/4391 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 26997 event pairs, 2568 based on Foata normal form. 1/4005 useless extension candidates. Maximal degree in co-relation 8141. Up to 3862 conditions per place. [2025-03-04 10:09:09,178 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 49 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-04 10:09:09,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 68 transitions, 256 flow [2025-03-04 10:09:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:09:09,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:09:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-04 10:09:09,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5155555555555555 [2025-03-04 10:09:09,191 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 160 flow. Second operand 3 states and 116 transitions. [2025-03-04 10:09:09,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 68 transitions, 256 flow [2025-03-04 10:09:09,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 68 transitions, 244 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:09:09,202 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 146 flow [2025-03-04 10:09:09,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2025-03-04 10:09:09,208 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -7 predicate places. [2025-03-04 10:09:09,208 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 146 flow [2025-03-04 10:09:09,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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:09:09,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:09,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:09,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:09:09,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:09,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1046519275, now seen corresponding path program 1 times [2025-03-04 10:09:09,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:09,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38543595] [2025-03-04 10:09:09,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:09,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:09:09,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:09:09,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:09,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:09,522 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:09:09,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:09,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38543595] [2025-03-04 10:09:09,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38543595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:09,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:09,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:09:09,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008179417] [2025-03-04 10:09:09,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:09,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:09:09,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:09,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:09:09,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:09:09,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-03-04 10:09:09,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:09,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:09,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-03-04 10:09:09,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:10,030 INFO L124 PetriNetUnfolderBase]: 2570/4394 cut-off events. [2025-03-04 10:09:10,030 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 10:09:10,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8379 conditions, 4394 events. 2570/4394 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 27034 event pairs, 2568 based on Foata normal form. 0/4007 useless extension candidates. Maximal degree in co-relation 8337. Up to 3864 conditions per place. [2025-03-04 10:09:10,056 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 49 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2025-03-04 10:09:10,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 71 transitions, 264 flow [2025-03-04 10:09:10,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:09:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:09:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2025-03-04 10:09:10,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40444444444444444 [2025-03-04 10:09:10,061 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 146 flow. Second operand 6 states and 182 transitions. [2025-03-04 10:09:10,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 71 transitions, 264 flow [2025-03-04 10:09:10,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 71 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:10,064 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 173 flow [2025-03-04 10:09:10,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-03-04 10:09:10,065 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -2 predicate places. [2025-03-04 10:09:10,066 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 173 flow [2025-03-04 10:09:10,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:10,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:10,066 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:10,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:09:10,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:10,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:10,068 INFO L85 PathProgramCache]: Analyzing trace with hash 682694693, now seen corresponding path program 1 times [2025-03-04 10:09:10,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:10,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909705584] [2025-03-04 10:09:10,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:10,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:10,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:09:10,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:10,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:10,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:10,357 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:09:10,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:10,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909705584] [2025-03-04 10:09:10,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909705584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:10,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640601586] [2025-03-04 10:09:10,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:10,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:10,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:10,361 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:09:10,363 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:09:10,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:09:10,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:10,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:10,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:10,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:09:10,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:10,467 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:09:10,642 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:09:10,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:10,866 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:09:10,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640601586] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:10,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:10,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 10:09:10,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574942469] [2025-03-04 10:09:10,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:10,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:09:10,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:10,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:09:10,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:09:11,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-03-04 10:09:11,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 173 flow. Second operand has 15 states, 15 states have (on average 22.8) internal successors, (342), 15 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:11,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:11,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-03-04 10:09:11,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:11,725 INFO L124 PetriNetUnfolderBase]: 2570/4393 cut-off events. [2025-03-04 10:09:11,725 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 10:09:11,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8388 conditions, 4393 events. 2570/4393 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 26998 event pairs, 2568 based on Foata normal form. 0/4006 useless extension candidates. Maximal degree in co-relation 8366. Up to 3860 conditions per place. [2025-03-04 10:09:11,744 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 45 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2025-03-04 10:09:11,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 70 transitions, 277 flow [2025-03-04 10:09:11,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:09:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:09:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 223 transitions. [2025-03-04 10:09:11,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37166666666666665 [2025-03-04 10:09:11,749 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 173 flow. Second operand 8 states and 223 transitions. [2025-03-04 10:09:11,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 70 transitions, 277 flow [2025-03-04 10:09:11,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:09:11,751 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 180 flow [2025-03-04 10:09:11,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=180, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2025-03-04 10:09:11,752 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 1 predicate places. [2025-03-04 10:09:11,752 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 180 flow [2025-03-04 10:09:11,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 22.8) internal successors, (342), 15 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:11,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:11,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] [2025-03-04 10:09:11,760 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:09:11,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:11,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:11,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:11,954 INFO L85 PathProgramCache]: Analyzing trace with hash 361657484, now seen corresponding path program 1 times [2025-03-04 10:09:11,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:11,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484767759] [2025-03-04 10:09:11,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:11,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:11,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:09:11,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:09:11,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:11,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:12,026 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:09:12,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:12,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484767759] [2025-03-04 10:09:12,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484767759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:12,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:12,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:09:12,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468187491] [2025-03-04 10:09:12,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:12,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:12,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:12,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:12,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:09:12,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 75 [2025-03-04 10:09:12,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:12,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:12,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 75 [2025-03-04 10:09:12,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:12,424 INFO L124 PetriNetUnfolderBase]: 4290/6536 cut-off events. [2025-03-04 10:09:12,425 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 10:09:12,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13045 conditions, 6536 events. 4290/6536 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 33954 event pairs, 4288 based on Foata normal form. 0/6524 useless extension candidates. Maximal degree in co-relation 13019. Up to 6339 conditions per place. [2025-03-04 10:09:12,450 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 55 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-03-04 10:09:12,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 66 transitions, 288 flow [2025-03-04 10:09:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:12,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-03-04 10:09:12,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37 [2025-03-04 10:09:12,452 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 180 flow. Second operand 4 states and 111 transitions. [2025-03-04 10:09:12,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 66 transitions, 288 flow [2025-03-04 10:09:12,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 254 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-03-04 10:09:12,454 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 144 flow [2025-03-04 10:09:12,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2025-03-04 10:09:12,454 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -9 predicate places. [2025-03-04 10:09:12,454 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 144 flow [2025-03-04 10:09:12,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:12,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:12,454 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] [2025-03-04 10:09:12,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:09:12,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:12,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash 361657485, now seen corresponding path program 1 times [2025-03-04 10:09:12,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:12,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722650799] [2025-03-04 10:09:12,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:12,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:09:12,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:09:12,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:12,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:12,513 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:09:12,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:12,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722650799] [2025-03-04 10:09:12,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722650799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:12,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:12,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:09:12,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597943534] [2025-03-04 10:09:12,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:12,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:09:12,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:12,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:09:12,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:09:12,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75 [2025-03-04 10:09:12,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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:09:12,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:12,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75 [2025-03-04 10:09:12,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:12,758 INFO L124 PetriNetUnfolderBase]: 2569/4220 cut-off events. [2025-03-04 10:09:12,759 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 10:09:12,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8202 conditions, 4220 events. 2569/4220 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 24436 event pairs, 2568 based on Foata normal form. 1/4007 useless extension candidates. Maximal degree in co-relation 8165. Up to 3865 conditions per place. [2025-03-04 10:09:12,771 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 51 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-03-04 10:09:12,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 246 flow [2025-03-04 10:09:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:09:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:09:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-04 10:09:12,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 10:09:12,772 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 144 flow. Second operand 3 states and 120 transitions. [2025-03-04 10:09:12,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 246 flow [2025-03-04 10:09:12,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 65 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:12,776 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 141 flow [2025-03-04 10:09:12,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-03-04 10:09:12,776 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -9 predicate places. [2025-03-04 10:09:12,776 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 141 flow [2025-03-04 10:09:12,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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:09:12,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:12,777 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] [2025-03-04 10:09:12,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:09:12,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:12,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:12,778 INFO L85 PathProgramCache]: Analyzing trace with hash 5059091, now seen corresponding path program 1 times [2025-03-04 10:09:12,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:12,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260398203] [2025-03-04 10:09:12,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:12,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:12,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:09:12,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:09:12,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:12,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:12,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:12,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260398203] [2025-03-04 10:09:12,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260398203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:12,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564917024] [2025-03-04 10:09:12,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:12,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:12,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:12,963 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:09:12,965 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:09:13,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:09:13,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:09:13,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:13,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:13,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:09:13,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:13,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:09:13,139 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:09:13,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:09:13,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564917024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:13,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:09:13,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 10:09:13,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105930314] [2025-03-04 10:09:13,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:13,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:09:13,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:13,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:09:13,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:09:13,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-04 10:09:13,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 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:09:13,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:13,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-04 10:09:13,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:13,525 INFO L124 PetriNetUnfolderBase]: 3049/4876 cut-off events. [2025-03-04 10:09:13,525 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-04 10:09:13,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9550 conditions, 4876 events. 3049/4876 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 27483 event pairs, 648 based on Foata normal form. 203/5006 useless extension candidates. Maximal degree in co-relation 9519. Up to 3468 conditions per place. [2025-03-04 10:09:13,545 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 72 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-03-04 10:09:13,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 85 transitions, 333 flow [2025-03-04 10:09:13,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2025-03-04 10:09:13,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2025-03-04 10:09:13,547 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 141 flow. Second operand 4 states and 154 transitions. [2025-03-04 10:09:13,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 85 transitions, 333 flow [2025-03-04 10:09:13,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 85 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:13,548 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 141 flow [2025-03-04 10:09:13,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2025-03-04 10:09:13,550 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -9 predicate places. [2025-03-04 10:09:13,550 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 141 flow [2025-03-04 10:09:13,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 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:09:13,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:13,550 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] [2025-03-04 10:09:13,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:09:13,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:09:13,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:13,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash -77942573, now seen corresponding path program 1 times [2025-03-04 10:09:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:13,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126116212] [2025-03-04 10:09:13,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:13,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:09:13,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:09:13,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:13,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:13,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:13,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126116212] [2025-03-04 10:09:13,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126116212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:13,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413223875] [2025-03-04 10:09:13,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:13,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:13,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:13,961 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:09:13,963 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:09:14,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:09:14,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:09:14,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:14,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:14,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:09:14,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:14,130 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:09:14,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:09:14,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413223875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:14,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:09:14,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:09:14,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878245042] [2025-03-04 10:09:14,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:14,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:09:14,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:14,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:09:14,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:09:14,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-03-04 10:09:14,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 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:09:14,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:14,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-03-04 10:09:14,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:14,593 INFO L124 PetriNetUnfolderBase]: 3132/5083 cut-off events. [2025-03-04 10:09:14,593 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2025-03-04 10:09:14,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10232 conditions, 5083 events. 3132/5083 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 29461 event pairs, 1082 based on Foata normal form. 122/5073 useless extension candidates. Maximal degree in co-relation 10194. Up to 1782 conditions per place. [2025-03-04 10:09:14,612 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 102 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2025-03-04 10:09:14,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 479 flow [2025-03-04 10:09:14,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:09:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:09:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2025-03-04 10:09:14,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-04 10:09:14,614 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 141 flow. Second operand 6 states and 234 transitions. [2025-03-04 10:09:14,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 479 flow [2025-03-04 10:09:14,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 118 transitions, 467 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:09:14,616 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 173 flow [2025-03-04 10:09:14,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2025-03-04 10:09:14,618 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -4 predicate places. [2025-03-04 10:09:14,618 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 173 flow [2025-03-04 10:09:14,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 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:09:14,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:14,618 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:09:14,624 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:09:14,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:14,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:14,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:14,819 INFO L85 PathProgramCache]: Analyzing trace with hash 392054916, now seen corresponding path program 1 times [2025-03-04 10:09:14,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:14,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94167801] [2025-03-04 10:09:14,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:14,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:14,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:09:14,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:09:14,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:14,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:14,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:14,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94167801] [2025-03-04 10:09:14,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94167801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:14,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435251004] [2025-03-04 10:09:14,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:14,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:14,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:14,967 INFO L229 MonitoredProcess]: Starting monitored process 5 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:09:14,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:09:15,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:09:15,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:09:15,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:15,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:15,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:09:15,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:15,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:15,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-04 10:09:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:15,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435251004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:15,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:15,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-04 10:09:15,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596122910] [2025-03-04 10:09:15,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:15,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:09:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:15,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:09:15,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:09:15,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-04 10:09:15,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 173 flow. Second operand has 17 states, 17 states have (on average 21.764705882352942) internal successors, (370), 17 states have internal predecessors, (370), 0 states have call successors, (0), 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:09:15,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:15,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-04 10:09:15,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:16,705 INFO L124 PetriNetUnfolderBase]: 8921/13663 cut-off events. [2025-03-04 10:09:16,706 INFO L125 PetriNetUnfolderBase]: For 2240/2296 co-relation queries the response was YES. [2025-03-04 10:09:16,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29196 conditions, 13663 events. 8921/13663 cut-off events. For 2240/2296 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 84049 event pairs, 4288 based on Foata normal form. 0/13322 useless extension candidates. Maximal degree in co-relation 17727. Up to 5415 conditions per place. [2025-03-04 10:09:16,755 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 164 selfloop transitions, 17 changer transitions 0/189 dead transitions. [2025-03-04 10:09:16,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 189 transitions, 877 flow [2025-03-04 10:09:16,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:09:16,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:09:16,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 360 transitions. [2025-03-04 10:09:16,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-04 10:09:16,757 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 173 flow. Second operand 11 states and 360 transitions. [2025-03-04 10:09:16,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 189 transitions, 877 flow [2025-03-04 10:09:16,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 189 transitions, 868 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:16,766 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 252 flow [2025-03-04 10:09:16,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=252, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-03-04 10:09:16,766 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 8 predicate places. [2025-03-04 10:09:16,766 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 252 flow [2025-03-04 10:09:16,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 21.764705882352942) internal successors, (370), 17 states have internal predecessors, (370), 0 states have call successors, (0), 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:09:16,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:16,767 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:09:16,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:16,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:16,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:16,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash -142094187, now seen corresponding path program 1 times [2025-03-04 10:09:16,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:16,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150220171] [2025-03-04 10:09:16,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:16,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:16,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:09:16,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:09:16,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:16,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:17,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:17,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150220171] [2025-03-04 10:09:17,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150220171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:17,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530255727] [2025-03-04 10:09:17,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:17,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:17,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:17,138 INFO L229 MonitoredProcess]: Starting monitored process 6 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:09:17,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:09:17,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:09:17,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:09:17,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:17,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:17,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:09:17,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:17,295 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:09:17,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:09:17,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530255727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:17,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:09:17,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:09:17,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506822774] [2025-03-04 10:09:17,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:17,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:09:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:17,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:09:17,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:09:17,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-03-04 10:09:17,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 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:09:17,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:17,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-03-04 10:09:17,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:18,126 INFO L124 PetriNetUnfolderBase]: 7233/11699 cut-off events. [2025-03-04 10:09:18,127 INFO L125 PetriNetUnfolderBase]: For 6203/6203 co-relation queries the response was YES. [2025-03-04 10:09:18,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27546 conditions, 11699 events. 7233/11699 cut-off events. For 6203/6203 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 78128 event pairs, 2588 based on Foata normal form. 250/11893 useless extension candidates. Maximal degree in co-relation 16828. Up to 4860 conditions per place. [2025-03-04 10:09:18,190 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 114 selfloop transitions, 8 changer transitions 0/134 dead transitions. [2025-03-04 10:09:18,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 134 transitions, 689 flow [2025-03-04 10:09:18,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:09:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:09:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 232 transitions. [2025-03-04 10:09:18,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5155555555555555 [2025-03-04 10:09:18,192 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 252 flow. Second operand 6 states and 232 transitions. [2025-03-04 10:09:18,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 134 transitions, 689 flow [2025-03-04 10:09:18,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 134 transitions, 683 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:09:18,204 INFO L231 Difference]: Finished difference. Result has 93 places, 78 transitions, 287 flow [2025-03-04 10:09:18,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=93, PETRI_TRANSITIONS=78} [2025-03-04 10:09:18,204 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 13 predicate places. [2025-03-04 10:09:18,205 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 78 transitions, 287 flow [2025-03-04 10:09:18,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 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:09:18,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:18,205 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:18,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:18,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:18,406 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:18,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1678307650, now seen corresponding path program 2 times [2025-03-04 10:09:18,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:18,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711560913] [2025-03-04 10:09:18,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:18,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:18,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 10:09:18,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:09:18,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:18,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:18,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:18,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711560913] [2025-03-04 10:09:18,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711560913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:18,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863800909] [2025-03-04 10:09:18,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:18,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:18,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:18,547 INFO L229 MonitoredProcess]: Starting monitored process 7 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:09:18,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:09:18,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 10:09:18,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:09:18,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:18,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:18,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:09:18,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:18,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:09:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:18,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:09:18,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863800909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:18,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:09:18,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:09:18,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828063923] [2025-03-04 10:09:18,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:18,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:09:18,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:18,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:09:18,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:09:18,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-04 10:09:18,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 78 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:18,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:18,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-04 10:09:18,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:19,285 INFO L124 PetriNetUnfolderBase]: 7023/11047 cut-off events. [2025-03-04 10:09:19,286 INFO L125 PetriNetUnfolderBase]: For 7126/7174 co-relation queries the response was YES. [2025-03-04 10:09:19,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27249 conditions, 11047 events. 7023/11047 cut-off events. For 7126/7174 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 68836 event pairs, 3002 based on Foata normal form. 302/11271 useless extension candidates. Maximal degree in co-relation 16849. Up to 5796 conditions per place. [2025-03-04 10:09:19,336 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 83 selfloop transitions, 9 changer transitions 0/104 dead transitions. [2025-03-04 10:09:19,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 104 transitions, 568 flow [2025-03-04 10:09:19,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:09:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:09:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2025-03-04 10:09:19,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4613333333333333 [2025-03-04 10:09:19,338 INFO L175 Difference]: Start difference. First operand has 93 places, 78 transitions, 287 flow. Second operand 5 states and 173 transitions. [2025-03-04 10:09:19,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 104 transitions, 568 flow [2025-03-04 10:09:19,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 104 transitions, 558 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:09:19,353 INFO L231 Difference]: Finished difference. Result has 93 places, 77 transitions, 292 flow [2025-03-04 10:09:19,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=93, PETRI_TRANSITIONS=77} [2025-03-04 10:09:19,354 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 13 predicate places. [2025-03-04 10:09:19,354 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 77 transitions, 292 flow [2025-03-04 10:09:19,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:19,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:19,355 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:09:19,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:19,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:19,556 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:19,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash 838915559, now seen corresponding path program 1 times [2025-03-04 10:09:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:19,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721644577] [2025-03-04 10:09:19,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:19,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:19,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 10:09:19,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:09:19,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:19,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:19,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:19,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721644577] [2025-03-04 10:09:19,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721644577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:19,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:19,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:09:19,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342090567] [2025-03-04 10:09:19,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:19,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:09:19,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:19,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:09:19,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:09:19,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75 [2025-03-04 10:09:19,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 77 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:19,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:19,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75 [2025-03-04 10:09:19,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:20,098 INFO L124 PetriNetUnfolderBase]: 6975/11383 cut-off events. [2025-03-04 10:09:20,099 INFO L125 PetriNetUnfolderBase]: For 11296/11296 co-relation queries the response was YES. [2025-03-04 10:09:20,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29120 conditions, 11383 events. 6975/11383 cut-off events. For 11296/11296 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 76930 event pairs, 5422 based on Foata normal form. 48/11345 useless extension candidates. Maximal degree in co-relation 15795. Up to 9116 conditions per place. [2025-03-04 10:09:20,146 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 82 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-03-04 10:09:20,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 96 transitions, 539 flow [2025-03-04 10:09:20,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:09:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:09:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2025-03-04 10:09:20,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5955555555555555 [2025-03-04 10:09:20,147 INFO L175 Difference]: Start difference. First operand has 93 places, 77 transitions, 292 flow. Second operand 3 states and 134 transitions. [2025-03-04 10:09:20,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 96 transitions, 539 flow [2025-03-04 10:09:20,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 509 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:09:20,164 INFO L231 Difference]: Finished difference. Result has 92 places, 77 transitions, 282 flow [2025-03-04 10:09:20,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=92, PETRI_TRANSITIONS=77} [2025-03-04 10:09:20,165 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 12 predicate places. [2025-03-04 10:09:20,165 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 77 transitions, 282 flow [2025-03-04 10:09:20,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:20,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:20,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:20,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:09:20,166 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:20,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1087172273, now seen corresponding path program 2 times [2025-03-04 10:09:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:20,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162778614] [2025-03-04 10:09:20,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:20,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 10:09:20,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 37 statements. [2025-03-04 10:09:20,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:09:20,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:20,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:20,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:20,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162778614] [2025-03-04 10:09:20,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162778614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:20,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:20,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:09:20,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255529325] [2025-03-04 10:09:20,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:20,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:09:20,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:20,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:09:20,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:09:20,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75 [2025-03-04 10:09:20,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 77 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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:09:20,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:20,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75 [2025-03-04 10:09:20,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:20,968 INFO L124 PetriNetUnfolderBase]: 8547/13971 cut-off events. [2025-03-04 10:09:20,968 INFO L125 PetriNetUnfolderBase]: For 9728/9728 co-relation queries the response was YES. [2025-03-04 10:09:20,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34587 conditions, 13971 events. 8547/13971 cut-off events. For 9728/9728 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 100240 event pairs, 4486 based on Foata normal form. 168/14031 useless extension candidates. Maximal degree in co-relation 19031. Up to 8067 conditions per place. [2025-03-04 10:09:21,009 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 119 selfloop transitions, 8 changer transitions 1/140 dead transitions. [2025-03-04 10:09:21,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 140 transitions, 772 flow [2025-03-04 10:09:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:09:21,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:09:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2025-03-04 10:09:21,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.568 [2025-03-04 10:09:21,010 INFO L175 Difference]: Start difference. First operand has 92 places, 77 transitions, 282 flow. Second operand 5 states and 213 transitions. [2025-03-04 10:09:21,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 140 transitions, 772 flow [2025-03-04 10:09:21,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 140 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:21,034 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 331 flow [2025-03-04 10:09:21,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=331, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2025-03-04 10:09:21,034 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 17 predicate places. [2025-03-04 10:09:21,034 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 331 flow [2025-03-04 10:09:21,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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:09:21,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:21,035 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:09:21,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:09:21,035 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:21,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1782306481, now seen corresponding path program 3 times [2025-03-04 10:09:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:21,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013683989] [2025-03-04 10:09:21,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:21,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:21,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-03-04 10:09:21,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 37 statements. [2025-03-04 10:09:21,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:09:21,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:21,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:21,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013683989] [2025-03-04 10:09:21,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013683989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:21,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:21,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:09:21,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830458390] [2025-03-04 10:09:21,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:21,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:09:21,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:21,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:09:21,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:09:21,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75 [2025-03-04 10:09:21,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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:09:21,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:21,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75 [2025-03-04 10:09:21,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:21,667 INFO L124 PetriNetUnfolderBase]: 5375/9057 cut-off events. [2025-03-04 10:09:21,667 INFO L125 PetriNetUnfolderBase]: For 7570/7570 co-relation queries the response was YES. [2025-03-04 10:09:21,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23761 conditions, 9057 events. 5375/9057 cut-off events. For 7570/7570 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 62808 event pairs, 2438 based on Foata normal form. 144/9133 useless extension candidates. Maximal degree in co-relation 15627. Up to 3747 conditions per place. [2025-03-04 10:09:21,700 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 108 selfloop transitions, 9 changer transitions 2/131 dead transitions. [2025-03-04 10:09:21,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 131 transitions, 739 flow [2025-03-04 10:09:21,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:09:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:09:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2025-03-04 10:09:21,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5493333333333333 [2025-03-04 10:09:21,701 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 331 flow. Second operand 5 states and 206 transitions. [2025-03-04 10:09:21,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 131 transitions, 739 flow [2025-03-04 10:09:21,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 131 transitions, 731 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:21,726 INFO L231 Difference]: Finished difference. Result has 100 places, 82 transitions, 334 flow [2025-03-04 10:09:21,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=334, PETRI_PLACES=100, PETRI_TRANSITIONS=82} [2025-03-04 10:09:21,726 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 20 predicate places. [2025-03-04 10:09:21,726 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 82 transitions, 334 flow [2025-03-04 10:09:21,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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:09:21,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:21,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:21,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:09:21,727 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:21,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:21,727 INFO L85 PathProgramCache]: Analyzing trace with hash 174027054, now seen corresponding path program 1 times [2025-03-04 10:09:21,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:21,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842999559] [2025-03-04 10:09:21,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:21,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:21,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:09:21,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:09:21,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:21,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:21,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:21,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842999559] [2025-03-04 10:09:21,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842999559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:21,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46285681] [2025-03-04 10:09:21,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:21,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:21,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:21,911 INFO L229 MonitoredProcess]: Starting monitored process 8 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:09:21,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:09:21,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:09:21,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:09:21,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:21,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:21,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:09:21,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:22,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:22,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-04 10:09:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:22,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46285681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:22,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:22,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2025-03-04 10:09:22,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724064975] [2025-03-04 10:09:22,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:22,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:09:22,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:22,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:09:22,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:09:23,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 75 [2025-03-04 10:09:23,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 82 transitions, 334 flow. Second operand has 21 states, 21 states have (on average 23.333333333333332) internal successors, (490), 21 states have internal predecessors, (490), 0 states have call successors, (0), 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:09:23,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:23,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 75 [2025-03-04 10:09:23,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:24,267 INFO L124 PetriNetUnfolderBase]: 5967/9585 cut-off events. [2025-03-04 10:09:24,267 INFO L125 PetriNetUnfolderBase]: For 8574/8574 co-relation queries the response was YES. [2025-03-04 10:09:24,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26109 conditions, 9585 events. 5967/9585 cut-off events. For 8574/8574 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 61468 event pairs, 1891 based on Foata normal form. 116/9667 useless extension candidates. Maximal degree in co-relation 16176. Up to 2226 conditions per place. [2025-03-04 10:09:24,306 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 203 selfloop transitions, 32 changer transitions 0/244 dead transitions. [2025-03-04 10:09:24,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 244 transitions, 1403 flow [2025-03-04 10:09:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:09:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 10:09:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 598 transitions. [2025-03-04 10:09:24,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39866666666666667 [2025-03-04 10:09:24,307 INFO L175 Difference]: Start difference. First operand has 100 places, 82 transitions, 334 flow. Second operand 20 states and 598 transitions. [2025-03-04 10:09:24,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 244 transitions, 1403 flow [2025-03-04 10:09:24,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 244 transitions, 1393 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 10:09:24,321 INFO L231 Difference]: Finished difference. Result has 119 places, 94 transitions, 451 flow [2025-03-04 10:09:24,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=451, PETRI_PLACES=119, PETRI_TRANSITIONS=94} [2025-03-04 10:09:24,322 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 39 predicate places. [2025-03-04 10:09:24,322 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 94 transitions, 451 flow [2025-03-04 10:09:24,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 23.333333333333332) internal successors, (490), 21 states have internal predecessors, (490), 0 states have call successors, (0), 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:09:24,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:24,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:24,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:24,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:24,527 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:24,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:24,527 INFO L85 PathProgramCache]: Analyzing trace with hash -63755517, now seen corresponding path program 1 times [2025-03-04 10:09:24,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:24,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681176770] [2025-03-04 10:09:24,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:24,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:09:24,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:09:24,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:24,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:24,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:24,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681176770] [2025-03-04 10:09:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681176770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:24,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:24,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:09:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917379412] [2025-03-04 10:09:24,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:24,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:09:24,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:24,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:09:24,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:09:24,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75 [2025-03-04 10:09:24,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 94 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:24,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:24,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75 [2025-03-04 10:09:24,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:25,012 INFO L124 PetriNetUnfolderBase]: 5183/8647 cut-off events. [2025-03-04 10:09:25,013 INFO L125 PetriNetUnfolderBase]: For 9793/9793 co-relation queries the response was YES. [2025-03-04 10:09:25,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24683 conditions, 8647 events. 5183/8647 cut-off events. For 9793/9793 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 57537 event pairs, 3846 based on Foata normal form. 24/8629 useless extension candidates. Maximal degree in co-relation 18052. Up to 6632 conditions per place. [2025-03-04 10:09:25,057 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 105 selfloop transitions, 2 changer transitions 1/119 dead transitions. [2025-03-04 10:09:25,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 785 flow [2025-03-04 10:09:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:09:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:09:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-03-04 10:09:25,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 10:09:25,059 INFO L175 Difference]: Start difference. First operand has 119 places, 94 transitions, 451 flow. Second operand 3 states and 135 transitions. [2025-03-04 10:09:25,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 785 flow [2025-03-04 10:09:25,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 764 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-04 10:09:25,073 INFO L231 Difference]: Finished difference. Result has 114 places, 94 transitions, 438 flow [2025-03-04 10:09:25,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=114, PETRI_TRANSITIONS=94} [2025-03-04 10:09:25,074 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 34 predicate places. [2025-03-04 10:09:25,074 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 94 transitions, 438 flow [2025-03-04 10:09:25,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:25,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:25,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:25,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:09:25,074 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:25,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash -48238495, now seen corresponding path program 2 times [2025-03-04 10:09:25,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:25,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539870023] [2025-03-04 10:09:25,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:25,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:25,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 10:09:25,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:09:25,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:25,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:25,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:25,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539870023] [2025-03-04 10:09:25,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539870023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:25,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856028347] [2025-03-04 10:09:25,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:25,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:25,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:25,238 INFO L229 MonitoredProcess]: Starting monitored process 9 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:09:25,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:09:25,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 10:09:25,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:09:25,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:25,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:25,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:09:25,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:25,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:25,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-04 10:09:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:25,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856028347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:25,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:25,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-04 10:09:25,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604750775] [2025-03-04 10:09:25,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:25,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:09:25,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:25,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:09:25,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:09:26,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 75 [2025-03-04 10:09:26,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 94 transitions, 438 flow. Second operand has 23 states, 23 states have (on average 22.956521739130434) internal successors, (528), 23 states have internal predecessors, (528), 0 states have call successors, (0), 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:09:26,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:26,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 75 [2025-03-04 10:09:26,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:27,448 INFO L124 PetriNetUnfolderBase]: 6027/9593 cut-off events. [2025-03-04 10:09:27,448 INFO L125 PetriNetUnfolderBase]: For 10848/10848 co-relation queries the response was YES. [2025-03-04 10:09:27,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28318 conditions, 9593 events. 6027/9593 cut-off events. For 10848/10848 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 60810 event pairs, 2344 based on Foata normal form. 48/9603 useless extension candidates. Maximal degree in co-relation 20451. Up to 2508 conditions per place. [2025-03-04 10:09:27,490 INFO L140 encePairwiseOnDemand]: 58/75 looper letters, 219 selfloop transitions, 24 changer transitions 0/251 dead transitions. [2025-03-04 10:09:27,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 251 transitions, 1523 flow [2025-03-04 10:09:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:09:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:09:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 585 transitions. [2025-03-04 10:09:27,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4105263157894737 [2025-03-04 10:09:27,492 INFO L175 Difference]: Start difference. First operand has 114 places, 94 transitions, 438 flow. Second operand 19 states and 585 transitions. [2025-03-04 10:09:27,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 251 transitions, 1523 flow [2025-03-04 10:09:27,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 251 transitions, 1501 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:27,506 INFO L231 Difference]: Finished difference. Result has 132 places, 97 transitions, 497 flow [2025-03-04 10:09:27,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=497, PETRI_PLACES=132, PETRI_TRANSITIONS=97} [2025-03-04 10:09:27,506 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 52 predicate places. [2025-03-04 10:09:27,506 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 97 transitions, 497 flow [2025-03-04 10:09:27,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 22.956521739130434) internal successors, (528), 23 states have internal predecessors, (528), 0 states have call successors, (0), 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:09:27,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:27,507 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:27,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:27,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:09:27,707 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:27,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash 892105405, now seen corresponding path program 3 times [2025-03-04 10:09:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:27,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147526434] [2025-03-04 10:09:27,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:27,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:27,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-03-04 10:09:27,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 41 statements. [2025-03-04 10:09:27,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:09:27,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:09:27,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:27,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147526434] [2025-03-04 10:09:27,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147526434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:27,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640179874] [2025-03-04 10:09:27,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:27,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:27,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:27,842 INFO L229 MonitoredProcess]: Starting monitored process 10 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:09:27,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:09:27,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-03-04 10:09:27,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 41 statements. [2025-03-04 10:09:27,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:09:27,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:27,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:09:27,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:27,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:09:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:09:28,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:09:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640179874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:28,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:09:28,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-03-04 10:09:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670638411] [2025-03-04 10:09:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:28,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:09:28,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:28,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:09:28,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:09:28,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-03-04 10:09:28,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 97 transitions, 497 flow. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:28,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:28,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-03-04 10:09:28,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:28,694 INFO L124 PetriNetUnfolderBase]: 5183/8621 cut-off events. [2025-03-04 10:09:28,694 INFO L125 PetriNetUnfolderBase]: For 11374/11374 co-relation queries the response was YES. [2025-03-04 10:09:28,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25880 conditions, 8621 events. 5183/8621 cut-off events. For 11374/11374 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 57199 event pairs, 2302 based on Foata normal form. 48/8607 useless extension candidates. Maximal degree in co-relation 23885. Up to 3816 conditions per place. [2025-03-04 10:09:28,733 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 111 selfloop transitions, 23 changer transitions 0/147 dead transitions. [2025-03-04 10:09:28,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 147 transitions, 955 flow [2025-03-04 10:09:28,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:09:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:09:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 242 transitions. [2025-03-04 10:09:28,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46095238095238095 [2025-03-04 10:09:28,734 INFO L175 Difference]: Start difference. First operand has 132 places, 97 transitions, 497 flow. Second operand 7 states and 242 transitions. [2025-03-04 10:09:28,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 147 transitions, 955 flow [2025-03-04 10:09:28,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 147 transitions, 909 flow, removed 2 selfloop flow, removed 14 redundant places. [2025-03-04 10:09:28,748 INFO L231 Difference]: Finished difference. Result has 123 places, 97 transitions, 495 flow [2025-03-04 10:09:28,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=495, PETRI_PLACES=123, PETRI_TRANSITIONS=97} [2025-03-04 10:09:28,749 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 43 predicate places. [2025-03-04 10:09:28,749 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 97 transitions, 495 flow [2025-03-04 10:09:28,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:28,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:28,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:28,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:09:28,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:09:28,949 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:28,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:28,950 INFO L85 PathProgramCache]: Analyzing trace with hash -911208816, now seen corresponding path program 1 times [2025-03-04 10:09:28,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:28,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543209469] [2025-03-04 10:09:28,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:28,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:28,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 10:09:28,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 10:09:28,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:28,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:29,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:29,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543209469] [2025-03-04 10:09:29,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543209469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:29,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156320629] [2025-03-04 10:09:29,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:29,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:29,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:29,336 INFO L229 MonitoredProcess]: Starting monitored process 11 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:09:29,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:09:29,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 10:09:29,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 10:09:29,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:29,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:29,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 10:09:29,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:29,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:09:29,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2025-03-04 10:09:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:29,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:30,217 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-03-04 10:09:30,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 82 [2025-03-04 10:09:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:09:30,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156320629] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:30,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:09:30,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [14, 17] total 38 [2025-03-04 10:09:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040208734] [2025-03-04 10:09:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:30,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:09:30,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:30,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:09:30,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1293, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 10:09:30,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-04 10:09:30,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 97 transitions, 495 flow. Second operand has 15 states, 15 states have (on average 21.666666666666668) internal successors, (325), 15 states have internal predecessors, (325), 0 states have call successors, (0), 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:09:30,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:30,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-04 10:09:30,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:32,360 INFO L124 PetriNetUnfolderBase]: 8857/13793 cut-off events. [2025-03-04 10:09:32,360 INFO L125 PetriNetUnfolderBase]: For 15697/15697 co-relation queries the response was YES. [2025-03-04 10:09:32,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42168 conditions, 13793 events. 8857/13793 cut-off events. For 15697/15697 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 83958 event pairs, 1556 based on Foata normal form. 2/13773 useless extension candidates. Maximal degree in co-relation 29230. Up to 9055 conditions per place. [2025-03-04 10:09:32,418 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 207 selfloop transitions, 44 changer transitions 77/332 dead transitions. [2025-03-04 10:09:32,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 332 transitions, 2484 flow [2025-03-04 10:09:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:09:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:09:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 606 transitions. [2025-03-04 10:09:32,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38476190476190475 [2025-03-04 10:09:32,419 INFO L175 Difference]: Start difference. First operand has 123 places, 97 transitions, 495 flow. Second operand 21 states and 606 transitions. [2025-03-04 10:09:32,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 332 transitions, 2484 flow [2025-03-04 10:09:32,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 332 transitions, 2438 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:09:32,444 INFO L231 Difference]: Finished difference. Result has 156 places, 132 transitions, 968 flow [2025-03-04 10:09:32,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=968, PETRI_PLACES=156, PETRI_TRANSITIONS=132} [2025-03-04 10:09:32,445 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 76 predicate places. [2025-03-04 10:09:32,445 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 132 transitions, 968 flow [2025-03-04 10:09:32,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 21.666666666666668) internal successors, (325), 15 states have internal predecessors, (325), 0 states have call successors, (0), 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:09:32,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:32,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:32,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:09:32,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:09:32,646 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:32,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:32,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2051808056, now seen corresponding path program 2 times [2025-03-04 10:09:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:32,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891355261] [2025-03-04 10:09:32,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:32,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:32,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-04 10:09:32,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-03-04 10:09:32,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:09:32,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:09:32,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:32,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891355261] [2025-03-04 10:09:32,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891355261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:32,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:32,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 10:09:32,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047553734] [2025-03-04 10:09:32,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:32,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:09:32,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:32,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:09:32,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:09:33,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-04 10:09:33,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 132 transitions, 968 flow. Second operand has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 0 states have call successors, (0), 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:09:33,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:33,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-04 10:09:33,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:34,571 INFO L124 PetriNetUnfolderBase]: 10145/15729 cut-off events. [2025-03-04 10:09:34,572 INFO L125 PetriNetUnfolderBase]: For 32031/32031 co-relation queries the response was YES. [2025-03-04 10:09:34,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57040 conditions, 15729 events. 10145/15729 cut-off events. For 32031/32031 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 98098 event pairs, 2234 based on Foata normal form. 2/15709 useless extension candidates. Maximal degree in co-relation 56991. Up to 10097 conditions per place. [2025-03-04 10:09:34,673 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 247 selfloop transitions, 82 changer transitions 62/395 dead transitions. [2025-03-04 10:09:34,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 395 transitions, 3190 flow [2025-03-04 10:09:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 10:09:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 10:09:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 742 transitions. [2025-03-04 10:09:34,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3664197530864198 [2025-03-04 10:09:34,675 INFO L175 Difference]: Start difference. First operand has 156 places, 132 transitions, 968 flow. Second operand 27 states and 742 transitions. [2025-03-04 10:09:34,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 395 transitions, 3190 flow [2025-03-04 10:09:34,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 395 transitions, 3086 flow, removed 28 selfloop flow, removed 11 redundant places. [2025-03-04 10:09:34,931 INFO L231 Difference]: Finished difference. Result has 180 places, 199 transitions, 1766 flow [2025-03-04 10:09:34,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1766, PETRI_PLACES=180, PETRI_TRANSITIONS=199} [2025-03-04 10:09:34,932 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 100 predicate places. [2025-03-04 10:09:34,932 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 199 transitions, 1766 flow [2025-03-04 10:09:34,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 0 states have call successors, (0), 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:09:34,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:34,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:34,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:09:34,932 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:34,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:34,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2011282630, now seen corresponding path program 3 times [2025-03-04 10:09:34,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:34,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989968973] [2025-03-04 10:09:34,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:34,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 3 equivalence classes. [2025-03-04 10:09:34,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-03-04 10:09:34,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:09:34,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:09:35,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:35,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989968973] [2025-03-04 10:09:35,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989968973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:35,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:35,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 10:09:35,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241046469] [2025-03-04 10:09:35,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:35,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:09:35,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:35,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:09:35,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:09:35,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-04 10:09:35,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 199 transitions, 1766 flow. Second operand has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 0 states have call successors, (0), 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:09:35,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:35,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-04 10:09:35,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:37,458 INFO L124 PetriNetUnfolderBase]: 10245/15833 cut-off events. [2025-03-04 10:09:37,458 INFO L125 PetriNetUnfolderBase]: For 51852/51852 co-relation queries the response was YES. [2025-03-04 10:09:37,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64282 conditions, 15833 events. 10245/15833 cut-off events. For 51852/51852 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 98248 event pairs, 2069 based on Foata normal form. 2/15813 useless extension candidates. Maximal degree in co-relation 64222. Up to 10255 conditions per place. [2025-03-04 10:09:37,586 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 277 selfloop transitions, 105 changer transitions 27/413 dead transitions. [2025-03-04 10:09:37,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 413 transitions, 3718 flow [2025-03-04 10:09:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:09:37,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 10:09:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 731 transitions. [2025-03-04 10:09:37,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3748717948717949 [2025-03-04 10:09:37,588 INFO L175 Difference]: Start difference. First operand has 180 places, 199 transitions, 1766 flow. Second operand 26 states and 731 transitions. [2025-03-04 10:09:37,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 413 transitions, 3718 flow [2025-03-04 10:09:37,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 413 transitions, 3541 flow, removed 77 selfloop flow, removed 8 redundant places. [2025-03-04 10:09:37,908 INFO L231 Difference]: Finished difference. Result has 199 places, 224 transitions, 2180 flow [2025-03-04 10:09:37,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1669, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2180, PETRI_PLACES=199, PETRI_TRANSITIONS=224} [2025-03-04 10:09:37,909 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 119 predicate places. [2025-03-04 10:09:37,909 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 224 transitions, 2180 flow [2025-03-04 10:09:37,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 0 states have call successors, (0), 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:09:37,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:37,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:37,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:09:37,909 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:37,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash 839844942, now seen corresponding path program 4 times [2025-03-04 10:09:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:37,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240385388] [2025-03-04 10:09:37,910 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:09:37,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:37,916 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-04 10:09:37,945 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 50 of 59 statements. [2025-03-04 10:09:37,945 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:09:37,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:09:38,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:38,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240385388] [2025-03-04 10:09:38,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240385388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:38,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:38,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 10:09:38,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233618942] [2025-03-04 10:09:38,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:38,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:09:38,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:38,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:09:38,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:09:38,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-04 10:09:38,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 224 transitions, 2180 flow. Second operand has 11 states, 11 states have (on average 23.0) internal successors, (253), 11 states have internal predecessors, (253), 0 states have call successors, (0), 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:09:38,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:38,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-04 10:09:38,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:40,198 INFO L124 PetriNetUnfolderBase]: 11389/17571 cut-off events. [2025-03-04 10:09:40,199 INFO L125 PetriNetUnfolderBase]: For 72540/72540 co-relation queries the response was YES. [2025-03-04 10:09:40,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75671 conditions, 17571 events. 11389/17571 cut-off events. For 72540/72540 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 110037 event pairs, 2230 based on Foata normal form. 2/17551 useless extension candidates. Maximal degree in co-relation 69781. Up to 9615 conditions per place. [2025-03-04 10:09:40,323 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 315 selfloop transitions, 120 changer transitions 43/482 dead transitions. [2025-03-04 10:09:40,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 482 transitions, 4764 flow [2025-03-04 10:09:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:09:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 10:09:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 701 transitions. [2025-03-04 10:09:40,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3894444444444444 [2025-03-04 10:09:40,325 INFO L175 Difference]: Start difference. First operand has 199 places, 224 transitions, 2180 flow. Second operand 24 states and 701 transitions. [2025-03-04 10:09:40,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 482 transitions, 4764 flow [2025-03-04 10:09:40,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 482 transitions, 4455 flow, removed 78 selfloop flow, removed 17 redundant places. [2025-03-04 10:09:40,846 INFO L231 Difference]: Finished difference. Result has 209 places, 262 transitions, 2692 flow [2025-03-04 10:09:40,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1955, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2692, PETRI_PLACES=209, PETRI_TRANSITIONS=262} [2025-03-04 10:09:40,846 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 129 predicate places. [2025-03-04 10:09:40,846 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 262 transitions, 2692 flow [2025-03-04 10:09:40,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.0) internal successors, (253), 11 states have internal predecessors, (253), 0 states have call successors, (0), 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:09:40,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:40,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:40,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:09:40,847 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:40,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:40,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1516702464, now seen corresponding path program 5 times [2025-03-04 10:09:40,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:40,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372123960] [2025-03-04 10:09:40,847 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:09:40,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:40,852 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 3 equivalence classes. [2025-03-04 10:09:40,860 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 10:09:40,860 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:09:40,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:41,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372123960] [2025-03-04 10:09:41,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372123960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108187573] [2025-03-04 10:09:41,092 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:09:41,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:41,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:41,095 INFO L229 MonitoredProcess]: Starting monitored process 12 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:09:41,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:09:41,139 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 3 equivalence classes. [2025-03-04 10:09:41,166 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 10:09:41,167 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:09:41,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:41,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 10:09:41,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:41,595 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-03-04 10:09:41,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 24 [2025-03-04 10:09:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:41,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:41,891 INFO L349 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2025-03-04 10:09:41,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 53 [2025-03-04 10:09:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:42,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108187573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:42,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:42,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 36 [2025-03-04 10:09:42,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683539435] [2025-03-04 10:09:42,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:42,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:09:42,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:42,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:09:42,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:09:43,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-04 10:09:43,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 262 transitions, 2692 flow. Second operand has 36 states, 36 states have (on average 21.416666666666668) internal successors, (771), 36 states have internal predecessors, (771), 0 states have call successors, (0), 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:09:43,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:43,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-04 10:09:43,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:51,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 10:09:57,407 INFO L124 PetriNetUnfolderBase]: 16397/25225 cut-off events. [2025-03-04 10:09:57,407 INFO L125 PetriNetUnfolderBase]: For 129805/129805 co-relation queries the response was YES. [2025-03-04 10:09:57,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115151 conditions, 25225 events. 16397/25225 cut-off events. For 129805/129805 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 168418 event pairs, 3002 based on Foata normal form. 2/25216 useless extension candidates. Maximal degree in co-relation 108302. Up to 7851 conditions per place. [2025-03-04 10:09:57,718 INFO L140 encePairwiseOnDemand]: 52/75 looper letters, 665 selfloop transitions, 222 changer transitions 79/970 dead transitions. [2025-03-04 10:09:57,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 970 transitions, 9222 flow [2025-03-04 10:09:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-04 10:09:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-03-04 10:09:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 1711 transitions. [2025-03-04 10:09:57,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37398907103825135 [2025-03-04 10:09:57,721 INFO L175 Difference]: Start difference. First operand has 209 places, 262 transitions, 2692 flow. Second operand 61 states and 1711 transitions. [2025-03-04 10:09:57,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 970 transitions, 9222 flow [2025-03-04 10:09:59,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 970 transitions, 8676 flow, removed 217 selfloop flow, removed 14 redundant places. [2025-03-04 10:09:59,164 INFO L231 Difference]: Finished difference. Result has 278 places, 419 transitions, 4887 flow [2025-03-04 10:09:59,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2486, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=4887, PETRI_PLACES=278, PETRI_TRANSITIONS=419} [2025-03-04 10:09:59,164 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 198 predicate places. [2025-03-04 10:09:59,164 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 419 transitions, 4887 flow [2025-03-04 10:09:59,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 21.416666666666668) internal successors, (771), 36 states have internal predecessors, (771), 0 states have call successors, (0), 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:09:59,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:59,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:59,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:09:59,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:09:59,365 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:09:59,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash -454147158, now seen corresponding path program 6 times [2025-03-04 10:09:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:59,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489072158] [2025-03-04 10:09:59,366 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:09:59,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:59,373 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 3 equivalence classes. [2025-03-04 10:09:59,381 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-03-04 10:09:59,381 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 10:09:59,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:09:59,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:59,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489072158] [2025-03-04 10:09:59,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489072158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:59,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:59,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 10:09:59,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911020495] [2025-03-04 10:09:59,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:59,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:09:59,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:59,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:09:59,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:09:59,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-04 10:09:59,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 419 transitions, 4887 flow. Second operand has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 0 states have call successors, (0), 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:09:59,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:59,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-04 10:09:59,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:04,364 INFO L124 PetriNetUnfolderBase]: 19632/30077 cut-off events. [2025-03-04 10:10:04,365 INFO L125 PetriNetUnfolderBase]: For 203000/203000 co-relation queries the response was YES. [2025-03-04 10:10:04,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150951 conditions, 30077 events. 19632/30077 cut-off events. For 203000/203000 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 203816 event pairs, 5373 based on Foata normal form. 2/30057 useless extension candidates. Maximal degree in co-relation 150851. Up to 23404 conditions per place. [2025-03-04 10:10:04,928 INFO L140 encePairwiseOnDemand]: 57/75 looper letters, 579 selfloop transitions, 176 changer transitions 31/790 dead transitions. [2025-03-04 10:10:04,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 790 transitions, 9702 flow [2025-03-04 10:10:04,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 10:10:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-04 10:10:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 862 transitions. [2025-03-04 10:10:04,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.370752688172043 [2025-03-04 10:10:04,930 INFO L175 Difference]: Start difference. First operand has 278 places, 419 transitions, 4887 flow. Second operand 31 states and 862 transitions. [2025-03-04 10:10:04,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 790 transitions, 9702 flow [2025-03-04 10:10:08,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 790 transitions, 8979 flow, removed 300 selfloop flow, removed 7 redundant places. [2025-03-04 10:10:08,276 INFO L231 Difference]: Finished difference. Result has 309 places, 557 transitions, 6699 flow [2025-03-04 10:10:08,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=4322, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=6699, PETRI_PLACES=309, PETRI_TRANSITIONS=557} [2025-03-04 10:10:08,276 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 229 predicate places. [2025-03-04 10:10:08,276 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 557 transitions, 6699 flow [2025-03-04 10:10:08,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 0 states have call successors, (0), 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:10:08,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:08,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:08,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:10:08,277 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:10:08,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:08,277 INFO L85 PathProgramCache]: Analyzing trace with hash 450557292, now seen corresponding path program 7 times [2025-03-04 10:10:08,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:08,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181828020] [2025-03-04 10:10:08,278 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:10:08,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:08,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 10:10:08,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 10:10:08,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:08,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:10:08,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:08,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181828020] [2025-03-04 10:10:08,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181828020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:08,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086861434] [2025-03-04 10:10:08,624 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:10:08,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:08,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:08,626 INFO L229 MonitoredProcess]: Starting monitored process 13 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:10:08,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:10:08,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 10:10:08,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 10:10:08,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:08,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:08,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 10:10:08,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:09,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:10:09,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2025-03-04 10:10:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:10:09,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:09,554 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-03-04 10:10:09,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 82 [2025-03-04 10:10:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:10:09,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086861434] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:09,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:10:09,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14, 16] total 36 [2025-03-04 10:10:09,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646893168] [2025-03-04 10:10:09,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:09,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:10:09,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:09,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:10:09,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:10:10,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-04 10:10:10,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 557 transitions, 6699 flow. Second operand has 14 states, 14 states have (on average 21.928571428571427) internal successors, (307), 14 states have internal predecessors, (307), 0 states have call successors, (0), 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:10:10,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:10,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-04 10:10:10,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:16,353 INFO L124 PetriNetUnfolderBase]: 21500/32990 cut-off events. [2025-03-04 10:10:16,354 INFO L125 PetriNetUnfolderBase]: For 236970/236970 co-relation queries the response was YES. [2025-03-04 10:10:16,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168314 conditions, 32990 events. 21500/32990 cut-off events. For 236970/236970 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 227251 event pairs, 5856 based on Foata normal form. 2/32970 useless extension candidates. Maximal degree in co-relation 166861. Up to 26160 conditions per place. [2025-03-04 10:10:17,003 INFO L140 encePairwiseOnDemand]: 54/75 looper letters, 610 selfloop transitions, 150 changer transitions 79/843 dead transitions. [2025-03-04 10:10:17,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 843 transitions, 11050 flow [2025-03-04 10:10:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 10:10:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 10:10:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 774 transitions. [2025-03-04 10:10:17,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36857142857142855 [2025-03-04 10:10:17,004 INFO L175 Difference]: Start difference. First operand has 309 places, 557 transitions, 6699 flow. Second operand 28 states and 774 transitions. [2025-03-04 10:10:17,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 843 transitions, 11050 flow [2025-03-04 10:10:20,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 843 transitions, 9866 flow, removed 542 selfloop flow, removed 4 redundant places. [2025-03-04 10:10:20,788 INFO L231 Difference]: Finished difference. Result has 341 places, 602 transitions, 6990 flow [2025-03-04 10:10:20,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=6019, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=6990, PETRI_PLACES=341, PETRI_TRANSITIONS=602} [2025-03-04 10:10:20,789 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 261 predicate places. [2025-03-04 10:10:20,789 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 602 transitions, 6990 flow [2025-03-04 10:10:20,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.928571428571427) internal successors, (307), 14 states have internal predecessors, (307), 0 states have call successors, (0), 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:10:20,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:20,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:20,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:10:20,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 10:10:20,990 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:10:20,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:20,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1805946586, now seen corresponding path program 8 times [2025-03-04 10:10:20,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:20,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018898206] [2025-03-04 10:10:20,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:20,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:20,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-04 10:10:20,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-03-04 10:10:20,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:20,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:10:21,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:21,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018898206] [2025-03-04 10:10:21,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018898206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:21,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:21,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 10:10:21,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220381442] [2025-03-04 10:10:21,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:21,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:10:21,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:21,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:10:21,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:10:21,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-04 10:10:21,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 602 transitions, 6990 flow. Second operand has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 0 states have call successors, (0), 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:10:21,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:21,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-04 10:10:21,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:27,635 INFO L124 PetriNetUnfolderBase]: 23350/35837 cut-off events. [2025-03-04 10:10:27,635 INFO L125 PetriNetUnfolderBase]: For 261181/261181 co-relation queries the response was YES. [2025-03-04 10:10:28,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179640 conditions, 35837 events. 23350/35837 cut-off events. For 261181/261181 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 250410 event pairs, 6430 based on Foata normal form. 2/35817 useless extension candidates. Maximal degree in co-relation 179518. Up to 26855 conditions per place. [2025-03-04 10:10:28,295 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 719 selfloop transitions, 158 changer transitions 66/947 dead transitions. [2025-03-04 10:10:28,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 947 transitions, 11922 flow [2025-03-04 10:10:28,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 10:10:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-04 10:10:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 887 transitions. [2025-03-04 10:10:28,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3695833333333333 [2025-03-04 10:10:28,297 INFO L175 Difference]: Start difference. First operand has 341 places, 602 transitions, 6990 flow. Second operand 32 states and 887 transitions. [2025-03-04 10:10:28,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 947 transitions, 11922 flow [2025-03-04 10:10:31,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 947 transitions, 11658 flow, removed 59 selfloop flow, removed 19 redundant places. [2025-03-04 10:10:31,776 INFO L231 Difference]: Finished difference. Result has 367 places, 686 transitions, 8502 flow [2025-03-04 10:10:31,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=6776, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=8502, PETRI_PLACES=367, PETRI_TRANSITIONS=686} [2025-03-04 10:10:31,777 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 287 predicate places. [2025-03-04 10:10:31,777 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 686 transitions, 8502 flow [2025-03-04 10:10:31,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 0 states have call successors, (0), 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:10:31,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:31,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:31,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 10:10:31,778 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-04 10:10:31,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:31,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2020466418, now seen corresponding path program 9 times [2025-03-04 10:10:31,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:31,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718285550] [2025-03-04 10:10:31,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:10:31,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:31,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 3 equivalence classes. [2025-03-04 10:10:31,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-03-04 10:10:31,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:10:31,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:10:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718285550] [2025-03-04 10:10:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718285550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:31,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:31,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 10:10:31,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596954943] [2025-03-04 10:10:31,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:31,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:10:31,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:31,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:10:31,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:10:32,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-04 10:10:32,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 686 transitions, 8502 flow. Second operand has 11 states, 11 states have (on average 23.0) internal successors, (253), 11 states have internal predecessors, (253), 0 states have call successors, (0), 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:10:32,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:32,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-04 10:10:32,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand