./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-word-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/chl-word-subst.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 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:21:14,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:21:14,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:21:14,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:21:14,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:21:14,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:21:14,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:21:14,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:21:14,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:21:14,436 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:21:14,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:21:14,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:21:14,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:21:14,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:21:14,436 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:21:14,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:21:14,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:21:14,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:21:14,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:21:14,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:21:14,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:21:14,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:21:14,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:21:14,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:21:14,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:21:14,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:21:14,441 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 -> 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 [2025-03-09 01:21:14,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:21:14,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:21:14,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:21:14,676 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:21:14,676 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:21:14,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2025-03-09 01:21:15,834 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ceb87df/db725f6f4cea419aabaa6b5e3f95419e/FLAGfdb6126c9 [2025-03-09 01:21:16,111 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:21:16,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2025-03-09 01:21:16,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ceb87df/db725f6f4cea419aabaa6b5e3f95419e/FLAGfdb6126c9 [2025-03-09 01:21:16,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ceb87df/db725f6f4cea419aabaa6b5e3f95419e [2025-03-09 01:21:16,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:21:16,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:21:16,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:21:16,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:21:16,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:21:16,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0bd2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16, skipping insertion in model container [2025-03-09 01:21:16,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:21:16,576 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-09 01:21:16,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:21:16,589 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:21:16,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:21:16,631 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:21:16,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16 WrapperNode [2025-03-09 01:21:16,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:21:16,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:21:16,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:21:16,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:21:16,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,671 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 162 [2025-03-09 01:21:16,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:21:16,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:21:16,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:21:16,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:21:16,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,701 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-09 01:21:16,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:21:16,715 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:21:16,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:21:16,715 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:21:16,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16" (1/1) ... [2025-03-09 01:21:16,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:21:16,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:16,744 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-09 01:21:16,746 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-09 01:21:16,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:21:16,761 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:21:16,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:21:16,761 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:21:16,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:21:16,761 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:21:16,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:21:16,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:21:16,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:21:16,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:21:16,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:21:16,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:21:16,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:21:16,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:21:16,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:21:16,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:21:16,762 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:21:16,840 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:21:16,842 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:21:17,220 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:21:17,220 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:21:17,426 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:21:17,427 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:21:17,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:21:17 BoogieIcfgContainer [2025-03-09 01:21:17,427 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:21:17,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:21:17,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:21:17,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:21:17,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:21:16" (1/3) ... [2025-03-09 01:21:17,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4d5a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:21:17, skipping insertion in model container [2025-03-09 01:21:17,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:16" (2/3) ... [2025-03-09 01:21:17,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4d5a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:21:17, skipping insertion in model container [2025-03-09 01:21:17,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:21:17" (3/3) ... [2025-03-09 01:21:17,435 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2025-03-09 01:21:17,447 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:21:17,449 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-subst.wvr.c that has 4 procedures, 85 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-03-09 01:21:17,449 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:21:17,534 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:21:17,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 96 transitions, 213 flow [2025-03-09 01:21:17,604 INFO L124 PetriNetUnfolderBase]: 12/93 cut-off events. [2025-03-09 01:21:17,606 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:21:17,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 93 events. 12/93 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 305 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-03-09 01:21:17,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 96 transitions, 213 flow [2025-03-09 01:21:17,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 92 transitions, 202 flow [2025-03-09 01:21:17,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:21:17,633 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;@5755d1cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:21:17,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-09 01:21:17,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:21:17,637 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:21:17,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:21:17,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:17,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:21:17,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:17,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash 684397, now seen corresponding path program 1 times [2025-03-09 01:21:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:17,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157625114] [2025-03-09 01:21:17,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:17,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:21:17,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:21:17,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:17,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:17,845 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-09 01:21:17,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:17,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157625114] [2025-03-09 01:21:17,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157625114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:17,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:17,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:21:17,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713999159] [2025-03-09 01:21:17,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:17,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:21:17,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:17,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:21:17,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:21:17,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-09 01:21:17,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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-09 01:21:17,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:17,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-09 01:21:17,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:18,399 INFO L124 PetriNetUnfolderBase]: 2426/4409 cut-off events. [2025-03-09 01:21:18,400 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2025-03-09 01:21:18,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7761 conditions, 4409 events. 2426/4409 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 29847 event pairs, 1460 based on Foata normal form. 1/2907 useless extension candidates. Maximal degree in co-relation 7303. Up to 3188 conditions per place. [2025-03-09 01:21:18,435 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 42 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2025-03-09 01:21:18,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 280 flow [2025-03-09 01:21:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:21:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:21:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-03-09 01:21:18,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-09 01:21:18,451 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 202 flow. Second operand 3 states and 189 transitions. [2025-03-09 01:21:18,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 87 transitions, 280 flow [2025-03-09 01:21:18,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 87 transitions, 268 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:21:18,463 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 184 flow [2025-03-09 01:21:18,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2025-03-09 01:21:18,467 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -9 predicate places. [2025-03-09 01:21:18,468 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 184 flow [2025-03-09 01:21:18,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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-09 01:21:18,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:18,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:21:18,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:21:18,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:18,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash 684398, now seen corresponding path program 1 times [2025-03-09 01:21:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:18,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360225484] [2025-03-09 01:21:18,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:18,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:21:18,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:21:18,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:18,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:18,758 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-09 01:21:18,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:18,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360225484] [2025-03-09 01:21:18,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360225484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:18,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:18,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:21:18,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092370871] [2025-03-09 01:21:18,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:18,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:21:18,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:18,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:21:18,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:21:18,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-09 01:21:18,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:18,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:18,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-09 01:21:18,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:19,229 INFO L124 PetriNetUnfolderBase]: 2427/4412 cut-off events. [2025-03-09 01:21:19,230 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-09 01:21:19,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 4412 events. 2427/4412 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 29884 event pairs, 1460 based on Foata normal form. 0/2906 useless extension candidates. Maximal degree in co-relation 7632. Up to 3201 conditions per place. [2025-03-09 01:21:19,254 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 46 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2025-03-09 01:21:19,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 90 transitions, 290 flow [2025-03-09 01:21:19,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:21:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:21:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-09 01:21:19,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6223958333333334 [2025-03-09 01:21:19,256 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 184 flow. Second operand 4 states and 239 transitions. [2025-03-09 01:21:19,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 90 transitions, 290 flow [2025-03-09 01:21:19,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 90 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:19,260 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 207 flow [2025-03-09 01:21:19,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2025-03-09 01:21:19,260 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -6 predicate places. [2025-03-09 01:21:19,260 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 207 flow [2025-03-09 01:21:19,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:19,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:19,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:21:19,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:21:19,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:19,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:19,261 INFO L85 PathProgramCache]: Analyzing trace with hash 21218353, now seen corresponding path program 1 times [2025-03-09 01:21:19,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:19,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717543048] [2025-03-09 01:21:19,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:19,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:19,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:21:19,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:21:19,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:19,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:19,499 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-09 01:21:19,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:19,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717543048] [2025-03-09 01:21:19,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717543048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:19,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:19,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:19,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457411138] [2025-03-09 01:21:19,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:19,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:19,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:19,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:19,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:19,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-09 01:21:19,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 90 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 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-09 01:21:19,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:19,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-09 01:21:19,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:20,020 INFO L124 PetriNetUnfolderBase]: 2428/4415 cut-off events. [2025-03-09 01:21:20,021 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-09 01:21:20,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7686 conditions, 4415 events. 2428/4415 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 29880 event pairs, 1460 based on Foata normal form. 0/2908 useless extension candidates. Maximal degree in co-relation 7661. Up to 3200 conditions per place. [2025-03-09 01:21:20,046 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 46 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2025-03-09 01:21:20,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 93 transitions, 319 flow [2025-03-09 01:21:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2025-03-09 01:21:20,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020833333333333 [2025-03-09 01:21:20,052 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 207 flow. Second operand 5 states and 289 transitions. [2025-03-09 01:21:20,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 93 transitions, 319 flow [2025-03-09 01:21:20,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 93 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:21:20,054 INFO L231 Difference]: Finished difference. Result has 89 places, 93 transitions, 241 flow [2025-03-09 01:21:20,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=89, PETRI_TRANSITIONS=93} [2025-03-09 01:21:20,055 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -1 predicate places. [2025-03-09 01:21:20,055 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 93 transitions, 241 flow [2025-03-09 01:21:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 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-09 01:21:20,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:20,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:21:20,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:21:20,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:20,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash 657770871, now seen corresponding path program 1 times [2025-03-09 01:21:20,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:20,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787351046] [2025-03-09 01:21:20,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:20,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:20,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:21:20,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:21:20,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:20,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:20,246 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-09 01:21:20,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:20,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787351046] [2025-03-09 01:21:20,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787351046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:20,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:20,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:20,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227625315] [2025-03-09 01:21:20,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:20,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:20,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:20,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:20,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:20,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-09 01:21:20,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 93 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 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-09 01:21:20,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:20,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-09 01:21:20,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:20,742 INFO L124 PetriNetUnfolderBase]: 2429/4418 cut-off events. [2025-03-09 01:21:20,742 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-09 01:21:20,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7708 conditions, 4418 events. 2429/4418 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29914 event pairs, 1460 based on Foata normal form. 0/2912 useless extension candidates. Maximal degree in co-relation 7677. Up to 3203 conditions per place. [2025-03-09 01:21:20,762 INFO L140 encePairwiseOnDemand]: 87/96 looper letters, 47 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2025-03-09 01:21:20,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 96 transitions, 359 flow [2025-03-09 01:21:20,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2025-03-09 01:21:20,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020833333333333 [2025-03-09 01:21:20,764 INFO L175 Difference]: Start difference. First operand has 89 places, 93 transitions, 241 flow. Second operand 5 states and 289 transitions. [2025-03-09 01:21:20,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 96 transitions, 359 flow [2025-03-09 01:21:20,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:21:20,766 INFO L231 Difference]: Finished difference. Result has 94 places, 96 transitions, 283 flow [2025-03-09 01:21:20,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=94, PETRI_TRANSITIONS=96} [2025-03-09 01:21:20,766 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2025-03-09 01:21:20,767 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 96 transitions, 283 flow [2025-03-09 01:21:20,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 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-09 01:21:20,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:20,767 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:21:20,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:21:20,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:20,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:20,768 INFO L85 PathProgramCache]: Analyzing trace with hash 657726825, now seen corresponding path program 1 times [2025-03-09 01:21:20,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:20,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607765473] [2025-03-09 01:21:20,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:20,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:20,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:21:20,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:21:20,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:20,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:20,942 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-09 01:21:20,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:20,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607765473] [2025-03-09 01:21:20,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607765473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:20,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121025758] [2025-03-09 01:21:20,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:20,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:20,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:20,945 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-09 01:21:20,947 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-09 01:21:20,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:21:21,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:21:21,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:21,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:21,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:21:21,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:21,058 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-09 01:21:21,223 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-09 01:21:21,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:21,298 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-09 01:21:21,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121025758] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:21,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:21,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:21:21,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817143321] [2025-03-09 01:21:21,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:21,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:21:21,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:21,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:21:21,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:21:21,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-09 01:21:21,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 96 transitions, 283 flow. Second operand has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 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-09 01:21:21,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:21,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-09 01:21:21,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:22,211 INFO L124 PetriNetUnfolderBase]: 2430/4420 cut-off events. [2025-03-09 01:21:22,212 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-09 01:21:22,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7736 conditions, 4420 events. 2430/4420 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29890 event pairs, 1460 based on Foata normal form. 0/2917 useless extension candidates. Maximal degree in co-relation 7692. Up to 3204 conditions per place. [2025-03-09 01:21:22,249 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 48 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2025-03-09 01:21:22,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 410 flow [2025-03-09 01:21:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:21:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:21:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 430 transitions. [2025-03-09 01:21:22,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5598958333333334 [2025-03-09 01:21:22,253 INFO L175 Difference]: Start difference. First operand has 94 places, 96 transitions, 283 flow. Second operand 8 states and 430 transitions. [2025-03-09 01:21:22,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 98 transitions, 410 flow [2025-03-09 01:21:22,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 98 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:22,257 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 307 flow [2025-03-09 01:21:22,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=307, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2025-03-09 01:21:22,258 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 8 predicate places. [2025-03-09 01:21:22,260 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 307 flow [2025-03-09 01:21:22,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 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-09 01:21:22,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:22,260 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 01:21:22,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:22,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:22,465 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:22,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:22,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1083978632, now seen corresponding path program 1 times [2025-03-09 01:21:22,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:22,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709635022] [2025-03-09 01:21:22,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:22,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:22,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:21:22,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:21:22,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:22,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:22,633 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-09 01:21:22,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709635022] [2025-03-09 01:21:22,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709635022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090055265] [2025-03-09 01:21:22,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:22,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:22,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:22,636 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-09 01:21:22,637 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-09 01:21:22,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:21:22,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:21:22,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:22,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:22,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:21:22,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:22,707 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-09 01:21:22,814 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-09 01:21:22,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:22,906 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-09 01:21:22,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090055265] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:22,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:22,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:21:22,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848086701] [2025-03-09 01:21:22,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:22,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:21:22,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:22,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:21:22,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:21:23,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-09 01:21:23,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 307 flow. Second operand has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 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-09 01:21:23,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:23,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-09 01:21:23,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:24,381 INFO L124 PetriNetUnfolderBase]: 2431/4422 cut-off events. [2025-03-09 01:21:24,381 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-09 01:21:24,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7749 conditions, 4422 events. 2431/4422 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29922 event pairs, 1460 based on Foata normal form. 0/2920 useless extension candidates. Maximal degree in co-relation 7698. Up to 3196 conditions per place. [2025-03-09 01:21:24,398 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 42 selfloop transitions, 18 changer transitions 0/100 dead transitions. [2025-03-09 01:21:24,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 100 transitions, 437 flow [2025-03-09 01:21:24,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:21:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:21:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 482 transitions. [2025-03-09 01:21:24,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5578703703703703 [2025-03-09 01:21:24,400 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 307 flow. Second operand 9 states and 482 transitions. [2025-03-09 01:21:24,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 100 transitions, 437 flow [2025-03-09 01:21:24,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 100 transitions, 390 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-09 01:21:24,403 INFO L231 Difference]: Finished difference. Result has 97 places, 100 transitions, 306 flow [2025-03-09 01:21:24,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=306, PETRI_PLACES=97, PETRI_TRANSITIONS=100} [2025-03-09 01:21:24,403 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2025-03-09 01:21:24,403 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 100 transitions, 306 flow [2025-03-09 01:21:24,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 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-09 01:21:24,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:24,404 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 01:21:24,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:24,606 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-09 01:21:24,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:24,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:24,607 INFO L85 PathProgramCache]: Analyzing trace with hash 757635667, now seen corresponding path program 1 times [2025-03-09 01:21:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:24,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143459706] [2025-03-09 01:21:24,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:24,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:21:24,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:21:24,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:24,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:24,780 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-09 01:21:24,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143459706] [2025-03-09 01:21:24,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143459706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796937140] [2025-03-09 01:21:24,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:24,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:24,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:24,784 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-09 01:21:24,786 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-09 01:21:24,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:21:24,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:21:24,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:24,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:24,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:21:24,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:24,858 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-09 01:21:25,000 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-09 01:21:25,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:25,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796937140] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:25,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:25,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:21:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613794392] [2025-03-09 01:21:25,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:25,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:21:25,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:25,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:21:25,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:21:25,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-09 01:21:25,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 100 transitions, 306 flow. Second operand has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 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-09 01:21:25,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:25,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-09 01:21:25,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:26,106 INFO L124 PetriNetUnfolderBase]: 2431/4421 cut-off events. [2025-03-09 01:21:26,106 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-09 01:21:26,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7738 conditions, 4421 events. 2431/4421 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29909 event pairs, 1460 based on Foata normal form. 0/2920 useless extension candidates. Maximal degree in co-relation 7683. Up to 3197 conditions per place. [2025-03-09 01:21:26,130 INFO L140 encePairwiseOnDemand]: 87/96 looper letters, 40 selfloop transitions, 19 changer transitions 0/99 dead transitions. [2025-03-09 01:21:26,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 99 transitions, 420 flow [2025-03-09 01:21:26,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:21:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:21:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 380 transitions. [2025-03-09 01:21:26,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5654761904761905 [2025-03-09 01:21:26,135 INFO L175 Difference]: Start difference. First operand has 97 places, 100 transitions, 306 flow. Second operand 7 states and 380 transitions. [2025-03-09 01:21:26,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 99 transitions, 420 flow [2025-03-09 01:21:26,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 99 transitions, 387 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-09 01:21:26,138 INFO L231 Difference]: Finished difference. Result has 97 places, 99 transitions, 307 flow [2025-03-09 01:21:26,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=307, PETRI_PLACES=97, PETRI_TRANSITIONS=99} [2025-03-09 01:21:26,139 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2025-03-09 01:21:26,140 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 99 transitions, 307 flow [2025-03-09 01:21:26,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 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-09 01:21:26,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:26,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:26,147 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-09 01:21:26,341 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-09 01:21:26,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:26,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1943159689, now seen corresponding path program 1 times [2025-03-09 01:21:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:26,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649346043] [2025-03-09 01:21:26,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:26,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:21:26,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:21:26,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:26,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:26,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:26,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649346043] [2025-03-09 01:21:26,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649346043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:26,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:26,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:21:26,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539830292] [2025-03-09 01:21:26,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:26,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:26,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:26,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:26,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-09 01:21:26,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 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-09 01:21:26,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:26,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-09 01:21:26,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:26,906 INFO L124 PetriNetUnfolderBase]: 4329/8282 cut-off events. [2025-03-09 01:21:26,907 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-09 01:21:26,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14232 conditions, 8282 events. 4329/8282 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 64771 event pairs, 2464 based on Foata normal form. 114/5643 useless extension candidates. Maximal degree in co-relation 8793. Up to 3546 conditions per place. [2025-03-09 01:21:26,940 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 122 selfloop transitions, 5 changer transitions 0/166 dead transitions. [2025-03-09 01:21:26,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 166 transitions, 759 flow [2025-03-09 01:21:26,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 352 transitions. [2025-03-09 01:21:26,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-09 01:21:26,942 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 307 flow. Second operand 5 states and 352 transitions. [2025-03-09 01:21:26,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 166 transitions, 759 flow [2025-03-09 01:21:26,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 166 transitions, 695 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-09 01:21:26,945 INFO L231 Difference]: Finished difference. Result has 97 places, 101 transitions, 293 flow [2025-03-09 01:21:26,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=97, PETRI_TRANSITIONS=101} [2025-03-09 01:21:26,946 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2025-03-09 01:21:26,947 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 101 transitions, 293 flow [2025-03-09 01:21:26,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 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-09 01:21:26,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:26,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:26,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:21:26,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:26,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash 308707954, now seen corresponding path program 1 times [2025-03-09 01:21:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:26,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339819649] [2025-03-09 01:21:26,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:26,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:21:26,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:21:26,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:26,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:27,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:27,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339819649] [2025-03-09 01:21:27,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339819649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:27,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:27,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:21:27,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758889544] [2025-03-09 01:21:27,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:27,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:27,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:27,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:27,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:27,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-09 01:21:27,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 101 transitions, 293 flow. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:27,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:27,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-09 01:21:27,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:27,410 INFO L124 PetriNetUnfolderBase]: 3785/7388 cut-off events. [2025-03-09 01:21:27,411 INFO L125 PetriNetUnfolderBase]: For 746/852 co-relation queries the response was YES. [2025-03-09 01:21:27,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13265 conditions, 7388 events. 3785/7388 cut-off events. For 746/852 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 57419 event pairs, 2236 based on Foata normal form. 87/5228 useless extension candidates. Maximal degree in co-relation 9299. Up to 3583 conditions per place. [2025-03-09 01:21:27,439 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 115 selfloop transitions, 5 changer transitions 0/159 dead transitions. [2025-03-09 01:21:27,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 159 transitions, 696 flow [2025-03-09 01:21:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2025-03-09 01:21:27,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-09 01:21:27,441 INFO L175 Difference]: Start difference. First operand has 97 places, 101 transitions, 293 flow. Second operand 5 states and 345 transitions. [2025-03-09 01:21:27,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 159 transitions, 696 flow [2025-03-09 01:21:27,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 159 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:27,446 INFO L231 Difference]: Finished difference. Result has 101 places, 103 transitions, 313 flow [2025-03-09 01:21:27,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=101, PETRI_TRANSITIONS=103} [2025-03-09 01:21:27,446 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 11 predicate places. [2025-03-09 01:21:27,446 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 103 transitions, 313 flow [2025-03-09 01:21:27,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:27,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:27,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:27,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:21:27,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:27,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1746452430, now seen corresponding path program 1 times [2025-03-09 01:21:27,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:27,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117223404] [2025-03-09 01:21:27,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:27,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:21:27,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:21:27,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:27,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:27,498 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-09 01:21:27,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:27,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117223404] [2025-03-09 01:21:27,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117223404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:27,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:27,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:21:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144946174] [2025-03-09 01:21:27,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:27,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:27,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:27,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:27,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:27,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-09 01:21:27,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 103 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:27,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:27,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-09 01:21:27,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:28,234 INFO L124 PetriNetUnfolderBase]: 6247/13201 cut-off events. [2025-03-09 01:21:28,235 INFO L125 PetriNetUnfolderBase]: For 2880/2941 co-relation queries the response was YES. [2025-03-09 01:21:28,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24309 conditions, 13201 events. 6247/13201 cut-off events. For 2880/2941 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 120704 event pairs, 3588 based on Foata normal form. 114/9498 useless extension candidates. Maximal degree in co-relation 17402. Up to 4821 conditions per place. [2025-03-09 01:21:28,282 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 117 selfloop transitions, 11 changer transitions 0/167 dead transitions. [2025-03-09 01:21:28,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 167 transitions, 751 flow [2025-03-09 01:21:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:21:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:21:28,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 401 transitions. [2025-03-09 01:21:28,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6961805555555556 [2025-03-09 01:21:28,284 INFO L175 Difference]: Start difference. First operand has 101 places, 103 transitions, 313 flow. Second operand 6 states and 401 transitions. [2025-03-09 01:21:28,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 167 transitions, 751 flow [2025-03-09 01:21:28,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 167 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:28,291 INFO L231 Difference]: Finished difference. Result has 107 places, 109 transitions, 384 flow [2025-03-09 01:21:28,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=107, PETRI_TRANSITIONS=109} [2025-03-09 01:21:28,292 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 17 predicate places. [2025-03-09 01:21:28,292 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 109 transitions, 384 flow [2025-03-09 01:21:28,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:28,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:28,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:28,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:21:28,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:28,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:28,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1561343838, now seen corresponding path program 1 times [2025-03-09 01:21:28,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:28,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697020228] [2025-03-09 01:21:28,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:28,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:28,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:21:28,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:21:28,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:28,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:21:28,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:28,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697020228] [2025-03-09 01:21:28,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697020228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:28,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:28,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:21:28,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190208584] [2025-03-09 01:21:28,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:28,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:28,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:28,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:28,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:28,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-09 01:21:28,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 109 transitions, 384 flow. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 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-09 01:21:28,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:28,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-09 01:21:28,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:28,922 INFO L124 PetriNetUnfolderBase]: 5778/10951 cut-off events. [2025-03-09 01:21:28,922 INFO L125 PetriNetUnfolderBase]: For 5356/5615 co-relation queries the response was YES. [2025-03-09 01:21:28,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22422 conditions, 10951 events. 5778/10951 cut-off events. For 5356/5615 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 87037 event pairs, 3566 based on Foata normal form. 134/8516 useless extension candidates. Maximal degree in co-relation 16074. Up to 5187 conditions per place. [2025-03-09 01:21:28,969 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 113 selfloop transitions, 9 changer transitions 0/161 dead transitions. [2025-03-09 01:21:28,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 161 transitions, 799 flow [2025-03-09 01:21:28,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:21:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:21:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 393 transitions. [2025-03-09 01:21:28,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2025-03-09 01:21:28,971 INFO L175 Difference]: Start difference. First operand has 107 places, 109 transitions, 384 flow. Second operand 6 states and 393 transitions. [2025-03-09 01:21:28,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 161 transitions, 799 flow [2025-03-09 01:21:28,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 161 transitions, 795 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:21:28,981 INFO L231 Difference]: Finished difference. Result has 113 places, 111 transitions, 414 flow [2025-03-09 01:21:28,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=113, PETRI_TRANSITIONS=111} [2025-03-09 01:21:28,981 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 23 predicate places. [2025-03-09 01:21:28,981 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 111 transitions, 414 flow [2025-03-09 01:21:28,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 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-09 01:21:28,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:28,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:28,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:21:28,982 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:28,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:28,982 INFO L85 PathProgramCache]: Analyzing trace with hash -983414389, now seen corresponding path program 1 times [2025-03-09 01:21:28,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:28,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716961741] [2025-03-09 01:21:28,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:28,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:28,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:21:28,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:21:28,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:28,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:21:29,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:29,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716961741] [2025-03-09 01:21:29,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716961741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:29,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683615827] [2025-03-09 01:21:29,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:29,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:29,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:29,244 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-09 01:21:29,246 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-09 01:21:29,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:21:29,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:21:29,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:29,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:29,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:21:29,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:29,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:21:29,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:29,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:21:29,373 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 01:21:29,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 01:21:29,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:29,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:21:29,416 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:21:29,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:21:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:21:29,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:29,620 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 162 treesize of output 156 [2025-03-09 01:21:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:21:29,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683615827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:29,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:29,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-09 01:21:29,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258131400] [2025-03-09 01:21:29,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:29,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:21:29,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:29,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:21:29,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:21:30,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 96 [2025-03-09 01:21:30,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 111 transitions, 414 flow. Second operand has 16 states, 16 states have (on average 39.0625) internal successors, (625), 16 states have internal predecessors, (625), 0 states have call successors, (0), 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-09 01:21:30,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:30,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 96 [2025-03-09 01:21:30,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:32,143 INFO L124 PetriNetUnfolderBase]: 9755/17214 cut-off events. [2025-03-09 01:21:32,144 INFO L125 PetriNetUnfolderBase]: For 8051/8719 co-relation queries the response was YES. [2025-03-09 01:21:32,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36731 conditions, 17214 events. 9755/17214 cut-off events. For 8051/8719 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 131357 event pairs, 3959 based on Foata normal form. 0/14115 useless extension candidates. Maximal degree in co-relation 25238. Up to 5442 conditions per place. [2025-03-09 01:21:32,220 INFO L140 encePairwiseOnDemand]: 79/96 looper letters, 146 selfloop transitions, 28 changer transitions 0/204 dead transitions. [2025-03-09 01:21:32,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 204 transitions, 1062 flow [2025-03-09 01:21:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:21:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:21:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 497 transitions. [2025-03-09 01:21:32,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5752314814814815 [2025-03-09 01:21:32,223 INFO L175 Difference]: Start difference. First operand has 113 places, 111 transitions, 414 flow. Second operand 9 states and 497 transitions. [2025-03-09 01:21:32,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 204 transitions, 1062 flow [2025-03-09 01:21:32,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 204 transitions, 1044 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:21:32,240 INFO L231 Difference]: Finished difference. Result has 115 places, 118 transitions, 534 flow [2025-03-09 01:21:32,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=534, PETRI_PLACES=115, PETRI_TRANSITIONS=118} [2025-03-09 01:21:32,242 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 25 predicate places. [2025-03-09 01:21:32,242 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 118 transitions, 534 flow [2025-03-09 01:21:32,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 39.0625) internal successors, (625), 16 states have internal predecessors, (625), 0 states have call successors, (0), 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-09 01:21:32,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:32,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:32,253 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-09 01:21:32,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:32,444 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:32,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash 365822830, now seen corresponding path program 1 times [2025-03-09 01:21:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:32,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924002865] [2025-03-09 01:21:32,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:32,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:32,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:21:32,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:21:32,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:32,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:32,505 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-09 01:21:32,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:32,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924002865] [2025-03-09 01:21:32,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924002865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:32,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:32,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:21:32,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668154610] [2025-03-09 01:21:32,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:32,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:32,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:32,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:32,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:32,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-09 01:21:32,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 118 transitions, 534 flow. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 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-09 01:21:32,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:32,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-09 01:21:32,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:33,676 INFO L124 PetriNetUnfolderBase]: 11840/23482 cut-off events. [2025-03-09 01:21:33,677 INFO L125 PetriNetUnfolderBase]: For 22763/23364 co-relation queries the response was YES. [2025-03-09 01:21:33,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52223 conditions, 23482 events. 11840/23482 cut-off events. For 22763/23364 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 212788 event pairs, 7091 based on Foata normal form. 288/19444 useless extension candidates. Maximal degree in co-relation 37246. Up to 9318 conditions per place. [2025-03-09 01:21:33,780 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 141 selfloop transitions, 17 changer transitions 0/193 dead transitions. [2025-03-09 01:21:33,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 193 transitions, 1212 flow [2025-03-09 01:21:33,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2025-03-09 01:21:33,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-09 01:21:33,781 INFO L175 Difference]: Start difference. First operand has 115 places, 118 transitions, 534 flow. Second operand 5 states and 345 transitions. [2025-03-09 01:21:33,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 193 transitions, 1212 flow [2025-03-09 01:21:33,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 193 transitions, 1171 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:33,806 INFO L231 Difference]: Finished difference. Result has 119 places, 122 transitions, 593 flow [2025-03-09 01:21:33,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=593, PETRI_PLACES=119, PETRI_TRANSITIONS=122} [2025-03-09 01:21:33,807 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 29 predicate places. [2025-03-09 01:21:33,807 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 122 transitions, 593 flow [2025-03-09 01:21:33,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 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-09 01:21:33,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:33,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:33,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:21:33,807 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:33,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:33,808 INFO L85 PathProgramCache]: Analyzing trace with hash -421074354, now seen corresponding path program 1 times [2025-03-09 01:21:33,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:33,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667552630] [2025-03-09 01:21:33,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:33,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:33,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:21:33,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:21:33,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:33,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:21:33,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:33,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667552630] [2025-03-09 01:21:33,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667552630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:33,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:33,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:33,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711622316] [2025-03-09 01:21:33,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:33,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:21:33,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:33,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:21:33,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:21:33,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 96 [2025-03-09 01:21:33,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 122 transitions, 593 flow. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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-09 01:21:33,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:33,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 96 [2025-03-09 01:21:33,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:35,342 INFO L124 PetriNetUnfolderBase]: 14711/26285 cut-off events. [2025-03-09 01:21:35,342 INFO L125 PetriNetUnfolderBase]: For 28033/28978 co-relation queries the response was YES. [2025-03-09 01:21:35,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62726 conditions, 26285 events. 14711/26285 cut-off events. For 28033/28978 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 215131 event pairs, 10053 based on Foata normal form. 42/23695 useless extension candidates. Maximal degree in co-relation 45692. Up to 19957 conditions per place. [2025-03-09 01:21:35,516 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 77 selfloop transitions, 12 changer transitions 0/118 dead transitions. [2025-03-09 01:21:35,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 118 transitions, 763 flow [2025-03-09 01:21:35,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:35,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2025-03-09 01:21:35,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5229166666666667 [2025-03-09 01:21:35,518 INFO L175 Difference]: Start difference. First operand has 119 places, 122 transitions, 593 flow. Second operand 5 states and 251 transitions. [2025-03-09 01:21:35,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 118 transitions, 763 flow [2025-03-09 01:21:35,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 754 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:21:35,560 INFO L231 Difference]: Finished difference. Result has 118 places, 118 transitions, 600 flow [2025-03-09 01:21:35,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=600, PETRI_PLACES=118, PETRI_TRANSITIONS=118} [2025-03-09 01:21:35,561 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 28 predicate places. [2025-03-09 01:21:35,561 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 118 transitions, 600 flow [2025-03-09 01:21:35,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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-09 01:21:35,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:35,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:35,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:21:35,561 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:35,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash -421074353, now seen corresponding path program 1 times [2025-03-09 01:21:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:35,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352761118] [2025-03-09 01:21:35,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:35,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:21:35,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:21:35,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:35,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:21:35,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:35,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352761118] [2025-03-09 01:21:35,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352761118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:35,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532952764] [2025-03-09 01:21:35,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:35,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:35,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:35,730 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-09 01:21:35,732 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-09 01:21:35,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:21:35,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:21:35,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:35,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:35,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:21:35,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:35,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:21:35,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:35,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:21:35,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:21:35,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:21:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:21:35,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:36,003 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 52 treesize of output 48 [2025-03-09 01:21:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:21:36,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532952764] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:36,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:36,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 01:21:36,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422695208] [2025-03-09 01:21:36,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:36,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:21:36,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:36,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:21:36,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:21:36,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 96 [2025-03-09 01:21:36,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 118 transitions, 600 flow. Second operand has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 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-09 01:21:36,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:36,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 96 [2025-03-09 01:21:36,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:38,179 INFO L124 PetriNetUnfolderBase]: 12804/22417 cut-off events. [2025-03-09 01:21:38,179 INFO L125 PetriNetUnfolderBase]: For 23974/24792 co-relation queries the response was YES. [2025-03-09 01:21:38,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53834 conditions, 22417 events. 12804/22417 cut-off events. For 23974/24792 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 177168 event pairs, 5876 based on Foata normal form. 94/19873 useless extension candidates. Maximal degree in co-relation 39010. Up to 7196 conditions per place. [2025-03-09 01:21:38,312 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 146 selfloop transitions, 30 changer transitions 0/205 dead transitions. [2025-03-09 01:21:38,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 205 transitions, 1276 flow [2025-03-09 01:21:38,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:21:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:21:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 536 transitions. [2025-03-09 01:21:38,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2025-03-09 01:21:38,314 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 600 flow. Second operand 9 states and 536 transitions. [2025-03-09 01:21:38,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 205 transitions, 1276 flow [2025-03-09 01:21:38,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 205 transitions, 1256 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:21:38,371 INFO L231 Difference]: Finished difference. Result has 124 places, 120 transitions, 675 flow [2025-03-09 01:21:38,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=675, PETRI_PLACES=124, PETRI_TRANSITIONS=120} [2025-03-09 01:21:38,372 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 34 predicate places. [2025-03-09 01:21:38,372 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 120 transitions, 675 flow [2025-03-09 01:21:38,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 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-09 01:21:38,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:38,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:38,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:21:38,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:21:38,573 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:38,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:38,573 INFO L85 PathProgramCache]: Analyzing trace with hash -726196164, now seen corresponding path program 1 times [2025-03-09 01:21:38,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:38,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378414586] [2025-03-09 01:21:38,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:38,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:38,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:21:38,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:21:38,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:38,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:21:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378414586] [2025-03-09 01:21:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378414586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:38,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:38,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:21:38,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073575389] [2025-03-09 01:21:38,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:38,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:38,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:38,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:38,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:38,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-09 01:21:38,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 120 transitions, 675 flow. Second operand has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 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-09 01:21:38,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:38,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-09 01:21:38,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:39,719 INFO L124 PetriNetUnfolderBase]: 10933/19220 cut-off events. [2025-03-09 01:21:39,719 INFO L125 PetriNetUnfolderBase]: For 32542/33236 co-relation queries the response was YES. [2025-03-09 01:21:39,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50015 conditions, 19220 events. 10933/19220 cut-off events. For 32542/33236 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 146298 event pairs, 6868 based on Foata normal form. 184/17296 useless extension candidates. Maximal degree in co-relation 37243. Up to 9302 conditions per place. [2025-03-09 01:21:39,836 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 136 selfloop transitions, 17 changer transitions 0/184 dead transitions. [2025-03-09 01:21:39,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 184 transitions, 1353 flow [2025-03-09 01:21:39,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 338 transitions. [2025-03-09 01:21:39,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7041666666666667 [2025-03-09 01:21:39,838 INFO L175 Difference]: Start difference. First operand has 124 places, 120 transitions, 675 flow. Second operand 5 states and 338 transitions. [2025-03-09 01:21:39,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 184 transitions, 1353 flow [2025-03-09 01:21:39,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 184 transitions, 1277 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-09 01:21:39,889 INFO L231 Difference]: Finished difference. Result has 124 places, 124 transitions, 695 flow [2025-03-09 01:21:39,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=695, PETRI_PLACES=124, PETRI_TRANSITIONS=124} [2025-03-09 01:21:39,889 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 34 predicate places. [2025-03-09 01:21:39,889 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 124 transitions, 695 flow [2025-03-09 01:21:39,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 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-09 01:21:39,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:39,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:39,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:21:39,890 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:39,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash -475763574, now seen corresponding path program 1 times [2025-03-09 01:21:39,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:39,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469356033] [2025-03-09 01:21:39,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:39,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:39,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:21:39,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:21:39,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:39,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:21:40,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:40,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469356033] [2025-03-09 01:21:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469356033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:40,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380578815] [2025-03-09 01:21:40,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:40,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:40,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:40,164 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-09 01:21:40,166 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-09 01:21:40,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:21:40,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:21:40,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:40,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:40,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:21:40,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:40,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:21:40,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:40,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:21:40,277 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 01:21:40,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 01:21:40,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:40,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:21:40,303 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:21:40,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:21:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:21:40,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:40,496 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 100 treesize of output 96 [2025-03-09 01:21:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:21:40,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380578815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:40,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:40,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-09 01:21:40,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051757672] [2025-03-09 01:21:40,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:40,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:21:40,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:40,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:21:40,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:21:47,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 96 [2025-03-09 01:21:47,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 124 transitions, 695 flow. Second operand has 16 states, 16 states have (on average 37.1875) internal successors, (595), 16 states have internal predecessors, (595), 0 states have call successors, (0), 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-09 01:21:47,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:47,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 96 [2025-03-09 01:21:47,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:49,641 INFO L124 PetriNetUnfolderBase]: 19118/32420 cut-off events. [2025-03-09 01:21:49,641 INFO L125 PetriNetUnfolderBase]: For 53647/55876 co-relation queries the response was YES. [2025-03-09 01:21:49,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83407 conditions, 32420 events. 19118/32420 cut-off events. For 53647/55876 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 251734 event pairs, 7763 based on Foata normal form. 0/28205 useless extension candidates. Maximal degree in co-relation 61041. Up to 10758 conditions per place. [2025-03-09 01:21:49,905 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 178 selfloop transitions, 30 changer transitions 0/233 dead transitions. [2025-03-09 01:21:49,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 233 transitions, 1614 flow [2025-03-09 01:21:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:21:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:21:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 467 transitions. [2025-03-09 01:21:49,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5405092592592593 [2025-03-09 01:21:49,908 INFO L175 Difference]: Start difference. First operand has 124 places, 124 transitions, 695 flow. Second operand 9 states and 467 transitions. [2025-03-09 01:21:49,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 233 transitions, 1614 flow [2025-03-09 01:21:49,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 233 transitions, 1590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:49,979 INFO L231 Difference]: Finished difference. Result has 131 places, 127 transitions, 770 flow [2025-03-09 01:21:49,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=770, PETRI_PLACES=131, PETRI_TRANSITIONS=127} [2025-03-09 01:21:49,979 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 41 predicate places. [2025-03-09 01:21:49,979 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 127 transitions, 770 flow [2025-03-09 01:21:49,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 37.1875) internal successors, (595), 16 states have internal predecessors, (595), 0 states have call successors, (0), 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-09 01:21:49,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:49,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:49,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:21:50,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:21:50,180 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:50,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1863768252, now seen corresponding path program 1 times [2025-03-09 01:21:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:50,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541457235] [2025-03-09 01:21:50,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:50,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:50,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:21:50,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:21:50,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:50,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:21:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541457235] [2025-03-09 01:21:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541457235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:50,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:50,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:50,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198767267] [2025-03-09 01:21:50,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:50,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:21:50,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:50,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:21:50,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:21:50,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 96 [2025-03-09 01:21:50,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 127 transitions, 770 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 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-09 01:21:50,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:50,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 96 [2025-03-09 01:21:50,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:51,928 INFO L124 PetriNetUnfolderBase]: 14918/25805 cut-off events. [2025-03-09 01:21:51,928 INFO L125 PetriNetUnfolderBase]: For 56706/58943 co-relation queries the response was YES. [2025-03-09 01:21:52,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71886 conditions, 25805 events. 14918/25805 cut-off events. For 56706/58943 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 198893 event pairs, 10042 based on Foata normal form. 171/24787 useless extension candidates. Maximal degree in co-relation 51186. Up to 20134 conditions per place. [2025-03-09 01:21:52,101 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 88 selfloop transitions, 9 changer transitions 0/123 dead transitions. [2025-03-09 01:21:52,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 123 transitions, 956 flow [2025-03-09 01:21:52,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:21:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:21:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-03-09 01:21:52,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5572916666666666 [2025-03-09 01:21:52,103 INFO L175 Difference]: Start difference. First operand has 131 places, 127 transitions, 770 flow. Second operand 4 states and 214 transitions. [2025-03-09 01:21:52,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 123 transitions, 956 flow [2025-03-09 01:21:52,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 123 transitions, 903 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-09 01:21:52,156 INFO L231 Difference]: Finished difference. Result has 124 places, 123 transitions, 727 flow [2025-03-09 01:21:52,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=727, PETRI_PLACES=124, PETRI_TRANSITIONS=123} [2025-03-09 01:21:52,157 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 34 predicate places. [2025-03-09 01:21:52,157 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 123 transitions, 727 flow [2025-03-09 01:21:52,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 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-09 01:21:52,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:52,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:52,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:21:52,158 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:52,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:52,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1863768251, now seen corresponding path program 1 times [2025-03-09 01:21:52,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:52,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110081052] [2025-03-09 01:21:52,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:52,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:52,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:21:52,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:21:52,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:52,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:21:52,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:52,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110081052] [2025-03-09 01:21:52,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110081052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:52,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171255923] [2025-03-09 01:21:52,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:52,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:52,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:52,284 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-09 01:21:52,286 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-09 01:21:52,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:21:52,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:21:52,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:52,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:52,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:21:52,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:21:52,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:52,504 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 22 treesize of output 18 [2025-03-09 01:21:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:21:52,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171255923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:52,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:52,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:21:52,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883571533] [2025-03-09 01:21:52,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:52,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:21:52,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:52,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:21:52,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:21:52,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-09 01:21:52,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 123 transitions, 727 flow. Second operand has 11 states, 11 states have (on average 49.36363636363637) internal successors, (543), 11 states have internal predecessors, (543), 0 states have call successors, (0), 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-09 01:21:52,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:52,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-09 01:21:52,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:54,296 INFO L124 PetriNetUnfolderBase]: 14471/24019 cut-off events. [2025-03-09 01:21:54,296 INFO L125 PetriNetUnfolderBase]: For 49322/51210 co-relation queries the response was YES. [2025-03-09 01:21:54,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67234 conditions, 24019 events. 14471/24019 cut-off events. For 49322/51210 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 173739 event pairs, 6530 based on Foata normal form. 175/22837 useless extension candidates. Maximal degree in co-relation 50473. Up to 7714 conditions per place. [2025-03-09 01:21:54,460 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 161 selfloop transitions, 30 changer transitions 0/216 dead transitions. [2025-03-09 01:21:54,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 216 transitions, 1581 flow [2025-03-09 01:21:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:21:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:21:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 461 transitions. [2025-03-09 01:21:54,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6860119047619048 [2025-03-09 01:21:54,461 INFO L175 Difference]: Start difference. First operand has 124 places, 123 transitions, 727 flow. Second operand 7 states and 461 transitions. [2025-03-09 01:21:54,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 216 transitions, 1581 flow [2025-03-09 01:21:54,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 216 transitions, 1571 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:54,533 INFO L231 Difference]: Finished difference. Result has 129 places, 123 transitions, 798 flow [2025-03-09 01:21:54,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=798, PETRI_PLACES=129, PETRI_TRANSITIONS=123} [2025-03-09 01:21:54,534 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 39 predicate places. [2025-03-09 01:21:54,534 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 123 transitions, 798 flow [2025-03-09 01:21:54,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.36363636363637) internal successors, (543), 11 states have internal predecessors, (543), 0 states have call successors, (0), 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-09 01:21:54,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:54,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:54,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:21:54,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:54,735 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:54,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash -399322408, now seen corresponding path program 1 times [2025-03-09 01:21:54,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:54,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342526870] [2025-03-09 01:21:54,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:54,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:21:54,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:21:54,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:54,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:21:54,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:54,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342526870] [2025-03-09 01:21:54,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342526870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:54,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086134098] [2025-03-09 01:21:54,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:54,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:54,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:54,866 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-09 01:21:54,869 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-09 01:21:54,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:21:54,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:21:54,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:54,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:54,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:21:54,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:54,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:21:54,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:54,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:21:55,003 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:21:55,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:21:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:21:55,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:55,152 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 52 treesize of output 48 [2025-03-09 01:21:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:21:55,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086134098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:55,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:55,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 01:21:55,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943440262] [2025-03-09 01:21:55,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:55,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:21:55,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:55,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:21:55,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:21:55,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 96 [2025-03-09 01:21:55,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 123 transitions, 798 flow. Second operand has 13 states, 13 states have (on average 45.84615384615385) internal successors, (596), 13 states have internal predecessors, (596), 0 states have call successors, (0), 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-09 01:21:55,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:55,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 96 [2025-03-09 01:21:55,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:58,070 INFO L124 PetriNetUnfolderBase]: 19502/31391 cut-off events. [2025-03-09 01:21:58,071 INFO L125 PetriNetUnfolderBase]: For 90883/95482 co-relation queries the response was YES. [2025-03-09 01:21:58,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93649 conditions, 31391 events. 19502/31391 cut-off events. For 90883/95482 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 227386 event pairs, 7993 based on Foata normal form. 381/29979 useless extension candidates. Maximal degree in co-relation 59312. Up to 10745 conditions per place. [2025-03-09 01:21:58,253 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 173 selfloop transitions, 30 changer transitions 0/227 dead transitions. [2025-03-09 01:21:58,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 227 transitions, 1818 flow [2025-03-09 01:21:58,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:21:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:21:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 525 transitions. [2025-03-09 01:21:58,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6076388888888888 [2025-03-09 01:21:58,255 INFO L175 Difference]: Start difference. First operand has 129 places, 123 transitions, 798 flow. Second operand 9 states and 525 transitions. [2025-03-09 01:21:58,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 227 transitions, 1818 flow [2025-03-09 01:21:58,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 227 transitions, 1737 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-09 01:21:58,320 INFO L231 Difference]: Finished difference. Result has 133 places, 126 transitions, 840 flow [2025-03-09 01:21:58,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=840, PETRI_PLACES=133, PETRI_TRANSITIONS=126} [2025-03-09 01:21:58,321 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 43 predicate places. [2025-03-09 01:21:58,321 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 126 transitions, 840 flow [2025-03-09 01:21:58,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.84615384615385) internal successors, (596), 13 states have internal predecessors, (596), 0 states have call successors, (0), 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-09 01:21:58,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:58,321 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:58,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:21:58,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:58,522 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:21:58,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:58,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1374054609, now seen corresponding path program 1 times [2025-03-09 01:21:58,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:58,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066447993] [2025-03-09 01:21:58,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:58,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:58,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:21:58,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:21:58,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:58,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:21:58,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066447993] [2025-03-09 01:21:58,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066447993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932002185] [2025-03-09 01:21:58,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:58,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:58,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:58,612 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-09 01:21:58,614 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-09 01:21:58,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:21:58,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:21:58,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:58,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:58,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:21:58,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:21:58,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:21:58,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932002185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:58,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:58,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-09 01:21:58,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790680605] [2025-03-09 01:21:58,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:58,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:21:58,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:58,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:21:58,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:21:59,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-09 01:21:59,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 126 transitions, 840 flow. Second operand has 16 states, 16 states have (on average 51.25) internal successors, (820), 16 states have internal predecessors, (820), 0 states have call successors, (0), 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-09 01:21:59,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:59,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-09 01:21:59,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:04,429 INFO L124 PetriNetUnfolderBase]: 44820/76228 cut-off events. [2025-03-09 01:22:04,429 INFO L125 PetriNetUnfolderBase]: For 229460/238017 co-relation queries the response was YES. [2025-03-09 01:22:04,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232635 conditions, 76228 events. 44820/76228 cut-off events. For 229460/238017 co-relation queries the response was YES. Maximal size of possible extension queue 2123. Compared 675989 event pairs, 19924 based on Foata normal form. 1445/75033 useless extension candidates. Maximal degree in co-relation 134276. Up to 14096 conditions per place. [2025-03-09 01:22:05,110 INFO L140 encePairwiseOnDemand]: 82/96 looper letters, 427 selfloop transitions, 66 changer transitions 0/520 dead transitions. [2025-03-09 01:22:05,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 520 transitions, 4305 flow [2025-03-09 01:22:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 01:22:05,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-09 01:22:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1549 transitions. [2025-03-09 01:22:05,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6454166666666666 [2025-03-09 01:22:05,115 INFO L175 Difference]: Start difference. First operand has 133 places, 126 transitions, 840 flow. Second operand 25 states and 1549 transitions. [2025-03-09 01:22:05,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 520 transitions, 4305 flow [2025-03-09 01:22:05,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 520 transitions, 4129 flow, removed 40 selfloop flow, removed 6 redundant places. [2025-03-09 01:22:05,626 INFO L231 Difference]: Finished difference. Result has 160 places, 165 transitions, 1331 flow [2025-03-09 01:22:05,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1331, PETRI_PLACES=160, PETRI_TRANSITIONS=165} [2025-03-09 01:22:05,626 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 70 predicate places. [2025-03-09 01:22:05,626 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 165 transitions, 1331 flow [2025-03-09 01:22:05,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.25) internal successors, (820), 16 states have internal predecessors, (820), 0 states have call successors, (0), 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-09 01:22:05,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:05,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:05,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:22:05,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:05,827 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:22:05,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:05,828 INFO L85 PathProgramCache]: Analyzing trace with hash 505907916, now seen corresponding path program 1 times [2025-03-09 01:22:05,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:05,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694694052] [2025-03-09 01:22:05,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:05,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:05,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:22:05,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:22:05,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:05,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:05,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:05,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694694052] [2025-03-09 01:22:05,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694694052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:05,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328271493] [2025-03-09 01:22:05,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:05,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:05,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:05,926 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-09 01:22:05,927 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-09 01:22:05,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:22:05,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:22:05,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:05,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:05,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:22:05,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:06,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:06,090 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 22 treesize of output 18 [2025-03-09 01:22:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:06,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328271493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:06,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:06,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:22:06,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842356685] [2025-03-09 01:22:06,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:06,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:22:06,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:06,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:22:06,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:22:06,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-09 01:22:06,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 165 transitions, 1331 flow. Second operand has 11 states, 11 states have (on average 49.72727272727273) internal successors, (547), 11 states have internal predecessors, (547), 0 states have call successors, (0), 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-09 01:22:06,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:06,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-09 01:22:06,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:12,333 INFO L124 PetriNetUnfolderBase]: 48175/78427 cut-off events. [2025-03-09 01:22:12,333 INFO L125 PetriNetUnfolderBase]: For 302477/315421 co-relation queries the response was YES. [2025-03-09 01:22:12,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253299 conditions, 78427 events. 48175/78427 cut-off events. For 302477/315421 co-relation queries the response was YES. Maximal size of possible extension queue 2144. Compared 660731 event pairs, 19872 based on Foata normal form. 944/77397 useless extension candidates. Maximal degree in co-relation 244213. Up to 28677 conditions per place. [2025-03-09 01:22:13,045 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 243 selfloop transitions, 40 changer transitions 0/308 dead transitions. [2025-03-09 01:22:13,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 308 transitions, 3112 flow [2025-03-09 01:22:13,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:22:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:22:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 459 transitions. [2025-03-09 01:22:13,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6830357142857143 [2025-03-09 01:22:13,046 INFO L175 Difference]: Start difference. First operand has 160 places, 165 transitions, 1331 flow. Second operand 7 states and 459 transitions. [2025-03-09 01:22:13,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 308 transitions, 3112 flow [2025-03-09 01:22:13,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 308 transitions, 3014 flow, removed 36 selfloop flow, removed 6 redundant places. [2025-03-09 01:22:13,399 INFO L231 Difference]: Finished difference. Result has 161 places, 165 transitions, 1391 flow [2025-03-09 01:22:13,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1391, PETRI_PLACES=161, PETRI_TRANSITIONS=165} [2025-03-09 01:22:13,400 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 71 predicate places. [2025-03-09 01:22:13,400 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 165 transitions, 1391 flow [2025-03-09 01:22:13,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.72727272727273) internal successors, (547), 11 states have internal predecessors, (547), 0 states have call successors, (0), 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-09 01:22:13,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:13,400 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:13,407 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-09 01:22:13,601 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,SelfDestructingSolverStorable21 [2025-03-09 01:22:13,601 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:22:13,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:13,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1817891185, now seen corresponding path program 1 times [2025-03-09 01:22:13,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:13,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748138454] [2025-03-09 01:22:13,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:13,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:13,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:22:13,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:22:13,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:13,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:13,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:13,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748138454] [2025-03-09 01:22:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748138454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:13,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62993523] [2025-03-09 01:22:13,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:13,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:13,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:13,671 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-09 01:22:13,673 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-09 01:22:13,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:22:13,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:22:13,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:13,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:13,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:22:13,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:22:13,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:22:13,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62993523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:13,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:13,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-09 01:22:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628500209] [2025-03-09 01:22:13,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:13,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:22:13,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:13,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:22:13,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:22:14,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-09 01:22:14,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 165 transitions, 1391 flow. Second operand has 16 states, 16 states have (on average 51.5) internal successors, (824), 16 states have internal predecessors, (824), 0 states have call successors, (0), 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-09 01:22:14,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:14,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-09 01:22:14,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:23,415 INFO L124 PetriNetUnfolderBase]: 69365/115581 cut-off events. [2025-03-09 01:22:23,415 INFO L125 PetriNetUnfolderBase]: For 515924/533053 co-relation queries the response was YES. [2025-03-09 01:22:24,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385420 conditions, 115581 events. 69365/115581 cut-off events. For 515924/533053 co-relation queries the response was YES. Maximal size of possible extension queue 3471. Compared 1060327 event pairs, 30621 based on Foata normal form. 1783/114856 useless extension candidates. Maximal degree in co-relation 359516. Up to 23189 conditions per place. [2025-03-09 01:22:24,601 INFO L140 encePairwiseOnDemand]: 82/96 looper letters, 437 selfloop transitions, 87 changer transitions 0/551 dead transitions. [2025-03-09 01:22:24,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 551 transitions, 5261 flow [2025-03-09 01:22:24,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:22:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 01:22:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1329 transitions. [2025-03-09 01:22:24,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6592261904761905 [2025-03-09 01:22:24,603 INFO L175 Difference]: Start difference. First operand has 161 places, 165 transitions, 1391 flow. Second operand 21 states and 1329 transitions. [2025-03-09 01:22:24,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 551 transitions, 5261 flow [2025-03-09 01:22:25,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 551 transitions, 5110 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-03-09 01:22:25,544 INFO L231 Difference]: Finished difference. Result has 183 places, 197 transitions, 1918 flow [2025-03-09 01:22:25,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1918, PETRI_PLACES=183, PETRI_TRANSITIONS=197} [2025-03-09 01:22:25,544 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 93 predicate places. [2025-03-09 01:22:25,544 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 197 transitions, 1918 flow [2025-03-09 01:22:25,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.5) internal successors, (824), 16 states have internal predecessors, (824), 0 states have call successors, (0), 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-09 01:22:25,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:25,545 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:25,551 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-09 01:22:25,745 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,SelfDestructingSolverStorable22 [2025-03-09 01:22:25,745 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:22:25,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:25,746 INFO L85 PathProgramCache]: Analyzing trace with hash -163471003, now seen corresponding path program 2 times [2025-03-09 01:22:25,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:25,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204992214] [2025-03-09 01:22:25,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:25,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:25,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:22:25,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:22:25,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:22:25,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:22:26,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:26,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204992214] [2025-03-09 01:22:26,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204992214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:26,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675583030] [2025-03-09 01:22:26,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:26,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:26,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:26,110 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-09 01:22:26,112 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-09 01:22:26,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:22:26,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:22:26,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:22:26,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:26,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:22:26,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:26,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:22:26,268 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:22:26,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-09 01:22:26,283 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 01:22:26,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 01:22:26,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:22:26,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:22:26,339 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:22:26,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:22:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:22:26,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:26,673 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 100 treesize of output 96 [2025-03-09 01:22:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:22:26,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675583030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:26,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:26,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2025-03-09 01:22:26,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271713377] [2025-03-09 01:22:26,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:26,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:22:26,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:26,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:22:26,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:22:30,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 96 [2025-03-09 01:22:30,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 197 transitions, 1918 flow. Second operand has 25 states, 25 states have (on average 38.24) internal successors, (956), 25 states have internal predecessors, (956), 0 states have call successors, (0), 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-09 01:22:30,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:30,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 96 [2025-03-09 01:22:30,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand