./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 14:24:30,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:24:30,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:24:30,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:24:30,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:24:30,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:24:30,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:24:30,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:24:30,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:24:30,423 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:24:30,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:24:30,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:24:30,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:24:30,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:24:30,424 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:24:30,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:24:30,425 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:24:30,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:24:30,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:24:30,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:24:30,426 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:24:30,426 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:24:30,426 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:24:30,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:24:30,426 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:24:30,426 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:24:30,426 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:24:30,426 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:24:30,426 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:24:30,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:24:30,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:24:30,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:24:30,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:24:30,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:24:30,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:24:30,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:24:30,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:24:30,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:24:30,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:24:30,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:24:30,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:24:30,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:24:30,427 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-17 14:24:30,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:24:30,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:24:30,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:24:30,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:24:30,663 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:24:30,664 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-17 14:24:31,849 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12c725b63/ca2132e2715f44c39b9ee905ab5610a3/FLAGe8a962fbc [2025-03-17 14:24:32,105 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:24:32,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2025-03-17 14:24:32,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12c725b63/ca2132e2715f44c39b9ee905ab5610a3/FLAGe8a962fbc [2025-03-17 14:24:32,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12c725b63/ca2132e2715f44c39b9ee905ab5610a3 [2025-03-17 14:24:32,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:24:32,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:24:32,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:24:32,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:24:32,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:24:32,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74beb606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32, skipping insertion in model container [2025-03-17 14:24:32,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:24:32,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-17 14:24:32,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:24:32,589 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:24:32,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:24:32,627 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:24:32,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32 WrapperNode [2025-03-17 14:24:32,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:24:32,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:24:32,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:24:32,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:24:32,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,668 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 162 [2025-03-17 14:24:32,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:24:32,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:24:32,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:24:32,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:24:32,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,697 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-17 14:24:32,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:24:32,721 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:24:32,721 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:24:32,721 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:24:32,722 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32" (1/1) ... [2025-03-17 14:24:32,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:24:32,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:32,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-17 14:24:32,745 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-17 14:24:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:24:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:24:32,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:24:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:24:32,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:24:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:24:32,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:24:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:24:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:24:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:24:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:24:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:24:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:24:32,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:24:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:24:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:24:32,761 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:24:32,828 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:24:32,829 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:24:33,183 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:24:33,183 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:24:33,396 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:24:33,396 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:24:33,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:24:33 BoogieIcfgContainer [2025-03-17 14:24:33,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:24:33,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:24:33,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:24:33,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:24:33,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:24:32" (1/3) ... [2025-03-17 14:24:33,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ef7b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:24:33, skipping insertion in model container [2025-03-17 14:24:33,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:32" (2/3) ... [2025-03-17 14:24:33,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ef7b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:24:33, skipping insertion in model container [2025-03-17 14:24:33,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:24:33" (3/3) ... [2025-03-17 14:24:33,406 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2025-03-17 14:24:33,418 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:24:33,419 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-17 14:24:33,419 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:24:33,475 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 14:24:33,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 96 transitions, 213 flow [2025-03-17 14:24:33,540 INFO L124 PetriNetUnfolderBase]: 12/93 cut-off events. [2025-03-17 14:24:33,543 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 14:24:33,548 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-17 14:24:33,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 96 transitions, 213 flow [2025-03-17 14:24:33,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 92 transitions, 202 flow [2025-03-17 14:24:33,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:24:33,570 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;@6709f67c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:24:33,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-17 14:24:33,574 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:24:33,574 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:24:33,574 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:24:33,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:33,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:24:33,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:33,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:33,579 INFO L85 PathProgramCache]: Analyzing trace with hash 680425, now seen corresponding path program 1 times [2025-03-17 14:24:33,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:33,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806998342] [2025-03-17 14:24:33,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:33,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:33,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:24:33,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:24:33,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:33,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:33,755 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-17 14:24:33,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:33,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806998342] [2025-03-17 14:24:33,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806998342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:33,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:33,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:24:33,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810876083] [2025-03-17 14:24:33,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:33,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:24:33,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:33,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:24:33,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:24:33,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:24:33,847 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-17 14:24:33,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:33,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:24:33,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:34,262 INFO L124 PetriNetUnfolderBase]: 2426/4409 cut-off events. [2025-03-17 14:24:34,263 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2025-03-17 14:24:34,269 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 29884 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-17 14:24:34,288 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 42 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2025-03-17 14:24:34,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 280 flow [2025-03-17 14:24:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:24:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:24:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-03-17 14:24:34,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-17 14:24:34,299 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 202 flow. Second operand 3 states and 189 transitions. [2025-03-17 14:24:34,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 87 transitions, 280 flow [2025-03-17 14:24:34,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 87 transitions, 268 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 14:24:34,312 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 184 flow [2025-03-17 14:24:34,314 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-17 14:24:34,316 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -9 predicate places. [2025-03-17 14:24:34,317 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 184 flow [2025-03-17 14:24:34,317 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-17 14:24:34,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:34,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:24:34,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:24:34,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:34,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:34,318 INFO L85 PathProgramCache]: Analyzing trace with hash 680426, now seen corresponding path program 1 times [2025-03-17 14:24:34,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:34,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792258470] [2025-03-17 14:24:34,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:34,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:34,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:24:34,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:24:34,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:34,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:34,586 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-17 14:24:34,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:34,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792258470] [2025-03-17 14:24:34,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792258470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:34,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:34,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:24:34,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908960161] [2025-03-17 14:24:34,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:34,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:24:34,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:34,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:24:34,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:24:34,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:24:34,693 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-17 14:24:34,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:34,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:24:34,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:35,109 INFO L124 PetriNetUnfolderBase]: 2427/4412 cut-off events. [2025-03-17 14:24:35,110 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-17 14:24:35,118 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 29871 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-17 14:24:35,191 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 46 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2025-03-17 14:24:35,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 90 transitions, 290 flow [2025-03-17 14:24:35,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:24:35,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:24:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-17 14:24:35,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6223958333333334 [2025-03-17 14:24:35,193 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 184 flow. Second operand 4 states and 239 transitions. [2025-03-17 14:24:35,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 90 transitions, 290 flow [2025-03-17 14:24:35,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 90 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:24:35,195 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 207 flow [2025-03-17 14:24:35,195 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-17 14:24:35,197 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -6 predicate places. [2025-03-17 14:24:35,197 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 207 flow [2025-03-17 14:24:35,198 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-17 14:24:35,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:35,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:24:35,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:24:35,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:35,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash 21095217, now seen corresponding path program 1 times [2025-03-17 14:24:35,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:35,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699600901] [2025-03-17 14:24:35,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:35,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:35,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:24:35,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:24:35,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:35,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:35,376 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-17 14:24:35,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:35,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699600901] [2025-03-17 14:24:35,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699600901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:35,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:35,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:24:35,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012132641] [2025-03-17 14:24:35,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:35,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:35,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:35,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:35,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:35,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:24:35,490 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-17 14:24:35,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:35,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:24:35,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:35,835 INFO L124 PetriNetUnfolderBase]: 2428/4415 cut-off events. [2025-03-17 14:24:35,836 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-17 14:24:35,842 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 29860 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-17 14:24:35,863 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 46 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2025-03-17 14:24:35,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 93 transitions, 319 flow [2025-03-17 14:24:35,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2025-03-17 14:24:35,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020833333333333 [2025-03-17 14:24:35,866 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 207 flow. Second operand 5 states and 289 transitions. [2025-03-17 14:24:35,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 93 transitions, 319 flow [2025-03-17 14:24:35,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 93 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:24:35,867 INFO L231 Difference]: Finished difference. Result has 89 places, 93 transitions, 241 flow [2025-03-17 14:24:35,867 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-17 14:24:35,870 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -1 predicate places. [2025-03-17 14:24:35,870 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 93 transitions, 241 flow [2025-03-17 14:24:35,871 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-17 14:24:35,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:35,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:24:35,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:24:35,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:35,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash 653953649, now seen corresponding path program 1 times [2025-03-17 14:24:35,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:35,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433902210] [2025-03-17 14:24:35,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:35,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:35,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:24:35,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:24:35,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:35,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:36,047 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-17 14:24:36,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:36,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433902210] [2025-03-17 14:24:36,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433902210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:36,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:36,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:24:36,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716916363] [2025-03-17 14:24:36,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:36,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:36,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:36,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:36,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:36,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:24:36,193 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-17 14:24:36,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:36,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:24:36,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:36,517 INFO L124 PetriNetUnfolderBase]: 2429/4418 cut-off events. [2025-03-17 14:24:36,517 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-17 14:24:36,524 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 29896 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-17 14:24:36,567 INFO L140 encePairwiseOnDemand]: 87/96 looper letters, 47 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2025-03-17 14:24:36,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 96 transitions, 359 flow [2025-03-17 14:24:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2025-03-17 14:24:36,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020833333333333 [2025-03-17 14:24:36,570 INFO L175 Difference]: Start difference. First operand has 89 places, 93 transitions, 241 flow. Second operand 5 states and 289 transitions. [2025-03-17 14:24:36,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 96 transitions, 359 flow [2025-03-17 14:24:36,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:24:36,573 INFO L231 Difference]: Finished difference. Result has 94 places, 96 transitions, 283 flow [2025-03-17 14:24:36,573 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-17 14:24:36,573 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2025-03-17 14:24:36,575 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 96 transitions, 283 flow [2025-03-17 14:24:36,575 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-17 14:24:36,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:36,576 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:24:36,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:24:36,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:36,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:36,576 INFO L85 PathProgramCache]: Analyzing trace with hash 653909605, now seen corresponding path program 1 times [2025-03-17 14:24:36,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:36,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095046675] [2025-03-17 14:24:36,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:36,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:36,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:24:36,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:24:36,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:36,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:36,737 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-17 14:24:36,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:36,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095046675] [2025-03-17 14:24:36,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095046675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:36,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993150474] [2025-03-17 14:24:36,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:36,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:36,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:36,739 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-17 14:24:36,741 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-17 14:24:36,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:24:36,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:24:36,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:36,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:36,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:24:36,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:36,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:24:36,947 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-17 14:24:36,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:37,036 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-17 14:24:37,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993150474] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:37,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:37,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:24:37,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426039173] [2025-03-17 14:24:37,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:37,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:24:37,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:37,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:24:37,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:24:37,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:24:37,505 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-17 14:24:37,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:37,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:24:37,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:37,943 INFO L124 PetriNetUnfolderBase]: 2429/4417 cut-off events. [2025-03-17 14:24:37,944 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-17 14:24:37,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7726 conditions, 4417 events. 2429/4417 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29874 event pairs, 1460 based on Foata normal form. 0/2914 useless extension candidates. Maximal degree in co-relation 7692. Up to 3203 conditions per place. [2025-03-17 14:24:37,975 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 48 selfloop transitions, 7 changer transitions 0/95 dead transitions. [2025-03-17 14:24:37,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 95 transitions, 389 flow [2025-03-17 14:24:37,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:24:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:24:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 332 transitions. [2025-03-17 14:24:37,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2025-03-17 14:24:37,978 INFO L175 Difference]: Start difference. First operand has 94 places, 96 transitions, 283 flow. Second operand 6 states and 332 transitions. [2025-03-17 14:24:37,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 95 transitions, 389 flow [2025-03-17 14:24:37,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 95 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:24:37,982 INFO L231 Difference]: Finished difference. Result has 96 places, 95 transitions, 286 flow [2025-03-17 14:24:37,982 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=6, PETRI_FLOW=286, PETRI_PLACES=96, PETRI_TRANSITIONS=95} [2025-03-17 14:24:37,983 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 6 predicate places. [2025-03-17 14:24:37,983 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 95 transitions, 286 flow [2025-03-17 14:24:37,984 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-17 14:24:37,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:37,984 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:24:37,990 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-17 14:24:38,185 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-17 14:24:38,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:38,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:38,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1202312456, now seen corresponding path program 1 times [2025-03-17 14:24:38,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:38,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122096762] [2025-03-17 14:24:38,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:38,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:38,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:24:38,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:24:38,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:38,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:38,374 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-17 14:24:38,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:38,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122096762] [2025-03-17 14:24:38,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122096762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:38,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167466407] [2025-03-17 14:24:38,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:38,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:38,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:38,378 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-17 14:24:38,379 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-17 14:24:38,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:24:38,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:24:38,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:38,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:38,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:24:38,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:38,447 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-17 14:24:38,570 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-17 14:24:38,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:38,681 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-17 14:24:38,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167466407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:38,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:38,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:24:38,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798798587] [2025-03-17 14:24:38,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:38,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:24:38,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:38,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:24:38,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:24:39,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 96 [2025-03-17 14:24:39,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 286 flow. Second operand has 13 states, 13 states have (on average 47.30769230769231) internal successors, (615), 13 states have internal predecessors, (615), 0 states have call successors, (0), 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-17 14:24:39,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:39,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 96 [2025-03-17 14:24:39,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:40,511 INFO L124 PetriNetUnfolderBase]: 2684/5179 cut-off events. [2025-03-17 14:24:40,511 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-17 14:24:40,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8849 conditions, 5179 events. 2684/5179 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 37919 event pairs, 1646 based on Foata normal form. 0/3350 useless extension candidates. Maximal degree in co-relation 8798. Up to 3533 conditions per place. [2025-03-17 14:24:40,569 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 43 selfloop transitions, 18 changer transitions 0/100 dead transitions. [2025-03-17 14:24:40,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 100 transitions, 439 flow [2025-03-17 14:24:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:24:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:24:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 474 transitions. [2025-03-17 14:24:40,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2025-03-17 14:24:40,575 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 286 flow. Second operand 9 states and 474 transitions. [2025-03-17 14:24:40,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 100 transitions, 439 flow [2025-03-17 14:24:40,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 100 transitions, 392 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-17 14:24:40,579 INFO L231 Difference]: Finished difference. Result has 95 places, 100 transitions, 306 flow [2025-03-17 14:24:40,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=306, PETRI_PLACES=95, PETRI_TRANSITIONS=100} [2025-03-17 14:24:40,581 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2025-03-17 14:24:40,581 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 100 transitions, 306 flow [2025-03-17 14:24:40,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 47.30769230769231) internal successors, (615), 13 states have internal predecessors, (615), 0 states have call successors, (0), 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-17 14:24:40,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:40,582 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-17 14:24:40,588 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-17 14:24:40,786 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-17 14:24:40,786 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:40,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:40,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1384252491, now seen corresponding path program 1 times [2025-03-17 14:24:40,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:40,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888138816] [2025-03-17 14:24:40,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:40,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:40,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:24:40,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:24:40,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:40,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:40,960 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-17 14:24:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:40,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888138816] [2025-03-17 14:24:40,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888138816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:40,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237651558] [2025-03-17 14:24:40,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:40,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:40,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:40,962 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-17 14:24:40,964 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-17 14:24:41,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:24:41,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:24:41,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:41,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:41,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:24:41,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:41,032 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-17 14:24:41,140 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-17 14:24:41,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:41,251 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-17 14:24:41,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237651558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:41,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:41,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:24:41,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786602191] [2025-03-17 14:24:41,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:41,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:24:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:41,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:24:41,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:24:41,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:24:41,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 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-17 14:24:41,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:41,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:24:41,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:42,278 INFO L124 PetriNetUnfolderBase]: 2431/4421 cut-off events. [2025-03-17 14:24:42,278 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-17 14:24:42,283 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 29878 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-17 14:24:42,293 INFO L140 encePairwiseOnDemand]: 87/96 looper letters, 40 selfloop transitions, 19 changer transitions 0/99 dead transitions. [2025-03-17 14:24:42,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 99 transitions, 420 flow [2025-03-17 14:24:42,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:24:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:24:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 380 transitions. [2025-03-17 14:24:42,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5654761904761905 [2025-03-17 14:24:42,295 INFO L175 Difference]: Start difference. First operand has 95 places, 100 transitions, 306 flow. Second operand 7 states and 380 transitions. [2025-03-17 14:24:42,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 99 transitions, 420 flow [2025-03-17 14:24:42,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 99 transitions, 387 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-17 14:24:42,297 INFO L231 Difference]: Finished difference. Result has 95 places, 99 transitions, 307 flow [2025-03-17 14:24:42,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=89, 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=95, PETRI_TRANSITIONS=99} [2025-03-17 14:24:42,298 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2025-03-17 14:24:42,298 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 99 transitions, 307 flow [2025-03-17 14:24:42,298 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-17 14:24:42,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:42,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:42,304 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-17 14:24:42,499 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-17 14:24:42,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:42,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:42,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1057964429, now seen corresponding path program 1 times [2025-03-17 14:24:42,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:42,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648480791] [2025-03-17 14:24:42,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:42,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:42,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:24:42,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:24:42,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:42,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:42,550 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-17 14:24:42,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:42,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648480791] [2025-03-17 14:24:42,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648480791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:42,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:42,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:24:42,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236477330] [2025-03-17 14:24:42,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:42,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:42,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:42,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:42,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:42,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:24:42,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 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-17 14:24:42,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:42,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:24:42,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:42,979 INFO L124 PetriNetUnfolderBase]: 4329/8282 cut-off events. [2025-03-17 14:24:42,979 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-17 14:24:42,988 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 481. Compared 65166 event pairs, 2464 based on Foata normal form. 114/5637 useless extension candidates. Maximal degree in co-relation 8793. Up to 3546 conditions per place. [2025-03-17 14:24:43,010 INFO L140 encePairwiseOnDemand]: 86/96 looper letters, 117 selfloop transitions, 10 changer transitions 0/166 dead transitions. [2025-03-17 14:24:43,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 166 transitions, 759 flow [2025-03-17 14:24:43,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:24:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:24:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 407 transitions. [2025-03-17 14:24:43,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7065972222222222 [2025-03-17 14:24:43,011 INFO L175 Difference]: Start difference. First operand has 95 places, 99 transitions, 307 flow. Second operand 6 states and 407 transitions. [2025-03-17 14:24:43,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 166 transitions, 759 flow [2025-03-17 14:24:43,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 166 transitions, 695 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 14:24:43,014 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 344 flow [2025-03-17 14:24:43,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2025-03-17 14:24:43,014 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2025-03-17 14:24:43,014 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 344 flow [2025-03-17 14:24:43,014 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-17 14:24:43,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:43,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:43,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:24:43,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:43,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:43,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1477332306, now seen corresponding path program 1 times [2025-03-17 14:24:43,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:43,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158525462] [2025-03-17 14:24:43,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:43,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:43,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:24:43,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:24:43,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:43,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:43,078 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-17 14:24:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158525462] [2025-03-17 14:24:43,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158525462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:43,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:43,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:24:43,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265991315] [2025-03-17 14:24:43,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:43,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:43,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:43,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:43,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:43,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:24:43,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 344 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-17 14:24:43,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:43,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:24:43,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:43,716 INFO L124 PetriNetUnfolderBase]: 7588/14544 cut-off events. [2025-03-17 14:24:43,716 INFO L125 PetriNetUnfolderBase]: For 1966/1966 co-relation queries the response was YES. [2025-03-17 14:24:43,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26393 conditions, 14544 events. 7588/14544 cut-off events. For 1966/1966 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 125442 event pairs, 4318 based on Foata normal form. 114/10248 useless extension candidates. Maximal degree in co-relation 18879. Up to 5732 conditions per place. [2025-03-17 14:24:43,759 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 115 selfloop transitions, 14 changer transitions 0/168 dead transitions. [2025-03-17 14:24:43,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 168 transitions, 771 flow [2025-03-17 14:24:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:24:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:24:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 401 transitions. [2025-03-17 14:24:43,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6961805555555556 [2025-03-17 14:24:43,761 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 344 flow. Second operand 6 states and 401 transitions. [2025-03-17 14:24:43,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 168 transitions, 771 flow [2025-03-17 14:24:43,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 168 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:24:43,764 INFO L231 Difference]: Finished difference. Result has 103 places, 114 transitions, 448 flow [2025-03-17 14:24:43,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=448, PETRI_PLACES=103, PETRI_TRANSITIONS=114} [2025-03-17 14:24:43,765 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 13 predicate places. [2025-03-17 14:24:43,765 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 114 transitions, 448 flow [2025-03-17 14:24:43,765 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-17 14:24:43,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:43,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:43,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:24:43,766 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:43,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash 520569776, now seen corresponding path program 1 times [2025-03-17 14:24:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:43,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72143309] [2025-03-17 14:24:43,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:43,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:24:43,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:24:43,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:43,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:43,819 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-17 14:24:43,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:43,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72143309] [2025-03-17 14:24:43,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72143309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:43,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:43,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:24:43,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165718755] [2025-03-17 14:24:43,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:43,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:43,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:43,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:43,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:43,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:24:43,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 114 transitions, 448 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-17 14:24:43,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:43,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:24:43,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:44,530 INFO L124 PetriNetUnfolderBase]: 6629/13305 cut-off events. [2025-03-17 14:24:44,531 INFO L125 PetriNetUnfolderBase]: For 4669/4867 co-relation queries the response was YES. [2025-03-17 14:24:44,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24945 conditions, 13305 events. 6629/13305 cut-off events. For 4669/4867 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 116633 event pairs, 3968 based on Foata normal form. 174/9436 useless extension candidates. Maximal degree in co-relation 18341. Up to 5977 conditions per place. [2025-03-17 14:24:44,591 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 125 selfloop transitions, 5 changer transitions 0/169 dead transitions. [2025-03-17 14:24:44,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 169 transitions, 877 flow [2025-03-17 14:24:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2025-03-17 14:24:44,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-17 14:24:44,594 INFO L175 Difference]: Start difference. First operand has 103 places, 114 transitions, 448 flow. Second operand 5 states and 345 transitions. [2025-03-17 14:24:44,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 169 transitions, 877 flow [2025-03-17 14:24:44,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 169 transitions, 872 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:24:44,600 INFO L231 Difference]: Finished difference. Result has 108 places, 116 transitions, 468 flow [2025-03-17 14:24:44,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=468, PETRI_PLACES=108, PETRI_TRANSITIONS=116} [2025-03-17 14:24:44,601 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 18 predicate places. [2025-03-17 14:24:44,601 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 116 transitions, 468 flow [2025-03-17 14:24:44,601 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-17 14:24:44,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:44,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:44,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:24:44,602 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:44,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash 174404064, now seen corresponding path program 1 times [2025-03-17 14:24:44,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:44,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150879346] [2025-03-17 14:24:44,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:44,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:44,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:24:44,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:24:44,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:44,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:44,659 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-17 14:24:44,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:44,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150879346] [2025-03-17 14:24:44,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150879346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:44,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:44,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:24:44,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039039052] [2025-03-17 14:24:44,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:44,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:44,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:44,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:44,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:44,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:24:44,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 116 transitions, 468 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-17 14:24:44,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:44,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:24:44,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:45,191 INFO L124 PetriNetUnfolderBase]: 5778/10951 cut-off events. [2025-03-17 14:24:45,191 INFO L125 PetriNetUnfolderBase]: For 5375/5634 co-relation queries the response was YES. [2025-03-17 14:24:45,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22444 conditions, 10951 events. 5778/10951 cut-off events. For 5375/5634 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 87033 event pairs, 3566 based on Foata normal form. 134/8518 useless extension candidates. Maximal degree in co-relation 16095. Up to 5187 conditions per place. [2025-03-17 14:24:45,227 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 117 selfloop transitions, 12 changer transitions 0/168 dead transitions. [2025-03-17 14:24:45,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 168 transitions, 897 flow [2025-03-17 14:24:45,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:24:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:24:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 393 transitions. [2025-03-17 14:24:45,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2025-03-17 14:24:45,229 INFO L175 Difference]: Start difference. First operand has 108 places, 116 transitions, 468 flow. Second operand 6 states and 393 transitions. [2025-03-17 14:24:45,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 168 transitions, 897 flow [2025-03-17 14:24:45,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 168 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:24:45,239 INFO L231 Difference]: Finished difference. Result has 113 places, 118 transitions, 505 flow [2025-03-17 14:24:45,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=505, PETRI_PLACES=113, PETRI_TRANSITIONS=118} [2025-03-17 14:24:45,239 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 23 predicate places. [2025-03-17 14:24:45,239 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 118 transitions, 505 flow [2025-03-17 14:24:45,239 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-17 14:24:45,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:45,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:45,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:24:45,240 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:45,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash -57013113, now seen corresponding path program 1 times [2025-03-17 14:24:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:45,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042868494] [2025-03-17 14:24:45,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:45,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:45,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:24:45,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:24:45,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:45,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:45,436 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-17 14:24:45,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:45,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042868494] [2025-03-17 14:24:45,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042868494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:45,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616404792] [2025-03-17 14:24:45,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:45,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:45,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:45,439 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-17 14:24:45,440 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-17 14:24:45,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:24:45,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:24:45,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:45,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:45,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:24:45,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:45,503 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-17 14:24:45,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:24:45,540 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-17 14:24:45,564 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 14:24:45,564 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-17 14:24:45,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:24:45,599 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-17 14:24:45,607 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:24:45,607 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-17 14:24:45,647 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-17 14:24:45,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:45,794 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-17 14:24:45,930 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-17 14:24:45,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616404792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:45,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:45,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-17 14:24:45,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902502117] [2025-03-17 14:24:45,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:45,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:24:45,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:45,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:24:45,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:24:46,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 96 [2025-03-17 14:24:46,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 118 transitions, 505 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-17 14:24:46,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:46,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 96 [2025-03-17 14:24:46,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:47,947 INFO L124 PetriNetUnfolderBase]: 9755/17214 cut-off events. [2025-03-17 14:24:47,947 INFO L125 PetriNetUnfolderBase]: For 8084/8752 co-relation queries the response was YES. [2025-03-17 14:24:47,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36753 conditions, 17214 events. 9755/17214 cut-off events. For 8084/8752 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 131178 event pairs, 3959 based on Foata normal form. 0/14119 useless extension candidates. Maximal degree in co-relation 25259. Up to 5442 conditions per place. [2025-03-17 14:24:48,017 INFO L140 encePairwiseOnDemand]: 79/96 looper letters, 146 selfloop transitions, 28 changer transitions 0/204 dead transitions. [2025-03-17 14:24:48,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 204 transitions, 1104 flow [2025-03-17 14:24:48,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:24:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:24:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 497 transitions. [2025-03-17 14:24:48,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5752314814814815 [2025-03-17 14:24:48,019 INFO L175 Difference]: Start difference. First operand has 113 places, 118 transitions, 505 flow. Second operand 9 states and 497 transitions. [2025-03-17 14:24:48,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 204 transitions, 1104 flow [2025-03-17 14:24:48,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 204 transitions, 1086 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:24:48,048 INFO L231 Difference]: Finished difference. Result has 115 places, 118 transitions, 576 flow [2025-03-17 14:24:48,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=576, PETRI_PLACES=115, PETRI_TRANSITIONS=118} [2025-03-17 14:24:48,049 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 25 predicate places. [2025-03-17 14:24:48,049 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 118 transitions, 576 flow [2025-03-17 14:24:48,049 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-17 14:24:48,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:48,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:48,055 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-17 14:24:48,249 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-17 14:24:48,249 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:48,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1234965804, now seen corresponding path program 1 times [2025-03-17 14:24:48,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:48,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732294118] [2025-03-17 14:24:48,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:48,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:24:48,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:24:48,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:48,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:48,303 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-17 14:24:48,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:48,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732294118] [2025-03-17 14:24:48,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732294118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:48,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:48,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:24:48,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672428809] [2025-03-17 14:24:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:48,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:48,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:48,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:48,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:48,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:24:48,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 118 transitions, 576 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-17 14:24:48,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:48,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:24:48,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:49,485 INFO L124 PetriNetUnfolderBase]: 11765/23133 cut-off events. [2025-03-17 14:24:49,485 INFO L125 PetriNetUnfolderBase]: For 22293/22992 co-relation queries the response was YES. [2025-03-17 14:24:49,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51663 conditions, 23133 events. 11765/23133 cut-off events. For 22293/22992 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 208927 event pairs, 7024 based on Foata normal form. 294/19203 useless extension candidates. Maximal degree in co-relation 37158. Up to 9221 conditions per place. [2025-03-17 14:24:49,594 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 141 selfloop transitions, 17 changer transitions 0/193 dead transitions. [2025-03-17 14:24:49,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 193 transitions, 1254 flow [2025-03-17 14:24:49,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2025-03-17 14:24:49,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-17 14:24:49,595 INFO L175 Difference]: Start difference. First operand has 115 places, 118 transitions, 576 flow. Second operand 5 states and 345 transitions. [2025-03-17 14:24:49,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 193 transitions, 1254 flow [2025-03-17 14:24:49,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 193 transitions, 1176 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-03-17 14:24:49,646 INFO L231 Difference]: Finished difference. Result has 117 places, 122 transitions, 598 flow [2025-03-17 14:24:49,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=111, 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=598, PETRI_PLACES=117, PETRI_TRANSITIONS=122} [2025-03-17 14:24:49,647 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 27 predicate places. [2025-03-17 14:24:49,647 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 122 transitions, 598 flow [2025-03-17 14:24:49,647 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-17 14:24:49,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:49,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:49,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:24:49,647 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:49,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:49,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1767405874, now seen corresponding path program 1 times [2025-03-17 14:24:49,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:49,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842995073] [2025-03-17 14:24:49,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:49,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:49,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:24:49,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:24:49,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:49,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:49,711 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-17 14:24:49,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:49,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842995073] [2025-03-17 14:24:49,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842995073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:49,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:49,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:24:49,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729835525] [2025-03-17 14:24:49,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:49,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:24:49,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:49,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:24:49,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:24:49,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 96 [2025-03-17 14:24:49,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 598 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-17 14:24:49,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:49,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 96 [2025-03-17 14:24:49,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:50,944 INFO L124 PetriNetUnfolderBase]: 14711/26285 cut-off events. [2025-03-17 14:24:50,944 INFO L125 PetriNetUnfolderBase]: For 27633/28578 co-relation queries the response was YES. [2025-03-17 14:24:50,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62730 conditions, 26285 events. 14711/26285 cut-off events. For 27633/28578 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 215111 event pairs, 10053 based on Foata normal form. 42/23695 useless extension candidates. Maximal degree in co-relation 45696. Up to 19957 conditions per place. [2025-03-17 14:24:51,068 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 77 selfloop transitions, 12 changer transitions 0/118 dead transitions. [2025-03-17 14:24:51,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 118 transitions, 768 flow [2025-03-17 14:24:51,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2025-03-17 14:24:51,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5229166666666667 [2025-03-17 14:24:51,069 INFO L175 Difference]: Start difference. First operand has 117 places, 122 transitions, 598 flow. Second operand 5 states and 251 transitions. [2025-03-17 14:24:51,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 118 transitions, 768 flow [2025-03-17 14:24:51,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 118 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:24:51,127 INFO L231 Difference]: Finished difference. Result has 116 places, 118 transitions, 605 flow [2025-03-17 14:24:51,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=112, 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=605, PETRI_PLACES=116, PETRI_TRANSITIONS=118} [2025-03-17 14:24:51,128 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 26 predicate places. [2025-03-17 14:24:51,128 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 118 transitions, 605 flow [2025-03-17 14:24:51,128 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-17 14:24:51,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:51,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:51,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:24:51,128 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:51,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1767405873, now seen corresponding path program 1 times [2025-03-17 14:24:51,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:51,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959275275] [2025-03-17 14:24:51,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:51,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:51,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:24:51,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:24:51,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:51,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:51,369 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-17 14:24:51,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:51,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959275275] [2025-03-17 14:24:51,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959275275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:51,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830797343] [2025-03-17 14:24:51,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:51,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:51,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:51,371 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-17 14:24:51,373 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-17 14:24:51,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:24:51,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:24:51,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:51,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:51,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:24:51,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:51,436 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-17 14:24:51,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:24:51,467 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-17 14:24:51,472 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:24:51,472 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-17 14:24:51,509 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-17 14:24:51,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:51,579 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-17 14:24:51,621 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-17 14:24:51,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830797343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:51,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:51,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 14:24:51,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654871481] [2025-03-17 14:24:51,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:51,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:24:51,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:51,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:24:51,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:24:52,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 96 [2025-03-17 14:24:52,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 118 transitions, 605 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-17 14:24:52,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:52,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 96 [2025-03-17 14:24:52,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:53,648 INFO L124 PetriNetUnfolderBase]: 12804/22427 cut-off events. [2025-03-17 14:24:53,648 INFO L125 PetriNetUnfolderBase]: For 23570/24388 co-relation queries the response was YES. [2025-03-17 14:24:53,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53848 conditions, 22427 events. 12804/22427 cut-off events. For 23570/24388 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 176558 event pairs, 5876 based on Foata normal form. 94/19873 useless extension candidates. Maximal degree in co-relation 39014. Up to 7196 conditions per place. [2025-03-17 14:24:53,758 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 146 selfloop transitions, 30 changer transitions 0/205 dead transitions. [2025-03-17 14:24:53,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 205 transitions, 1281 flow [2025-03-17 14:24:53,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:24:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:24:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 536 transitions. [2025-03-17 14:24:53,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2025-03-17 14:24:53,760 INFO L175 Difference]: Start difference. First operand has 116 places, 118 transitions, 605 flow. Second operand 9 states and 536 transitions. [2025-03-17 14:24:53,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 205 transitions, 1281 flow [2025-03-17 14:24:53,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 205 transitions, 1261 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:24:53,828 INFO L231 Difference]: Finished difference. Result has 122 places, 120 transitions, 680 flow [2025-03-17 14:24:53,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=112, 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=680, PETRI_PLACES=122, PETRI_TRANSITIONS=120} [2025-03-17 14:24:53,828 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 32 predicate places. [2025-03-17 14:24:53,828 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 120 transitions, 680 flow [2025-03-17 14:24:53,829 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-17 14:24:53,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:53,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:53,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:24:54,029 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-17 14:24:54,029 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:54,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1296546298, now seen corresponding path program 1 times [2025-03-17 14:24:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:54,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100218218] [2025-03-17 14:24:54,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:54,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:24:54,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:24:54,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:54,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:54,081 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-17 14:24:54,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:54,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100218218] [2025-03-17 14:24:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100218218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:54,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:54,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:24:54,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630356364] [2025-03-17 14:24:54,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:54,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:54,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:54,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:54,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:54,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:24:54,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 120 transitions, 680 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-17 14:24:54,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:54,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:24:54,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:55,339 INFO L124 PetriNetUnfolderBase]: 10875/19231 cut-off events. [2025-03-17 14:24:55,339 INFO L125 PetriNetUnfolderBase]: For 32106/32822 co-relation queries the response was YES. [2025-03-17 14:24:55,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49710 conditions, 19231 events. 10875/19231 cut-off events. For 32106/32822 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 148178 event pairs, 6816 based on Foata normal form. 200/17093 useless extension candidates. Maximal degree in co-relation 37037. Up to 9199 conditions per place. [2025-03-17 14:24:55,466 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 136 selfloop transitions, 17 changer transitions 0/184 dead transitions. [2025-03-17 14:24:55,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 184 transitions, 1358 flow [2025-03-17 14:24:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 338 transitions. [2025-03-17 14:24:55,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7041666666666667 [2025-03-17 14:24:55,468 INFO L175 Difference]: Start difference. First operand has 122 places, 120 transitions, 680 flow. Second operand 5 states and 338 transitions. [2025-03-17 14:24:55,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 184 transitions, 1358 flow [2025-03-17 14:24:55,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 184 transitions, 1282 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-17 14:24:55,541 INFO L231 Difference]: Finished difference. Result has 122 places, 124 transitions, 700 flow [2025-03-17 14:24:55,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=116, 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=700, PETRI_PLACES=122, PETRI_TRANSITIONS=124} [2025-03-17 14:24:55,542 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 32 predicate places. [2025-03-17 14:24:55,542 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 124 transitions, 700 flow [2025-03-17 14:24:55,542 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-17 14:24:55,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:55,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:55,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:24:55,543 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:55,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash 315590, now seen corresponding path program 1 times [2025-03-17 14:24:55,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:55,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222286986] [2025-03-17 14:24:55,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:55,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:24:55,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:24:55,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:55,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:55,777 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-17 14:24:55,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:55,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222286986] [2025-03-17 14:24:55,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222286986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:55,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039789622] [2025-03-17 14:24:55,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:55,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:55,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:55,780 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-17 14:24:55,782 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-17 14:24:55,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:24:55,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:24:55,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:55,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:55,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:24:55,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:55,861 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-17 14:24:55,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:24:55,896 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-17 14:24:55,911 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 14:24:55,912 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-17 14:24:55,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:24:55,935 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-17 14:24:55,941 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:24:55,941 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-17 14:24:55,990 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-17 14:24:55,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:56,143 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-17 14:24:56,279 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-17 14:24:56,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039789622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:56,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:56,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-17 14:24:56,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215022822] [2025-03-17 14:24:56,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:56,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:24:56,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:56,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:24:56,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:25:00,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 96 [2025-03-17 14:25:00,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 124 transitions, 700 flow. Second operand has 16 states, 16 states have (on average 38.1875) internal successors, (611), 16 states have internal predecessors, (611), 0 states have call successors, (0), 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-17 14:25:00,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:00,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 96 [2025-03-17 14:25:00,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:02,195 INFO L124 PetriNetUnfolderBase]: 19143/32432 cut-off events. [2025-03-17 14:25:02,195 INFO L125 PetriNetUnfolderBase]: For 51478/53751 co-relation queries the response was YES. [2025-03-17 14:25:02,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83488 conditions, 32432 events. 19143/32432 cut-off events. For 51478/53751 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 252329 event pairs, 7787 based on Foata normal form. 0/28275 useless extension candidates. Maximal degree in co-relation 61122. Up to 10793 conditions per place. [2025-03-17 14:25:02,425 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 178 selfloop transitions, 30 changer transitions 0/233 dead transitions. [2025-03-17 14:25:02,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 233 transitions, 1619 flow [2025-03-17 14:25:02,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:25:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:25:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 476 transitions. [2025-03-17 14:25:02,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5509259259259259 [2025-03-17 14:25:02,426 INFO L175 Difference]: Start difference. First operand has 122 places, 124 transitions, 700 flow. Second operand 9 states and 476 transitions. [2025-03-17 14:25:02,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 233 transitions, 1619 flow [2025-03-17 14:25:02,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 233 transitions, 1595 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:25:02,540 INFO L231 Difference]: Finished difference. Result has 129 places, 127 transitions, 775 flow [2025-03-17 14:25:02,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=119, 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=775, PETRI_PLACES=129, PETRI_TRANSITIONS=127} [2025-03-17 14:25:02,541 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 39 predicate places. [2025-03-17 14:25:02,541 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 127 transitions, 775 flow [2025-03-17 14:25:02,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 38.1875) internal successors, (611), 16 states have internal predecessors, (611), 0 states have call successors, (0), 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-17 14:25:02,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:02,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:02,547 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-17 14:25:02,741 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-17 14:25:02,742 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:25:02,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash 9783940, now seen corresponding path program 1 times [2025-03-17 14:25:02,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:02,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819308490] [2025-03-17 14:25:02,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:02,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:25:02,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:25:02,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:02,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:02,779 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-17 14:25:02,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:02,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819308490] [2025-03-17 14:25:02,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819308490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:02,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:02,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:25:02,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289918942] [2025-03-17 14:25:02,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:02,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:02,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:02,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:02,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:02,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 96 [2025-03-17 14:25:02,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 127 transitions, 775 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-17 14:25:02,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:02,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 96 [2025-03-17 14:25:02,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:04,002 INFO L124 PetriNetUnfolderBase]: 14918/25785 cut-off events. [2025-03-17 14:25:04,002 INFO L125 PetriNetUnfolderBase]: For 54053/56230 co-relation queries the response was YES. [2025-03-17 14:25:04,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71870 conditions, 25785 events. 14918/25785 cut-off events. For 54053/56230 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 198640 event pairs, 10042 based on Foata normal form. 171/24767 useless extension candidates. Maximal degree in co-relation 51170. Up to 20134 conditions per place. [2025-03-17 14:25:04,178 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 88 selfloop transitions, 9 changer transitions 0/123 dead transitions. [2025-03-17 14:25:04,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 123 transitions, 961 flow [2025-03-17 14:25:04,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:25:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:25:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-03-17 14:25:04,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5572916666666666 [2025-03-17 14:25:04,180 INFO L175 Difference]: Start difference. First operand has 129 places, 127 transitions, 775 flow. Second operand 4 states and 214 transitions. [2025-03-17 14:25:04,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 123 transitions, 961 flow [2025-03-17 14:25:04,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 123 transitions, 908 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-17 14:25:04,266 INFO L231 Difference]: Finished difference. Result has 122 places, 123 transitions, 732 flow [2025-03-17 14:25:04,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=119, 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=732, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2025-03-17 14:25:04,267 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 32 predicate places. [2025-03-17 14:25:04,267 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 732 flow [2025-03-17 14:25:04,267 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-17 14:25:04,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:04,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:04,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:25:04,267 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:25:04,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:04,267 INFO L85 PathProgramCache]: Analyzing trace with hash 9783941, now seen corresponding path program 1 times [2025-03-17 14:25:04,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:04,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133802691] [2025-03-17 14:25:04,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:04,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:04,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:25:04,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:25:04,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:04,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:04,377 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-17 14:25:04,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:04,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133802691] [2025-03-17 14:25:04,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133802691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:04,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279268261] [2025-03-17 14:25:04,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:04,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:04,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:04,379 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-17 14:25:04,381 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-17 14:25:04,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:25:04,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:25:04,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:04,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:04,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:25:04,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:04,499 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-17 14:25:04,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:04,531 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-17 14:25:04,536 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-17 14:25:04,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279268261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:04,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:04,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 14:25:04,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966452973] [2025-03-17 14:25:04,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:04,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:25:04,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:04,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:25:04,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:25:04,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:25:04,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 732 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-17 14:25:04,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:04,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:25:04,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:06,251 INFO L124 PetriNetUnfolderBase]: 14471/24019 cut-off events. [2025-03-17 14:25:06,251 INFO L125 PetriNetUnfolderBase]: For 47326/49116 co-relation queries the response was YES. [2025-03-17 14:25:06,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67238 conditions, 24019 events. 14471/24019 cut-off events. For 47326/49116 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 173786 event pairs, 6530 based on Foata normal form. 175/22837 useless extension candidates. Maximal degree in co-relation 50477. Up to 7714 conditions per place. [2025-03-17 14:25:06,370 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 161 selfloop transitions, 30 changer transitions 0/216 dead transitions. [2025-03-17 14:25:06,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 216 transitions, 1586 flow [2025-03-17 14:25:06,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:25:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:25:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 461 transitions. [2025-03-17 14:25:06,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6860119047619048 [2025-03-17 14:25:06,371 INFO L175 Difference]: Start difference. First operand has 122 places, 123 transitions, 732 flow. Second operand 7 states and 461 transitions. [2025-03-17 14:25:06,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 216 transitions, 1586 flow [2025-03-17 14:25:06,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 216 transitions, 1576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:25:06,454 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 803 flow [2025-03-17 14:25:06,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=119, 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=803, PETRI_PLACES=127, PETRI_TRANSITIONS=123} [2025-03-17 14:25:06,454 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 37 predicate places. [2025-03-17 14:25:06,455 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 803 flow [2025-03-17 14:25:06,455 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-17 14:25:06,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:06,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:06,462 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-17 14:25:06,655 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-17 14:25:06,656 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:25:06,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:06,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1846220692, now seen corresponding path program 1 times [2025-03-17 14:25:06,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:06,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367167762] [2025-03-17 14:25:06,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:06,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:06,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:25:06,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:25:06,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:06,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:06,759 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-17 14:25:06,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:06,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367167762] [2025-03-17 14:25:06,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367167762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:06,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754214599] [2025-03-17 14:25:06,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:06,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:06,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:06,762 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-17 14:25:06,763 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-17 14:25:06,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:25:06,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:25:06,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:06,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:06,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:25:06,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:06,827 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-17 14:25:06,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:25:06,861 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-17 14:25:06,868 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:25:06,868 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-17 14:25:06,906 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-17 14:25:06,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:06,963 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-17 14:25:06,998 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-17 14:25:06,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754214599] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:06,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:06,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 14:25:06,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399898466] [2025-03-17 14:25:06,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:06,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:25:06,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:06,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:25:06,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:25:07,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 96 [2025-03-17 14:25:07,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 123 transitions, 803 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-17 14:25:07,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:07,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 96 [2025-03-17 14:25:07,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:09,392 INFO L124 PetriNetUnfolderBase]: 19502/31391 cut-off events. [2025-03-17 14:25:09,392 INFO L125 PetriNetUnfolderBase]: For 87583/92063 co-relation queries the response was YES. [2025-03-17 14:25:09,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93653 conditions, 31391 events. 19502/31391 cut-off events. For 87583/92063 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-17 14:25:09,608 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 173 selfloop transitions, 30 changer transitions 0/227 dead transitions. [2025-03-17 14:25:09,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 227 transitions, 1823 flow [2025-03-17 14:25:09,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:25:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:25:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 525 transitions. [2025-03-17 14:25:09,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6076388888888888 [2025-03-17 14:25:09,610 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 803 flow. Second operand 9 states and 525 transitions. [2025-03-17 14:25:09,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 227 transitions, 1823 flow [2025-03-17 14:25:09,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 227 transitions, 1742 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-17 14:25:09,716 INFO L231 Difference]: Finished difference. Result has 131 places, 126 transitions, 845 flow [2025-03-17 14:25:09,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=121, 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=845, PETRI_PLACES=131, PETRI_TRANSITIONS=126} [2025-03-17 14:25:09,717 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 41 predicate places. [2025-03-17 14:25:09,717 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 126 transitions, 845 flow [2025-03-17 14:25:09,717 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-17 14:25:09,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:09,718 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:09,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:25:09,918 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-17 14:25:09,918 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:25:09,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash -783651635, now seen corresponding path program 1 times [2025-03-17 14:25:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:09,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213675151] [2025-03-17 14:25:09,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:09,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:09,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:25:09,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:25:09,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:09,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:09,980 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-17 14:25:09,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:09,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213675151] [2025-03-17 14:25:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213675151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199550215] [2025-03-17 14:25:09,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:09,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:09,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:09,983 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-17 14:25:09,984 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-17 14:25:10,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:25:10,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:25:10,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:10,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:10,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:25:10,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:10,094 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-17 14:25:10,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:10,150 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-17 14:25:10,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199550215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:10,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:10,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-17 14:25:10,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977649534] [2025-03-17 14:25:10,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:10,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:25:10,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:10,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:25:10,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:25:10,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:25:10,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 845 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-17 14:25:10,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:10,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:25:10,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:15,253 INFO L124 PetriNetUnfolderBase]: 44820/76236 cut-off events. [2025-03-17 14:25:15,253 INFO L125 PetriNetUnfolderBase]: For 231125/239723 co-relation queries the response was YES. [2025-03-17 14:25:15,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232649 conditions, 76236 events. 44820/76236 cut-off events. For 231125/239723 co-relation queries the response was YES. Maximal size of possible extension queue 2123. Compared 676443 event pairs, 19924 based on Foata normal form. 1445/75041 useless extension candidates. Maximal degree in co-relation 134290. Up to 14096 conditions per place. [2025-03-17 14:25:15,969 INFO L140 encePairwiseOnDemand]: 82/96 looper letters, 427 selfloop transitions, 66 changer transitions 0/520 dead transitions. [2025-03-17 14:25:15,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 520 transitions, 4312 flow [2025-03-17 14:25:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 14:25:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-17 14:25:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1549 transitions. [2025-03-17 14:25:15,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6454166666666666 [2025-03-17 14:25:15,971 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 845 flow. Second operand 25 states and 1549 transitions. [2025-03-17 14:25:15,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 520 transitions, 4312 flow [2025-03-17 14:25:16,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 520 transitions, 4136 flow, removed 40 selfloop flow, removed 6 redundant places. [2025-03-17 14:25:16,470 INFO L231 Difference]: Finished difference. Result has 158 places, 165 transitions, 1337 flow [2025-03-17 14:25:16,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=125, 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=1337, PETRI_PLACES=158, PETRI_TRANSITIONS=165} [2025-03-17 14:25:16,471 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 68 predicate places. [2025-03-17 14:25:16,471 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 165 transitions, 1337 flow [2025-03-17 14:25:16,471 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-17 14:25:16,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:16,471 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-17 14:25:16,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:25:16,671 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-17 14:25:16,672 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:25:16,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1398267276, now seen corresponding path program 1 times [2025-03-17 14:25:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:16,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307164134] [2025-03-17 14:25:16,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:16,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:25:16,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:25:16,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:16,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:16,762 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-17 14:25:16,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307164134] [2025-03-17 14:25:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307164134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3906817] [2025-03-17 14:25:16,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:16,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:16,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:16,765 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-17 14:25:16,766 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-17 14:25:16,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:25:16,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:25:16,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:16,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:16,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:25:16,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:16,887 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-17 14:25:16,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:16,919 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-17 14:25:16,923 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-17 14:25:16,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3906817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:16,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:16,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 14:25:16,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017933445] [2025-03-17 14:25:16,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:16,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:25:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:16,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:25:16,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:25:17,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:25:17,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 165 transitions, 1337 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-17 14:25:17,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:17,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:25:17,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:22,724 INFO L124 PetriNetUnfolderBase]: 48663/78193 cut-off events. [2025-03-17 14:25:22,724 INFO L125 PetriNetUnfolderBase]: For 305795/319187 co-relation queries the response was YES. [2025-03-17 14:25:23,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254509 conditions, 78193 events. 48663/78193 cut-off events. For 305795/319187 co-relation queries the response was YES. Maximal size of possible extension queue 2199. Compared 649581 event pairs, 20154 based on Foata normal form. 864/76737 useless extension candidates. Maximal degree in co-relation 245511. Up to 29195 conditions per place. [2025-03-17 14:25:23,416 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 243 selfloop transitions, 40 changer transitions 0/308 dead transitions. [2025-03-17 14:25:23,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 308 transitions, 3118 flow [2025-03-17 14:25:23,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:25:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:25:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 459 transitions. [2025-03-17 14:25:23,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6830357142857143 [2025-03-17 14:25:23,417 INFO L175 Difference]: Start difference. First operand has 158 places, 165 transitions, 1337 flow. Second operand 7 states and 459 transitions. [2025-03-17 14:25:23,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 308 transitions, 3118 flow [2025-03-17 14:25:23,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 308 transitions, 3025 flow, removed 36 selfloop flow, removed 4 redundant places. [2025-03-17 14:25:23,910 INFO L231 Difference]: Finished difference. Result has 161 places, 165 transitions, 1402 flow [2025-03-17 14:25:23,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=1296, 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=1402, PETRI_PLACES=161, PETRI_TRANSITIONS=165} [2025-03-17 14:25:23,910 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 71 predicate places. [2025-03-17 14:25:23,910 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 165 transitions, 1402 flow [2025-03-17 14:25:23,911 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-17 14:25:23,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:23,911 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-17 14:25:23,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:25:24,115 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-17 14:25:24,115 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:25:24,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:24,116 INFO L85 PathProgramCache]: Analyzing trace with hash -583739731, now seen corresponding path program 1 times [2025-03-17 14:25:24,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:24,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974788981] [2025-03-17 14:25:24,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:24,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:25:24,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:25:24,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:24,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:24,169 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-17 14:25:24,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:24,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974788981] [2025-03-17 14:25:24,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974788981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:24,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929401063] [2025-03-17 14:25:24,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:24,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:24,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:24,172 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-17 14:25:24,173 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-17 14:25:24,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:25:24,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:25:24,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:24,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:24,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:25:24,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:24,407 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-17 14:25:24,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:24,458 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-17 14:25:24,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929401063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:24,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:24,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-17 14:25:24,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438831016] [2025-03-17 14:25:24,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:24,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:25:24,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:24,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:25:24,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:25:24,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:25:24,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 165 transitions, 1402 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-17 14:25:24,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:24,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:25:24,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:33,319 INFO L124 PetriNetUnfolderBase]: 69253/115489 cut-off events. [2025-03-17 14:25:33,319 INFO L125 PetriNetUnfolderBase]: For 496807/512617 co-relation queries the response was YES. [2025-03-17 14:25:33,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385032 conditions, 115489 events. 69253/115489 cut-off events. For 496807/512617 co-relation queries the response was YES. Maximal size of possible extension queue 3407. Compared 1058423 event pairs, 30537 based on Foata normal form. 1811/114852 useless extension candidates. Maximal degree in co-relation 359123. Up to 23189 conditions per place. [2025-03-17 14:25:34,283 INFO L140 encePairwiseOnDemand]: 82/96 looper letters, 437 selfloop transitions, 92 changer transitions 0/556 dead transitions. [2025-03-17 14:25:34,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 556 transitions, 5313 flow [2025-03-17 14:25:34,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 14:25:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-17 14:25:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1584 transitions. [2025-03-17 14:25:34,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2025-03-17 14:25:34,285 INFO L175 Difference]: Start difference. First operand has 161 places, 165 transitions, 1402 flow. Second operand 26 states and 1584 transitions. [2025-03-17 14:25:34,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 556 transitions, 5313 flow [2025-03-17 14:25:35,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 556 transitions, 5162 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-03-17 14:25:35,840 INFO L231 Difference]: Finished difference. Result has 187 places, 202 transitions, 1939 flow [2025-03-17 14:25:35,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1939, PETRI_PLACES=187, PETRI_TRANSITIONS=202} [2025-03-17 14:25:35,841 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 97 predicate places. [2025-03-17 14:25:35,841 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 202 transitions, 1939 flow [2025-03-17 14:25:35,841 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-17 14:25:35,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:35,841 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:35,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 14:25:36,042 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-17 14:25:36,042 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:25:36,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:36,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1106713669, now seen corresponding path program 1 times [2025-03-17 14:25:36,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:36,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942411262] [2025-03-17 14:25:36,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:36,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:36,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:25:36,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:25:36,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:36,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:36,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:36,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942411262] [2025-03-17 14:25:36,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942411262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:36,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556600456] [2025-03-17 14:25:36,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:36,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:36,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:36,120 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-17 14:25:36,121 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-17 14:25:36,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:25:36,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:25:36,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:36,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:36,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:25:36,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:36,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:36,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556600456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:36,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:36,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-17 14:25:36,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572568944] [2025-03-17 14:25:36,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:36,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:25:36,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:36,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:25:36,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:25:36,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:25:36,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 202 transitions, 1939 flow. Second operand has 16 states, 16 states have (on average 51.6875) internal successors, (827), 16 states have internal predecessors, (827), 0 states have call successors, (0), 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-17 14:25:36,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:36,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:25:36,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand