./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-complex/safestack_relacy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-complex/safestack_relacy.i -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 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:59:10,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:59:10,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:59:10,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:59:10,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:59:10,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:59:10,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:59:10,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:59:10,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:59:10,161 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:59:10,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:59:10,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:59:10,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:59:10,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:59:10,161 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:59:10,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:59:10,162 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:59:10,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:59:10,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:59:10,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:59:10,163 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:59:10,163 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:59:10,163 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:59:10,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:59:10,163 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:59:10,163 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:59:10,163 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:59:10,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:59:10,164 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:59:10,164 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:59:10,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:59:10,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:59:10,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:59:10,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:59:10,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:59:10,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:59:10,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:59:10,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:59:10,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:59:10,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:59:10,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:59:10,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:59:10,165 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 -> 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 [2025-03-04 09:59:10,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:59:10,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:59:10,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:59:10,359 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:59:10,359 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:59:10,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-03-04 09:59:11,497 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f23f2cca3/f312d0788ed444018bb80f14d3155d19/FLAG69b2c24ab [2025-03-04 09:59:11,851 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:59:11,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-03-04 09:59:11,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f23f2cca3/f312d0788ed444018bb80f14d3155d19/FLAG69b2c24ab [2025-03-04 09:59:12,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f23f2cca3/f312d0788ed444018bb80f14d3155d19 [2025-03-04 09:59:12,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:59:12,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:59:12,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:59:12,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:59:12,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:59:12,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c9f299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12, skipping insertion in model container [2025-03-04 09:59:12,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:59:12,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:59:12,486 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:59:12,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:59:12,617 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:59:12,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12 WrapperNode [2025-03-04 09:59:12,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:59:12,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:59:12,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:59:12,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:59:12,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,654 INFO L138 Inliner]: procedures = 458, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 162 [2025-03-04 09:59:12,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:59:12,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:59:12,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:59:12,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:59:12,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,674 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 5, 30]. 81 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 3, 8]. The 13 writes are split as follows [0, 1, 12]. [2025-03-04 09:59:12,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,684 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:59:12,693 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:59:12,693 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:59:12,693 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:59:12,694 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12" (1/1) ... [2025-03-04 09:59:12,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:59:12,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:59:12,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:59:12,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:59:12,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:59:12,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:59:12,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:59:12,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:59:12,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-04 09:59:12,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-04 09:59:12,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:59:12,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:59:12,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:59:12,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:59:12,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:59:12,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:59:12,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:59:12,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:59:12,750 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:59:12,957 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:59:12,959 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:59:13,256 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:59:13,256 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:59:13,402 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:59:13,403 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:59:13,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:59:13 BoogieIcfgContainer [2025-03-04 09:59:13,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:59:13,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:59:13,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:59:13,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:59:13,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:59:12" (1/3) ... [2025-03-04 09:59:13,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340092cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:59:13, skipping insertion in model container [2025-03-04 09:59:13,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:59:12" (2/3) ... [2025-03-04 09:59:13,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340092cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:59:13, skipping insertion in model container [2025-03-04 09:59:13,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:59:13" (3/3) ... [2025-03-04 09:59:13,413 INFO L128 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2025-03-04 09:59:13,424 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:59:13,425 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safestack_relacy.i that has 2 procedures, 104 locations, 1 initial locations, 7 loop locations, and 50 error locations. [2025-03-04 09:59:13,426 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:59:13,491 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 09:59:13,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 117 transitions, 241 flow [2025-03-04 09:59:13,550 INFO L124 PetriNetUnfolderBase]: 13/129 cut-off events. [2025-03-04 09:59:13,552 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 09:59:13,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 129 events. 13/129 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 477 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 95. Up to 3 conditions per place. [2025-03-04 09:59:13,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 117 transitions, 241 flow [2025-03-04 09:59:13,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 117 transitions, 241 flow [2025-03-04 09:59:13,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:59:13,575 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;@797af045, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:59:13,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2025-03-04 09:59:13,580 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:59:13,580 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-04 09:59:13,580 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:59:13,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:13,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 09:59:13,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-04 09:59:13,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:13,585 INFO L85 PathProgramCache]: Analyzing trace with hash 17939, now seen corresponding path program 1 times [2025-03-04 09:59:13,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:13,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988826026] [2025-03-04 09:59:13,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:13,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:13,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 09:59:13,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 09:59:13,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:13,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:13,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:13,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988826026] [2025-03-04 09:59:13,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988826026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:13,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:13,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:59:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212071545] [2025-03-04 09:59:13,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:13,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:59:13,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:13,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:59:13,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:59:13,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-03-04 09:59:13,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 117 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:13,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:13,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-03-04 09:59:13,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:14,182 INFO L124 PetriNetUnfolderBase]: 223/549 cut-off events. [2025-03-04 09:59:14,182 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-04 09:59:14,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 549 events. 223/549 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2388 event pairs, 185 based on Foata normal form. 24/409 useless extension candidates. Maximal degree in co-relation 954. Up to 454 conditions per place. [2025-03-04 09:59:14,188 INFO L140 encePairwiseOnDemand]: 83/117 looper letters, 59 selfloop transitions, 1 changer transitions 0/83 dead transitions. [2025-03-04 09:59:14,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 83 transitions, 293 flow [2025-03-04 09:59:14,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:59:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:59:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-04 09:59:14,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4700854700854701 [2025-03-04 09:59:14,201 INFO L175 Difference]: Start difference. First operand has 107 places, 117 transitions, 241 flow. Second operand 3 states and 165 transitions. [2025-03-04 09:59:14,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 83 transitions, 293 flow [2025-03-04 09:59:14,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 83 transitions, 293 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:59:14,210 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 175 flow [2025-03-04 09:59:14,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2025-03-04 09:59:14,215 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -27 predicate places. [2025-03-04 09:59:14,216 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 175 flow [2025-03-04 09:59:14,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:14,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:14,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 09:59:14,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:59:14,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-04 09:59:14,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:14,217 INFO L85 PathProgramCache]: Analyzing trace with hash 17940, now seen corresponding path program 1 times [2025-03-04 09:59:14,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:14,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533798770] [2025-03-04 09:59:14,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:14,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:14,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 09:59:14,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 09:59:14,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:14,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:14,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:14,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533798770] [2025-03-04 09:59:14,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533798770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:14,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:14,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:59:14,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414913938] [2025-03-04 09:59:14,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:14,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:59:14,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:14,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:59:14,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:59:14,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 117 [2025-03-04 09:59:14,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:14,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:14,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 117 [2025-03-04 09:59:14,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:14,495 INFO L124 PetriNetUnfolderBase]: 188/470 cut-off events. [2025-03-04 09:59:14,496 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-04 09:59:14,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 470 events. 188/470 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1976 event pairs, 150 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 846. Up to 375 conditions per place. [2025-03-04 09:59:14,500 INFO L140 encePairwiseOnDemand]: 107/117 looper letters, 50 selfloop transitions, 1 changer transitions 0/74 dead transitions. [2025-03-04 09:59:14,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 74 transitions, 259 flow [2025-03-04 09:59:14,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:59:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:59:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-03-04 09:59:14,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39316239316239315 [2025-03-04 09:59:14,504 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 175 flow. Second operand 3 states and 138 transitions. [2025-03-04 09:59:14,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 74 transitions, 259 flow [2025-03-04 09:59:14,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 74 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:59:14,506 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 158 flow [2025-03-04 09:59:14,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2025-03-04 09:59:14,507 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -35 predicate places. [2025-03-04 09:59:14,507 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 158 flow [2025-03-04 09:59:14,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:14,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:14,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:59:14,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:59:14,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-04 09:59:14,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash -597506969, now seen corresponding path program 1 times [2025-03-04 09:59:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:14,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105678513] [2025-03-04 09:59:14,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:14,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:14,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:59:14,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:59:14,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:14,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:14,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:14,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105678513] [2025-03-04 09:59:14,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105678513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:14,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:14,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:59:14,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564002958] [2025-03-04 09:59:14,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:14,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:59:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:14,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:59:14,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:59:14,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 117 [2025-03-04 09:59:14,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:14,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:14,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 117 [2025-03-04 09:59:14,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:14,850 INFO L124 PetriNetUnfolderBase]: 189/477 cut-off events. [2025-03-04 09:59:14,850 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-04 09:59:14,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 477 events. 189/477 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2009 event pairs, 150 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 859. Up to 377 conditions per place. [2025-03-04 09:59:14,852 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 53 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2025-03-04 09:59:14,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 282 flow [2025-03-04 09:59:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:59:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:59:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2025-03-04 09:59:14,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33760683760683763 [2025-03-04 09:59:14,854 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 158 flow. Second operand 4 states and 158 transitions. [2025-03-04 09:59:14,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 282 flow [2025-03-04 09:59:14,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:59:14,856 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 178 flow [2025-03-04 09:59:14,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2025-03-04 09:59:14,857 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -32 predicate places. [2025-03-04 09:59:14,857 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 178 flow [2025-03-04 09:59:14,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:14,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:14,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:59:14,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:59:14,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-04 09:59:14,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:14,858 INFO L85 PathProgramCache]: Analyzing trace with hash -597506881, now seen corresponding path program 1 times [2025-03-04 09:59:14,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:14,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571163994] [2025-03-04 09:59:14,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:14,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:14,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:59:14,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:59:14,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:14,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:14,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:14,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571163994] [2025-03-04 09:59:14,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571163994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:14,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:14,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:59:14,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084813812] [2025-03-04 09:59:14,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:14,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:59:14,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:14,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:59:14,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:59:14,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-03-04 09:59:14,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:14,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:14,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-03-04 09:59:14,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:15,036 INFO L124 PetriNetUnfolderBase]: 188/473 cut-off events. [2025-03-04 09:59:15,036 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-04 09:59:15,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 473 events. 188/473 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1971 event pairs, 150 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 859. Up to 368 conditions per place. [2025-03-04 09:59:15,038 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 51 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-03-04 09:59:15,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 285 flow [2025-03-04 09:59:15,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:59:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:59:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-03-04 09:59:15,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3247863247863248 [2025-03-04 09:59:15,040 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 178 flow. Second operand 4 states and 152 transitions. [2025-03-04 09:59:15,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 285 flow [2025-03-04 09:59:15,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 279 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 09:59:15,041 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 179 flow [2025-03-04 09:59:15,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2025-03-04 09:59:15,042 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -30 predicate places. [2025-03-04 09:59:15,042 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 179 flow [2025-03-04 09:59:15,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:15,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:15,042 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:15,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:59:15,043 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-04 09:59:15,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1985152894, now seen corresponding path program 1 times [2025-03-04 09:59:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:15,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908434031] [2025-03-04 09:59:15,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:15,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:15,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:59:15,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:59:15,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:15,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:15,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:15,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908434031] [2025-03-04 09:59:15,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908434031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:59:15,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45688673] [2025-03-04 09:59:15,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:15,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:59:15,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:59:15,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:59:15,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:59:15,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:59:15,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:59:15,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:15,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:15,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:59:15,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:59:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:15,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:59:15,484 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 7 treesize of output 5 [2025-03-04 09:59:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:15,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45688673] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:59:15,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:59:15,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-04 09:59:15,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980122007] [2025-03-04 09:59:15,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:59:15,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:59:15,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:15,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:59:15,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:59:15,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 117 [2025-03-04 09:59:15,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 179 flow. Second operand has 14 states, 14 states have (on average 24.928571428571427) internal successors, (349), 14 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:15,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:15,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 117 [2025-03-04 09:59:15,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:16,014 INFO L124 PetriNetUnfolderBase]: 189/477 cut-off events. [2025-03-04 09:59:16,014 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-04 09:59:16,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 477 events. 189/477 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1989 event pairs, 150 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 873. Up to 368 conditions per place. [2025-03-04 09:59:16,017 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 54 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2025-03-04 09:59:16,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 315 flow [2025-03-04 09:59:16,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:59:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:59:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 223 transitions. [2025-03-04 09:59:16,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27228327228327226 [2025-03-04 09:59:16,019 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 179 flow. Second operand 7 states and 223 transitions. [2025-03-04 09:59:16,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 315 flow [2025-03-04 09:59:16,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 305 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:59:16,024 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 190 flow [2025-03-04 09:59:16,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2025-03-04 09:59:16,025 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -27 predicate places. [2025-03-04 09:59:16,025 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 190 flow [2025-03-04 09:59:16,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 24.928571428571427) internal successors, (349), 14 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:16,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:16,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:16,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:59:16,226 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-04 09:59:16,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-04 09:59:16,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1985152806, now seen corresponding path program 1 times [2025-03-04 09:59:16,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:16,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406383182] [2025-03-04 09:59:16,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:16,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:16,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:59:16,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:59:16,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:16,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:16,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406383182] [2025-03-04 09:59:16,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406383182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:59:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834022669] [2025-03-04 09:59:16,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:16,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:59:16,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:59:16,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:59:16,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:59:16,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:59:16,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:59:16,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:16,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:16,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:59:16,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:59:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:16,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:59:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:16,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834022669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:59:16,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:59:16,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:59:16,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780823197] [2025-03-04 09:59:16,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:59:16,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:59:16,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:16,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:59:16,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:59:16,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 117 [2025-03-04 09:59:16,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 190 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:16,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:16,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 117 [2025-03-04 09:59:16,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:16,688 INFO L124 PetriNetUnfolderBase]: 188/475 cut-off events. [2025-03-04 09:59:16,688 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-03-04 09:59:16,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 475 events. 188/475 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1972 event pairs, 150 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 875. Up to 368 conditions per place. [2025-03-04 09:59:16,690 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 52 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2025-03-04 09:59:16,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 79 transitions, 319 flow [2025-03-04 09:59:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:59:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:59:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2025-03-04 09:59:16,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28205128205128205 [2025-03-04 09:59:16,692 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 190 flow. Second operand 6 states and 198 transitions. [2025-03-04 09:59:16,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 79 transitions, 319 flow [2025-03-04 09:59:16,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 308 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 09:59:16,694 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 200 flow [2025-03-04 09:59:16,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2025-03-04 09:59:16,694 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -25 predicate places. [2025-03-04 09:59:16,695 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 200 flow [2025-03-04 09:59:16,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:16,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:16,695 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:16,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 09:59:16,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 09:59:16,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-04 09:59:16,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:16,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2010286815, now seen corresponding path program 2 times [2025-03-04 09:59:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:16,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213427153] [2025-03-04 09:59:16,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:59:16,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:16,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 09:59:16,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-04 09:59:16,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:59:16,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 09:59:16,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:16,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213427153] [2025-03-04 09:59:16,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213427153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:16,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:16,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:59:16,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125600855] [2025-03-04 09:59:16,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:16,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:59:16,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:16,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:59:16,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:59:17,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 117 [2025-03-04 09:59:17,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:17,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:17,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 117 [2025-03-04 09:59:17,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:17,101 INFO L124 PetriNetUnfolderBase]: 188/474 cut-off events. [2025-03-04 09:59:17,101 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-03-04 09:59:17,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 474 events. 188/474 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1967 event pairs, 150 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 872. Up to 368 conditions per place. [2025-03-04 09:59:17,107 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 49 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-03-04 09:59:17,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 75 transitions, 300 flow [2025-03-04 09:59:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:59:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:59:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-03-04 09:59:17,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3646723646723647 [2025-03-04 09:59:17,108 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 200 flow. Second operand 3 states and 128 transitions. [2025-03-04 09:59:17,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 75 transitions, 300 flow [2025-03-04 09:59:17,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 286 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:59:17,110 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 188 flow [2025-03-04 09:59:17,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-03-04 09:59:17,111 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -28 predicate places. [2025-03-04 09:59:17,111 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 188 flow [2025-03-04 09:59:17,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:17,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:17,111 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:17,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:59:17,111 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-04 09:59:17,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash -568941446, now seen corresponding path program 1 times [2025-03-04 09:59:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:17,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939268235] [2025-03-04 09:59:17,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:17,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:59:17,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:59:17,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:17,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 09:59:17,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:17,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939268235] [2025-03-04 09:59:17,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939268235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:17,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:17,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:59:17,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490915991] [2025-03-04 09:59:17,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:17,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:59:17,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:17,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:59:17,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:59:17,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-03-04 09:59:17,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:17,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:17,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-03-04 09:59:17,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:17,327 INFO L124 PetriNetUnfolderBase]: 188/468 cut-off events. [2025-03-04 09:59:17,328 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-04 09:59:17,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 468 events. 188/468 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1921 event pairs, 150 based on Foata normal form. 64/428 useless extension candidates. Maximal degree in co-relation 861. Up to 377 conditions per place. [2025-03-04 09:59:17,330 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 50 selfloop transitions, 1 changer transitions 0/73 dead transitions. [2025-03-04 09:59:17,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 73 transitions, 286 flow [2025-03-04 09:59:17,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:59:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:59:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-03-04 09:59:17,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3504273504273504 [2025-03-04 09:59:17,331 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 188 flow. Second operand 3 states and 123 transitions. [2025-03-04 09:59:17,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 73 transitions, 286 flow [2025-03-04 09:59:17,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 73 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:59:17,332 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 182 flow [2025-03-04 09:59:17,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2025-03-04 09:59:17,333 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -30 predicate places. [2025-03-04 09:59:17,333 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 182 flow [2025-03-04 09:59:17,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:17,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:17,333 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:17,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:59:17,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-04 09:59:17,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:17,334 INFO L85 PathProgramCache]: Analyzing trace with hash -568941445, now seen corresponding path program 1 times [2025-03-04 09:59:17,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:17,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409736179] [2025-03-04 09:59:17,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:17,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:17,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:59:17,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:59:17,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:17,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 09:59:17,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:17,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409736179] [2025-03-04 09:59:17,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409736179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:17,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:17,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:59:17,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417856429] [2025-03-04 09:59:17,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:17,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:59:17,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:17,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:59:17,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:59:17,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-03-04 09:59:17,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:17,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:17,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-03-04 09:59:17,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:17,559 INFO L124 PetriNetUnfolderBase]: 153/419 cut-off events. [2025-03-04 09:59:17,559 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2025-03-04 09:59:17,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 419 events. 153/419 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1952 event pairs, 45 based on Foata normal form. 61/395 useless extension candidates. Maximal degree in co-relation 755. Up to 216 conditions per place. [2025-03-04 09:59:17,561 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 82 selfloop transitions, 5 changer transitions 1/108 dead transitions. [2025-03-04 09:59:17,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 108 transitions, 428 flow [2025-03-04 09:59:17,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:59:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:59:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2025-03-04 09:59:17,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2025-03-04 09:59:17,562 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 182 flow. Second operand 4 states and 186 transitions. [2025-03-04 09:59:17,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 108 transitions, 428 flow [2025-03-04 09:59:17,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 108 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:59:17,565 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 199 flow [2025-03-04 09:59:17,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2025-03-04 09:59:17,566 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -27 predicate places. [2025-03-04 09:59:17,566 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 199 flow [2025-03-04 09:59:17,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:17,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:17,566 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:17,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:59:17,567 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-04 09:59:17,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:17,567 INFO L85 PathProgramCache]: Analyzing trace with hash -235743199, now seen corresponding path program 1 times [2025-03-04 09:59:17,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:17,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922476549] [2025-03-04 09:59:17,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:17,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:59:17,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:59:17,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:17,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 09:59:17,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:17,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922476549] [2025-03-04 09:59:17,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922476549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:17,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:17,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:59:17,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199640687] [2025-03-04 09:59:17,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:17,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:59:17,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:17,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:59:17,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:59:17,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-03-04 09:59:17,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:17,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:17,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-03-04 09:59:17,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:17,819 INFO L124 PetriNetUnfolderBase]: 77/262 cut-off events. [2025-03-04 09:59:17,819 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-04 09:59:17,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 262 events. 77/262 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1085 event pairs, 2 based on Foata normal form. 66/300 useless extension candidates. Maximal degree in co-relation 520. Up to 134 conditions per place. [2025-03-04 09:59:17,820 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 78 selfloop transitions, 3 changer transitions 0/98 dead transitions. [2025-03-04 09:59:17,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 98 transitions, 398 flow [2025-03-04 09:59:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:59:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:59:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 201 transitions. [2025-03-04 09:59:17,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3435897435897436 [2025-03-04 09:59:17,822 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 199 flow. Second operand 5 states and 201 transitions. [2025-03-04 09:59:17,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 98 transitions, 398 flow [2025-03-04 09:59:17,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 98 transitions, 390 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:59:17,824 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 164 flow [2025-03-04 09:59:17,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2025-03-04 09:59:17,824 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -36 predicate places. [2025-03-04 09:59:17,824 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 164 flow [2025-03-04 09:59:17,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:17,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:17,825 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:17,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:59:17,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-04 09:59:17,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1281895988, now seen corresponding path program 1 times [2025-03-04 09:59:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:17,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483231414] [2025-03-04 09:59:17,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:17,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:17,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:59:17,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:59:17,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:17,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:59:17,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:59:17,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:59:17,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:59:17,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:17,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:59:17,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:59:17,878 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:59:17,878 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 88 remaining) [2025-03-04 09:59:17,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2025-03-04 09:59:17,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2025-03-04 09:59:17,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2025-03-04 09:59:17,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2025-03-04 09:59:17,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2025-03-04 09:59:17,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2025-03-04 09:59:17,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2025-03-04 09:59:17,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2025-03-04 09:59:17,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (74 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONMEMORY_LEAK (65 of 88 remaining) [2025-03-04 09:59:17,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2025-03-04 09:59:17,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2025-03-04 09:59:17,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2025-03-04 09:59:17,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2025-03-04 09:59:17,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2025-03-04 09:59:17,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2025-03-04 09:59:17,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2025-03-04 09:59:17,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2025-03-04 09:59:17,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2025-03-04 09:59:17,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2025-03-04 09:59:17,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2025-03-04 09:59:17,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2025-03-04 09:59:17,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 88 remaining) [2025-03-04 09:59:17,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONMEMORY_LEAK (28 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2025-03-04 09:59:17,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2025-03-04 09:59:17,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:59:17,885 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:17,887 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:59:17,887 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 09:59:17,925 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 09:59:17,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 201 transitions, 418 flow [2025-03-04 09:59:17,949 INFO L124 PetriNetUnfolderBase]: 26/237 cut-off events. [2025-03-04 09:59:17,949 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 09:59:17,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 237 events. 26/237 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1209 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 187. Up to 6 conditions per place. [2025-03-04 09:59:17,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 201 transitions, 418 flow [2025-03-04 09:59:17,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 201 transitions, 418 flow [2025-03-04 09:59:17,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:59:17,953 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;@797af045, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:59:17,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2025-03-04 09:59:17,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:59:17,954 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-04 09:59:17,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:59:17,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:17,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 09:59:17,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:59:17,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:17,954 INFO L85 PathProgramCache]: Analyzing trace with hash 24371, now seen corresponding path program 1 times [2025-03-04 09:59:17,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:17,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206559807] [2025-03-04 09:59:17,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:17,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:17,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 09:59:17,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 09:59:17,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:17,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206559807] [2025-03-04 09:59:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206559807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:17,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:59:17,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933392116] [2025-03-04 09:59:17,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:17,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:59:17,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:17,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:59:17,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:59:18,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 201 [2025-03-04 09:59:18,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 201 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:18,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:18,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 201 [2025-03-04 09:59:18,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:19,752 INFO L124 PetriNetUnfolderBase]: 19095/30081 cut-off events. [2025-03-04 09:59:19,752 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2025-03-04 09:59:19,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58596 conditions, 30081 events. 19095/30081 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 204901 event pairs, 16870 based on Foata normal form. 1814/22591 useless extension candidates. Maximal degree in co-relation 57121. Up to 28316 conditions per place. [2025-03-04 09:59:19,920 INFO L140 encePairwiseOnDemand]: 138/201 looper letters, 102 selfloop transitions, 1 changer transitions 0/137 dead transitions. [2025-03-04 09:59:19,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 137 transitions, 496 flow [2025-03-04 09:59:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:59:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:59:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2025-03-04 09:59:19,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4527363184079602 [2025-03-04 09:59:19,922 INFO L175 Difference]: Start difference. First operand has 181 places, 201 transitions, 418 flow. Second operand 3 states and 273 transitions. [2025-03-04 09:59:19,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 137 transitions, 496 flow [2025-03-04 09:59:19,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 137 transitions, 496 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:59:19,924 INFO L231 Difference]: Finished difference. Result has 129 places, 137 transitions, 292 flow [2025-03-04 09:59:19,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=129, PETRI_TRANSITIONS=137} [2025-03-04 09:59:19,925 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -52 predicate places. [2025-03-04 09:59:19,925 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 137 transitions, 292 flow [2025-03-04 09:59:19,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:19,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:19,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 09:59:19,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:59:19,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:59:19,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash 24372, now seen corresponding path program 1 times [2025-03-04 09:59:19,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:19,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705551858] [2025-03-04 09:59:19,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:19,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:19,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 09:59:19,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 09:59:19,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:19,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:19,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705551858] [2025-03-04 09:59:19,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705551858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:19,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:19,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:59:19,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084751163] [2025-03-04 09:59:19,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:19,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:59:19,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:19,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:59:19,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:59:19,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 201 [2025-03-04 09:59:19,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 137 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:19,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:19,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 201 [2025-03-04 09:59:19,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:21,047 INFO L124 PetriNetUnfolderBase]: 13222/20974 cut-off events. [2025-03-04 09:59:21,047 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-03-04 09:59:21,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40534 conditions, 20974 events. 13222/20974 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 136968 event pairs, 11340 based on Foata normal form. 0/16295 useless extension candidates. Maximal degree in co-relation 40526. Up to 19394 conditions per place. [2025-03-04 09:59:21,137 INFO L140 encePairwiseOnDemand]: 184/201 looper letters, 86 selfloop transitions, 1 changer transitions 0/121 dead transitions. [2025-03-04 09:59:21,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 121 transitions, 434 flow [2025-03-04 09:59:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:59:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:59:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2025-03-04 09:59:21,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36981757877280264 [2025-03-04 09:59:21,138 INFO L175 Difference]: Start difference. First operand has 129 places, 137 transitions, 292 flow. Second operand 3 states and 223 transitions. [2025-03-04 09:59:21,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 121 transitions, 434 flow [2025-03-04 09:59:21,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 121 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:59:21,140 INFO L231 Difference]: Finished difference. Result has 114 places, 121 transitions, 261 flow [2025-03-04 09:59:21,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=114, PETRI_TRANSITIONS=121} [2025-03-04 09:59:21,140 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -67 predicate places. [2025-03-04 09:59:21,141 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 121 transitions, 261 flow [2025-03-04 09:59:21,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:21,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:21,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:59:21,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:59:21,141 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:59:21,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:21,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1053800391, now seen corresponding path program 1 times [2025-03-04 09:59:21,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:21,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276729305] [2025-03-04 09:59:21,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:21,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:21,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:59:21,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:59:21,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:21,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:21,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:21,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276729305] [2025-03-04 09:59:21,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276729305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:21,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:21,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:59:21,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462968021] [2025-03-04 09:59:21,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:21,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:59:21,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:21,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:59:21,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:59:21,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 201 [2025-03-04 09:59:21,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 121 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:21,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:21,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 201 [2025-03-04 09:59:21,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:22,513 INFO L124 PetriNetUnfolderBase]: 13223/20981 cut-off events. [2025-03-04 09:59:22,513 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-03-04 09:59:22,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40548 conditions, 20981 events. 13223/20981 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 136952 event pairs, 11340 based on Foata normal form. 0/16300 useless extension candidates. Maximal degree in co-relation 40539. Up to 19396 conditions per place. [2025-03-04 09:59:22,630 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 89 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2025-03-04 09:59:22,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 126 transitions, 457 flow [2025-03-04 09:59:22,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:59:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:59:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2025-03-04 09:59:22,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31094527363184077 [2025-03-04 09:59:22,632 INFO L175 Difference]: Start difference. First operand has 114 places, 121 transitions, 261 flow. Second operand 4 states and 250 transitions. [2025-03-04 09:59:22,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 126 transitions, 457 flow [2025-03-04 09:59:22,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 126 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:59:22,635 INFO L231 Difference]: Finished difference. Result has 117 places, 123 transitions, 281 flow [2025-03-04 09:59:22,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=117, PETRI_TRANSITIONS=123} [2025-03-04 09:59:22,636 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -64 predicate places. [2025-03-04 09:59:22,636 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 123 transitions, 281 flow [2025-03-04 09:59:22,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:22,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:22,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:59:22,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:59:22,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:59:22,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1053800479, now seen corresponding path program 1 times [2025-03-04 09:59:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:22,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881362631] [2025-03-04 09:59:22,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:22,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:59:22,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:59:22,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:22,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:22,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:22,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881362631] [2025-03-04 09:59:22,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881362631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:22,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:22,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:59:22,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488663082] [2025-03-04 09:59:22,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:22,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:59:22,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:22,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:59:22,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:59:22,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-03-04 09:59:22,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 123 transitions, 281 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:22,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:22,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-03-04 09:59:22,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:24,001 INFO L124 PetriNetUnfolderBase]: 13222/20977 cut-off events. [2025-03-04 09:59:24,001 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2025-03-04 09:59:24,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40550 conditions, 20977 events. 13222/20977 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 136963 event pairs, 11340 based on Foata normal form. 1/16301 useless extension candidates. Maximal degree in co-relation 40539. Up to 19387 conditions per place. [2025-03-04 09:59:24,081 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 87 selfloop transitions, 4 changer transitions 0/123 dead transitions. [2025-03-04 09:59:24,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 123 transitions, 460 flow [2025-03-04 09:59:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:59:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:59:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2025-03-04 09:59:24,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3034825870646766 [2025-03-04 09:59:24,086 INFO L175 Difference]: Start difference. First operand has 117 places, 123 transitions, 281 flow. Second operand 4 states and 244 transitions. [2025-03-04 09:59:24,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 123 transitions, 460 flow [2025-03-04 09:59:24,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 123 transitions, 454 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 09:59:24,088 INFO L231 Difference]: Finished difference. Result has 119 places, 122 transitions, 282 flow [2025-03-04 09:59:24,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=119, PETRI_TRANSITIONS=122} [2025-03-04 09:59:24,089 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -62 predicate places. [2025-03-04 09:59:24,089 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 122 transitions, 282 flow [2025-03-04 09:59:24,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:24,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:24,089 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:24,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:59:24,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:59:24,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:24,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1852167371, now seen corresponding path program 1 times [2025-03-04 09:59:24,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:24,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426626465] [2025-03-04 09:59:24,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:24,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:24,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:59:24,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:59:24,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:24,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:24,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:24,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426626465] [2025-03-04 09:59:24,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426626465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:59:24,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914242982] [2025-03-04 09:59:24,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:24,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:59:24,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:59:24,233 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:59:24,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:59:24,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:59:24,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:59:24,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:24,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:24,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:59:24,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:59:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:24,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:59:24,421 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 7 treesize of output 5 [2025-03-04 09:59:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:24,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914242982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:59:24,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:59:24,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-04 09:59:24,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772959759] [2025-03-04 09:59:24,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:59:24,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:59:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:24,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:59:24,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:59:24,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 201 [2025-03-04 09:59:24,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 122 transitions, 282 flow. Second operand has 14 states, 14 states have (on average 38.92857142857143) internal successors, (545), 14 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:24,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:24,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 201 [2025-03-04 09:59:24,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:25,882 INFO L124 PetriNetUnfolderBase]: 13223/20981 cut-off events. [2025-03-04 09:59:25,883 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-03-04 09:59:25,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40565 conditions, 20981 events. 13223/20981 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 136959 event pairs, 11340 based on Foata normal form. 1/16304 useless extension candidates. Maximal degree in co-relation 40553. Up to 19387 conditions per place. [2025-03-04 09:59:25,972 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 90 selfloop transitions, 7 changer transitions 0/128 dead transitions. [2025-03-04 09:59:25,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 128 transitions, 490 flow [2025-03-04 09:59:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:59:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:59:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 357 transitions. [2025-03-04 09:59:25,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2537313432835821 [2025-03-04 09:59:25,974 INFO L175 Difference]: Start difference. First operand has 119 places, 122 transitions, 282 flow. Second operand 7 states and 357 transitions. [2025-03-04 09:59:25,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 128 transitions, 490 flow [2025-03-04 09:59:25,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 128 transitions, 480 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:59:26,119 INFO L231 Difference]: Finished difference. Result has 122 places, 123 transitions, 293 flow [2025-03-04 09:59:26,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=293, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2025-03-04 09:59:26,120 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -59 predicate places. [2025-03-04 09:59:26,120 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 293 flow [2025-03-04 09:59:26,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 38.92857142857143) internal successors, (545), 14 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:26,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:26,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:26,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 09:59:26,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:59:26,321 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:59:26,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:26,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1852167459, now seen corresponding path program 1 times [2025-03-04 09:59:26,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:26,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300500534] [2025-03-04 09:59:26,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:26,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:26,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:59:26,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:59:26,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:26,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:26,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:26,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300500534] [2025-03-04 09:59:26,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300500534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:59:26,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545349644] [2025-03-04 09:59:26,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:26,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:59:26,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:59:26,375 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:59:26,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:59:26,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:59:26,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:59:26,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:26,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:26,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:59:26,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:59:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:26,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:59:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:26,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545349644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:59:26,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:59:26,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:59:26,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903600464] [2025-03-04 09:59:26,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:59:26,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:59:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:26,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:59:26,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:59:26,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 201 [2025-03-04 09:59:26,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 293 flow. Second operand has 8 states, 8 states have (on average 39.25) internal successors, (314), 8 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:26,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:26,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 201 [2025-03-04 09:59:26,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:27,716 INFO L124 PetriNetUnfolderBase]: 13222/20979 cut-off events. [2025-03-04 09:59:27,716 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2025-03-04 09:59:27,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40568 conditions, 20979 events. 13222/20979 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 136929 event pairs, 11340 based on Foata normal form. 1/16303 useless extension candidates. Maximal degree in co-relation 40555. Up to 19387 conditions per place. [2025-03-04 09:59:27,813 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 88 selfloop transitions, 7 changer transitions 0/126 dead transitions. [2025-03-04 09:59:27,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 126 transitions, 494 flow [2025-03-04 09:59:27,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:59:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:59:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 318 transitions. [2025-03-04 09:59:27,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.263681592039801 [2025-03-04 09:59:27,815 INFO L175 Difference]: Start difference. First operand has 122 places, 123 transitions, 293 flow. Second operand 6 states and 318 transitions. [2025-03-04 09:59:27,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 126 transitions, 494 flow [2025-03-04 09:59:27,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 126 transitions, 483 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 09:59:27,818 INFO L231 Difference]: Finished difference. Result has 124 places, 123 transitions, 303 flow [2025-03-04 09:59:27,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=124, PETRI_TRANSITIONS=123} [2025-03-04 09:59:27,818 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -57 predicate places. [2025-03-04 09:59:27,818 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 123 transitions, 303 flow [2025-03-04 09:59:27,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 39.25) internal successors, (314), 8 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:27,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:27,818 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:27,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:59:28,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 09:59:28,023 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:59:28,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:28,023 INFO L85 PathProgramCache]: Analyzing trace with hash 473983391, now seen corresponding path program 2 times [2025-03-04 09:59:28,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:28,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008858808] [2025-03-04 09:59:28,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:59:28,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:28,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 09:59:28,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-04 09:59:28,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:59:28,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 09:59:28,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:28,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008858808] [2025-03-04 09:59:28,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008858808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:28,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:28,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:59:28,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487828749] [2025-03-04 09:59:28,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:28,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:59:28,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:28,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:59:28,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:59:28,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 201 [2025-03-04 09:59:28,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 123 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:28,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:28,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 201 [2025-03-04 09:59:28,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:29,469 INFO L124 PetriNetUnfolderBase]: 13222/20978 cut-off events. [2025-03-04 09:59:29,469 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2025-03-04 09:59:29,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40565 conditions, 20978 events. 13222/20978 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 136949 event pairs, 11340 based on Foata normal form. 0/16302 useless extension candidates. Maximal degree in co-relation 40552. Up to 19387 conditions per place. [2025-03-04 09:59:29,556 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 85 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2025-03-04 09:59:29,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 122 transitions, 475 flow [2025-03-04 09:59:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:59:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:59:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2025-03-04 09:59:29,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3416252072968491 [2025-03-04 09:59:29,557 INFO L175 Difference]: Start difference. First operand has 124 places, 123 transitions, 303 flow. Second operand 3 states and 206 transitions. [2025-03-04 09:59:29,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 122 transitions, 475 flow [2025-03-04 09:59:29,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 461 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:59:29,559 INFO L231 Difference]: Finished difference. Result has 121 places, 122 transitions, 291 flow [2025-03-04 09:59:29,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=291, PETRI_PLACES=121, PETRI_TRANSITIONS=122} [2025-03-04 09:59:29,559 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -60 predicate places. [2025-03-04 09:59:29,559 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 122 transitions, 291 flow [2025-03-04 09:59:29,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:29,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:29,559 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:29,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:59:29,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:59:29,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1412540061, now seen corresponding path program 1 times [2025-03-04 09:59:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256386084] [2025-03-04 09:59:29,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:29,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:59:29,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:59:29,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:29,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 09:59:29,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:29,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256386084] [2025-03-04 09:59:29,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256386084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:29,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:29,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:59:29,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276794218] [2025-03-04 09:59:29,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:29,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:59:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:29,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:59:29,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:59:29,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-03-04 09:59:29,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:29,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:29,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-03-04 09:59:29,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:30,652 INFO L124 PetriNetUnfolderBase]: 13222/20966 cut-off events. [2025-03-04 09:59:30,652 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-03-04 09:59:30,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40548 conditions, 20966 events. 13222/20966 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 136850 event pairs, 11340 based on Foata normal form. 2175/18477 useless extension candidates. Maximal degree in co-relation 40535. Up to 19396 conditions per place. [2025-03-04 09:59:30,735 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 86 selfloop transitions, 1 changer transitions 0/120 dead transitions. [2025-03-04 09:59:30,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 461 flow [2025-03-04 09:59:30,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:59:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:59:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2025-03-04 09:59:30,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-03-04 09:59:30,736 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 291 flow. Second operand 3 states and 201 transitions. [2025-03-04 09:59:30,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 461 flow [2025-03-04 09:59:30,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 120 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:59:30,738 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 285 flow [2025-03-04 09:59:30,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2025-03-04 09:59:30,739 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -62 predicate places. [2025-03-04 09:59:30,739 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 285 flow [2025-03-04 09:59:30,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:30,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:30,739 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:30,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:59:30,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:59:30,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:30,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1412540060, now seen corresponding path program 1 times [2025-03-04 09:59:30,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:30,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135278741] [2025-03-04 09:59:30,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:30,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:30,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:59:30,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:59:30,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:30,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 09:59:30,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:30,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135278741] [2025-03-04 09:59:30,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135278741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:30,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:30,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:59:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46862474] [2025-03-04 09:59:30,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:30,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:59:30,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:30,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:59:30,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:59:30,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-03-04 09:59:30,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:30,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:30,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-03-04 09:59:30,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:31,766 INFO L124 PetriNetUnfolderBase]: 11052/18212 cut-off events. [2025-03-04 09:59:31,767 INFO L125 PetriNetUnfolderBase]: For 422/522 co-relation queries the response was YES. [2025-03-04 09:59:31,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34761 conditions, 18212 events. 11052/18212 cut-off events. For 422/522 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 126015 event pairs, 5552 based on Foata normal form. 2085/16119 useless extension candidates. Maximal degree in co-relation 34748. Up to 12864 conditions per place. [2025-03-04 09:59:31,842 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 157 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2025-03-04 09:59:31,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 193 transitions, 761 flow [2025-03-04 09:59:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:59:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:59:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 316 transitions. [2025-03-04 09:59:31,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39303482587064675 [2025-03-04 09:59:31,844 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 285 flow. Second operand 4 states and 316 transitions. [2025-03-04 09:59:31,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 193 transitions, 761 flow [2025-03-04 09:59:31,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 193 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:59:31,846 INFO L231 Difference]: Finished difference. Result has 122 places, 122 transitions, 312 flow [2025-03-04 09:59:31,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=122, PETRI_TRANSITIONS=122} [2025-03-04 09:59:31,847 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -59 predicate places. [2025-03-04 09:59:31,847 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 122 transitions, 312 flow [2025-03-04 09:59:31,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:31,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:31,847 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:31,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:59:31,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:59:31,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:31,848 INFO L85 PathProgramCache]: Analyzing trace with hash 34054456, now seen corresponding path program 1 times [2025-03-04 09:59:31,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:31,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832744906] [2025-03-04 09:59:31,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:31,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:31,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:59:31,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:59:31,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:31,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 09:59:31,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:31,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832744906] [2025-03-04 09:59:31,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832744906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:31,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:31,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:59:31,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139035350] [2025-03-04 09:59:31,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:31,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:59:31,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:31,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:59:31,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:59:32,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-03-04 09:59:32,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:32,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:32,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-03-04 09:59:32,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:33,507 INFO L124 PetriNetUnfolderBase]: 10918/19267 cut-off events. [2025-03-04 09:59:33,507 INFO L125 PetriNetUnfolderBase]: For 3927/4029 co-relation queries the response was YES. [2025-03-04 09:59:33,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38988 conditions, 19267 events. 10918/19267 cut-off events. For 3927/4029 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 151539 event pairs, 1953 based on Foata normal form. 193/16292 useless extension candidates. Maximal degree in co-relation 38973. Up to 10149 conditions per place. [2025-03-04 09:59:33,610 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 223 selfloop transitions, 7 changer transitions 1/262 dead transitions. [2025-03-04 09:59:33,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 262 transitions, 1060 flow [2025-03-04 09:59:33,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:59:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:59:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2025-03-04 09:59:33,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4208955223880597 [2025-03-04 09:59:33,612 INFO L175 Difference]: Start difference. First operand has 122 places, 122 transitions, 312 flow. Second operand 5 states and 423 transitions. [2025-03-04 09:59:33,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 262 transitions, 1060 flow [2025-03-04 09:59:33,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 262 transitions, 1059 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:59:33,618 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 333 flow [2025-03-04 09:59:33,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=126, PETRI_TRANSITIONS=121} [2025-03-04 09:59:33,618 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -55 predicate places. [2025-03-04 09:59:33,619 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 333 flow [2025-03-04 09:59:33,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:33,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:33,619 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:33,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 09:59:33,619 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:59:33,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:33,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2014227605, now seen corresponding path program 1 times [2025-03-04 09:59:33,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:33,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251970247] [2025-03-04 09:59:33,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:33,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:33,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 09:59:33,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 09:59:33,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:33,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 09:59:33,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:33,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251970247] [2025-03-04 09:59:33,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251970247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:33,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:33,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:59:33,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566949115] [2025-03-04 09:59:33,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:33,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:59:33,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:33,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:59:33,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:59:33,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-03-04 09:59:33,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 121 transitions, 333 flow. Second operand has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:33,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:33,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-03-04 09:59:33,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:59:34,682 INFO L124 PetriNetUnfolderBase]: 5996/11688 cut-off events. [2025-03-04 09:59:34,682 INFO L125 PetriNetUnfolderBase]: For 5923/5923 co-relation queries the response was YES. [2025-03-04 09:59:34,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24155 conditions, 11688 events. 5996/11688 cut-off events. For 5923/5923 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 94572 event pairs, 126 based on Foata normal form. 2178/12140 useless extension candidates. Maximal degree in co-relation 24138. Up to 6736 conditions per place. [2025-03-04 09:59:34,729 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 182 selfloop transitions, 4 changer transitions 0/214 dead transitions. [2025-03-04 09:59:34,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 214 transitions, 857 flow [2025-03-04 09:59:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:59:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:59:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2025-03-04 09:59:34,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34328358208955223 [2025-03-04 09:59:34,731 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 333 flow. Second operand 6 states and 414 transitions. [2025-03-04 09:59:34,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 214 transitions, 857 flow [2025-03-04 09:59:34,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 214 transitions, 842 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-04 09:59:34,735 INFO L231 Difference]: Finished difference. Result has 116 places, 110 transitions, 270 flow [2025-03-04 09:59:34,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=116, PETRI_TRANSITIONS=110} [2025-03-04 09:59:34,735 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -65 predicate places. [2025-03-04 09:59:34,735 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 110 transitions, 270 flow [2025-03-04 09:59:34,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:34,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:34,736 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:34,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 09:59:34,736 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:59:34,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1983454533, now seen corresponding path program 1 times [2025-03-04 09:59:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:34,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231671388] [2025-03-04 09:59:34,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:34,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:34,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:59:34,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:59:34,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:34,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:59:34,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:59:34,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:59:34,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:59:34,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:34,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:59:34,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:59:34,774 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:59:34,774 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (124 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (111 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 125 remaining) [2025-03-04 09:59:34,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONMEMORY_LEAK (102 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 125 remaining) [2025-03-04 09:59:34,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 125 remaining) [2025-03-04 09:59:34,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONMEMORY_LEAK (65 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 125 remaining) [2025-03-04 09:59:34,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 125 remaining) [2025-03-04 09:59:34,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 125 remaining) [2025-03-04 09:59:34,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONMEMORY_LEAK (28 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 125 remaining) [2025-03-04 09:59:34,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 125 remaining) [2025-03-04 09:59:34,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 09:59:34,781 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:59:34,782 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:59:34,782 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 09:59:34,829 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 09:59:34,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 285 transitions, 597 flow [2025-03-04 09:59:34,852 INFO L124 PetriNetUnfolderBase]: 42/366 cut-off events. [2025-03-04 09:59:34,853 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 09:59:34,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 366 events. 42/366 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2139 event pairs, 1 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 291. Up to 12 conditions per place. [2025-03-04 09:59:34,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 285 transitions, 597 flow [2025-03-04 09:59:34,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 285 transitions, 597 flow [2025-03-04 09:59:34,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:59:34,865 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;@797af045, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:59:34,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 162 error locations. [2025-03-04 09:59:34,866 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:59:34,866 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-04 09:59:34,866 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:59:34,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:59:34,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 09:59:34,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2025-03-04 09:59:34,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:59:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash 33491, now seen corresponding path program 1 times [2025-03-04 09:59:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:59:34,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600842416] [2025-03-04 09:59:34,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:59:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:59:34,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 09:59:34,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 09:59:34,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:59:34,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:59:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:59:34,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:59:34,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600842416] [2025-03-04 09:59:34,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600842416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:59:34,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:59:34,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:59:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25371230] [2025-03-04 09:59:34,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:59:34,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:59:34,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:59:34,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:59:34,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:59:34,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 285 [2025-03-04 09:59:34,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 285 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:59:34,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:59:34,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 285 [2025-03-04 09:59:34,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand