./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:02:05,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:02:05,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:02:05,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:02:05,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:02:05,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:02:05,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:02:05,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:02:05,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:02:05,795 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:02:05,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:02:05,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:02:05,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:02:05,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:02:05,798 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:02:05,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:02:05,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:02:05,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:02:05,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:02:05,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:02:05,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:02:05,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:02:05,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:02:05,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:02:05,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:02:05,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:02:05,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:02:05,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:02:05,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:02:05,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:02:05,800 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 ! call(reach_error())) ) 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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2025-03-04 02:02:06,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:02:06,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:02:06,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:02:06,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:02:06,066 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:02:06,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2025-03-04 02:02:07,240 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d0025f2/c9c32d463efe4b52ab9ac8621b760b96/FLAGe9a90416b [2025-03-04 02:02:07,557 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:02:07,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2025-03-04 02:02:07,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d0025f2/c9c32d463efe4b52ab9ac8621b760b96/FLAGe9a90416b [2025-03-04 02:02:07,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d0025f2/c9c32d463efe4b52ab9ac8621b760b96 [2025-03-04 02:02:07,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:02:07,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:02:07,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:02:07,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:02:07,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:02:07,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:02:07" (1/1) ... [2025-03-04 02:02:07,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a60cc39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:07, skipping insertion in model container [2025-03-04 02:02:07,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:02:07" (1/1) ... [2025-03-04 02:02:07,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:02:08,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2025-03-04 02:02:08,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:02:08,087 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:02:08,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2025-03-04 02:02:08,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:02:08,141 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:02:08,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08 WrapperNode [2025-03-04 02:02:08,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:02:08,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:02:08,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:02:08,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:02:08,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08" (1/1) ... [2025-03-04 02:02:08,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08" (1/1) ... [2025-03-04 02:02:08,173 INFO L138 Inliner]: procedures = 172, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2025-03-04 02:02:08,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:02:08,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:02:08,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:02:08,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:02:08,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08" (1/1) ... [2025-03-04 02:02:08,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08" (1/1) ... [2025-03-04 02:02:08,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08" (1/1) ... [2025-03-04 02:02:08,196 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:02:08,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08" (1/1) ... [2025-03-04 02:02:08,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08" (1/1) ... [2025-03-04 02:02:08,201 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08" (1/1) ... [2025-03-04 02:02:08,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08" (1/1) ... [2025-03-04 02:02:08,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08" (1/1) ... [2025-03-04 02:02:08,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08" (1/1) ... [2025-03-04 02:02:08,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:02:08,209 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:02:08,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:02:08,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:02:08,213 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08" (1/1) ... [2025-03-04 02:02:08,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:02:08,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:08,242 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 02:02:08,245 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 02:02:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:02:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:02:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-03-04 02:02:08,262 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-03-04 02:02:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:02:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:02:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:02:08,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:02:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-03-04 02:02:08,263 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-03-04 02:02:08,264 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 02:02:08,357 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:02:08,359 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:02:08,463 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:02:08,463 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:02:08,521 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:02:08,522 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:02:08,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:02:08 BoogieIcfgContainer [2025-03-04 02:02:08,522 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:02:08,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:02:08,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:02:08,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:02:08,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:02:07" (1/3) ... [2025-03-04 02:02:08,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3381b1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:02:08, skipping insertion in model container [2025-03-04 02:02:08,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:08" (2/3) ... [2025-03-04 02:02:08,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3381b1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:02:08, skipping insertion in model container [2025-03-04 02:02:08,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:02:08" (3/3) ... [2025-03-04 02:02:08,529 INFO L128 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2025-03-04 02:02:08,539 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:02:08,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG read_write_lock-2.i that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:02:08,541 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:02:08,587 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 02:02:08,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 136 flow [2025-03-04 02:02:08,640 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2025-03-04 02:02:08,643 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:02:08,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 50 events. 2/50 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-03-04 02:02:08,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 136 flow [2025-03-04 02:02:08,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 48 transitions, 117 flow [2025-03-04 02:02:08,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:08,664 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=LoopHeads, 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;@20d792be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:08,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 02:02:08,674 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:08,674 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2025-03-04 02:02:08,674 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:02:08,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:08,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:08,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:08,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:08,681 INFO L85 PathProgramCache]: Analyzing trace with hash -751108846, now seen corresponding path program 1 times [2025-03-04 02:02:08,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:08,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847267653] [2025-03-04 02:02:08,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:08,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:08,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:02:08,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:02:08,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:08,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:08,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 02:02:08,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:08,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847267653] [2025-03-04 02:02:08,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847267653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:08,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:08,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:02:08,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053807475] [2025-03-04 02:02:08,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:08,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:02:08,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:08,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:02:08,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:02:08,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-03-04 02:02:08,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 02:02:08,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:08,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-03-04 02:02:08,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:12,225 INFO L124 PetriNetUnfolderBase]: 44177/63149 cut-off events. [2025-03-04 02:02:12,226 INFO L125 PetriNetUnfolderBase]: For 4835/4835 co-relation queries the response was YES. [2025-03-04 02:02:12,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125851 conditions, 63149 events. 44177/63149 cut-off events. For 4835/4835 co-relation queries the response was YES. Maximal size of possible extension queue 1979. Compared 433139 event pairs, 5142 based on Foata normal form. 2570/63965 useless extension candidates. Maximal degree in co-relation 113315. Up to 17005 conditions per place. [2025-03-04 02:02:12,484 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 224 selfloop transitions, 37 changer transitions 18/285 dead transitions. [2025-03-04 02:02:12,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 285 transitions, 1236 flow [2025-03-04 02:02:12,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:02:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:02:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 425 transitions. [2025-03-04 02:02:12,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054131054131054 [2025-03-04 02:02:12,499 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 117 flow. Second operand 13 states and 425 transitions. [2025-03-04 02:02:12,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 285 transitions, 1236 flow [2025-03-04 02:02:12,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 285 transitions, 1172 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 02:02:12,592 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 343 flow [2025-03-04 02:02:12,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=343, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2025-03-04 02:02:12,597 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 13 predicate places. [2025-03-04 02:02:12,599 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 85 transitions, 343 flow [2025-03-04 02:02:12,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 02:02:12,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:12,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:12,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:02:12,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:12,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:12,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1738483487, now seen corresponding path program 1 times [2025-03-04 02:02:12,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:12,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739254581] [2025-03-04 02:02:12,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:12,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:12,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:02:12,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:02:12,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:12,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:12,665 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 02:02:12,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:12,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739254581] [2025-03-04 02:02:12,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739254581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:12,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:12,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:02:12,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425398165] [2025-03-04 02:02:12,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:12,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:12,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:12,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:12,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:12,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2025-03-04 02:02:12,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 02:02:12,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:12,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2025-03-04 02:02:12,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:14,605 INFO L124 PetriNetUnfolderBase]: 28756/43172 cut-off events. [2025-03-04 02:02:14,605 INFO L125 PetriNetUnfolderBase]: For 15052/15258 co-relation queries the response was YES. [2025-03-04 02:02:14,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101534 conditions, 43172 events. 28756/43172 cut-off events. For 15052/15258 co-relation queries the response was YES. Maximal size of possible extension queue 1412. Compared 303367 event pairs, 9980 based on Foata normal form. 2426/44848 useless extension candidates. Maximal degree in co-relation 95764. Up to 21658 conditions per place. [2025-03-04 02:02:14,858 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 113 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2025-03-04 02:02:14,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 127 transitions, 732 flow [2025-03-04 02:02:14,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:02:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:02:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-04 02:02:14,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2025-03-04 02:02:14,860 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 343 flow. Second operand 3 states and 105 transitions. [2025-03-04 02:02:14,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 127 transitions, 732 flow [2025-03-04 02:02:15,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 127 transitions, 732 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:15,348 INFO L231 Difference]: Finished difference. Result has 75 places, 85 transitions, 359 flow [2025-03-04 02:02:15,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=359, PETRI_PLACES=75, PETRI_TRANSITIONS=85} [2025-03-04 02:02:15,348 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 16 predicate places. [2025-03-04 02:02:15,348 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 85 transitions, 359 flow [2025-03-04 02:02:15,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 02:02:15,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:15,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:15,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:02:15,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:15,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:15,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1265264065, now seen corresponding path program 2 times [2025-03-04 02:02:15,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:15,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914095557] [2025-03-04 02:02:15,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:02:15,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:15,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:02:15,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:02:15,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:02:15,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:15,431 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 02:02:15,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:15,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914095557] [2025-03-04 02:02:15,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914095557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:15,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:15,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:02:15,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734271550] [2025-03-04 02:02:15,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:15,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:02:15,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:15,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:02:15,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:02:15,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2025-03-04 02:02:15,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 85 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 02:02:15,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:15,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2025-03-04 02:02:15,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:16,461 INFO L124 PetriNetUnfolderBase]: 16172/25341 cut-off events. [2025-03-04 02:02:16,461 INFO L125 PetriNetUnfolderBase]: For 17273/17353 co-relation queries the response was YES. [2025-03-04 02:02:16,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61946 conditions, 25341 events. 16172/25341 cut-off events. For 17273/17353 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 178500 event pairs, 4364 based on Foata normal form. 1450/26491 useless extension candidates. Maximal degree in co-relation 58503. Up to 10523 conditions per place. [2025-03-04 02:02:16,563 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 116 selfloop transitions, 7 changer transitions 30/163 dead transitions. [2025-03-04 02:02:16,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 163 transitions, 947 flow [2025-03-04 02:02:16,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:02:16,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:02:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2025-03-04 02:02:16,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-03-04 02:02:16,565 INFO L175 Difference]: Start difference. First operand has 75 places, 85 transitions, 359 flow. Second operand 4 states and 150 transitions. [2025-03-04 02:02:16,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 163 transitions, 947 flow [2025-03-04 02:02:16,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 163 transitions, 931 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:02:16,739 INFO L231 Difference]: Finished difference. Result has 79 places, 84 transitions, 377 flow [2025-03-04 02:02:16,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=79, PETRI_TRANSITIONS=84} [2025-03-04 02:02:16,739 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2025-03-04 02:02:16,740 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 84 transitions, 377 flow [2025-03-04 02:02:16,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 02:02:16,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:16,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:16,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:02:16,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:16,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:16,740 INFO L85 PathProgramCache]: Analyzing trace with hash -830962651, now seen corresponding path program 1 times [2025-03-04 02:02:16,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:16,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084534373] [2025-03-04 02:02:16,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:16,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:16,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:02:16,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:02:16,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:16,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:16,788 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 02:02:16,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:16,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084534373] [2025-03-04 02:02:16,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084534373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:16,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:16,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:02:16,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4771540] [2025-03-04 02:02:16,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:16,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:02:16,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:16,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:02:16,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:02:16,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-03-04 02:02:16,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 84 transitions, 377 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:16,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:16,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-03-04 02:02:16,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:18,427 INFO L124 PetriNetUnfolderBase]: 19624/29929 cut-off events. [2025-03-04 02:02:18,427 INFO L125 PetriNetUnfolderBase]: For 23032/23192 co-relation queries the response was YES. [2025-03-04 02:02:18,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77770 conditions, 29929 events. 19624/29929 cut-off events. For 23032/23192 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 204297 event pairs, 3182 based on Foata normal form. 0/29682 useless extension candidates. Maximal degree in co-relation 74955. Up to 7174 conditions per place. [2025-03-04 02:02:18,541 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 210 selfloop transitions, 51 changer transitions 76/345 dead transitions. [2025-03-04 02:02:18,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 345 transitions, 2174 flow [2025-03-04 02:02:18,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:02:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:02:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 396 transitions. [2025-03-04 02:02:18,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2025-03-04 02:02:18,542 INFO L175 Difference]: Start difference. First operand has 79 places, 84 transitions, 377 flow. Second operand 13 states and 396 transitions. [2025-03-04 02:02:18,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 345 transitions, 2174 flow [2025-03-04 02:02:18,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 345 transitions, 2125 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-04 02:02:18,795 INFO L231 Difference]: Finished difference. Result has 100 places, 123 transitions, 784 flow [2025-03-04 02:02:18,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=784, PETRI_PLACES=100, PETRI_TRANSITIONS=123} [2025-03-04 02:02:18,795 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 41 predicate places. [2025-03-04 02:02:18,795 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 123 transitions, 784 flow [2025-03-04 02:02:18,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:18,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:18,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:18,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:02:18,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:18,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:18,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1909764955, now seen corresponding path program 1 times [2025-03-04 02:02:18,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:18,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785194116] [2025-03-04 02:02:18,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:18,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:18,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:02:18,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:02:18,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:18,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:18,867 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 02:02:18,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:18,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785194116] [2025-03-04 02:02:18,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785194116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:18,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:18,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:02:18,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765561480] [2025-03-04 02:02:18,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:18,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:02:18,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:18,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:02:18,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:02:18,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-03-04 02:02:18,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 123 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 02:02:18,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:18,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-03-04 02:02:18,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:20,774 INFO L124 PetriNetUnfolderBase]: 18427/28390 cut-off events. [2025-03-04 02:02:20,774 INFO L125 PetriNetUnfolderBase]: For 31354/31451 co-relation queries the response was YES. [2025-03-04 02:02:20,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84197 conditions, 28390 events. 18427/28390 cut-off events. For 31354/31451 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 196711 event pairs, 3356 based on Foata normal form. 234/28622 useless extension candidates. Maximal degree in co-relation 80872. Up to 7317 conditions per place. [2025-03-04 02:02:20,977 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 182 selfloop transitions, 56 changer transitions 56/301 dead transitions. [2025-03-04 02:02:20,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 301 transitions, 2162 flow [2025-03-04 02:02:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:02:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:02:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 352 transitions. [2025-03-04 02:02:20,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5014245014245015 [2025-03-04 02:02:20,979 INFO L175 Difference]: Start difference. First operand has 100 places, 123 transitions, 784 flow. Second operand 13 states and 352 transitions. [2025-03-04 02:02:20,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 301 transitions, 2162 flow [2025-03-04 02:02:21,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 301 transitions, 2140 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 02:02:21,613 INFO L231 Difference]: Finished difference. Result has 116 places, 132 transitions, 990 flow [2025-03-04 02:02:21,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=990, PETRI_PLACES=116, PETRI_TRANSITIONS=132} [2025-03-04 02:02:21,614 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 57 predicate places. [2025-03-04 02:02:21,614 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 132 transitions, 990 flow [2025-03-04 02:02:21,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 02:02:21,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:21,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:21,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:02:21,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:21,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash 167368195, now seen corresponding path program 1 times [2025-03-04 02:02:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136515784] [2025-03-04 02:02:21,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:21,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:02:21,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:02:21,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:21,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:21,663 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 02:02:21,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:21,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136515784] [2025-03-04 02:02:21,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136515784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:21,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:21,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:02:21,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287417362] [2025-03-04 02:02:21,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:21,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:02:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:21,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:02:21,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:02:21,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-03-04 02:02:21,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 132 transitions, 990 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 02:02:21,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:21,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-03-04 02:02:21,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:23,284 INFO L124 PetriNetUnfolderBase]: 16862/26063 cut-off events. [2025-03-04 02:02:23,284 INFO L125 PetriNetUnfolderBase]: For 35551/35554 co-relation queries the response was YES. [2025-03-04 02:02:23,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80422 conditions, 26063 events. 16862/26063 cut-off events. For 35551/35554 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 178591 event pairs, 3501 based on Foata normal form. 245/26306 useless extension candidates. Maximal degree in co-relation 79820. Up to 7784 conditions per place. [2025-03-04 02:02:23,467 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 192 selfloop transitions, 59 changer transitions 52/312 dead transitions. [2025-03-04 02:02:23,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 312 transitions, 2414 flow [2025-03-04 02:02:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:02:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:02:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 353 transitions. [2025-03-04 02:02:23,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5028490028490028 [2025-03-04 02:02:23,468 INFO L175 Difference]: Start difference. First operand has 116 places, 132 transitions, 990 flow. Second operand 13 states and 353 transitions. [2025-03-04 02:02:23,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 312 transitions, 2414 flow [2025-03-04 02:02:23,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 312 transitions, 2376 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 02:02:23,847 INFO L231 Difference]: Finished difference. Result has 129 places, 146 transitions, 1227 flow [2025-03-04 02:02:23,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1227, PETRI_PLACES=129, PETRI_TRANSITIONS=146} [2025-03-04 02:02:23,848 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 70 predicate places. [2025-03-04 02:02:23,848 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 146 transitions, 1227 flow [2025-03-04 02:02:23,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 02:02:23,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:23,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:23,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:02:23,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:23,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:23,849 INFO L85 PathProgramCache]: Analyzing trace with hash 188565684, now seen corresponding path program 1 times [2025-03-04 02:02:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:23,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602384563] [2025-03-04 02:02:23,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:23,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:23,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:02:23,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:02:23,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:23,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:24,083 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 02:02:24,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:24,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602384563] [2025-03-04 02:02:24,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602384563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:24,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:24,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:02:24,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409054039] [2025-03-04 02:02:24,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:24,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:02:24,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:24,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:02:24,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:02:24,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2025-03-04 02:02:24,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 146 transitions, 1227 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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 02:02:24,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:24,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2025-03-04 02:02:24,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:25,864 INFO L124 PetriNetUnfolderBase]: 13786/22047 cut-off events. [2025-03-04 02:02:25,864 INFO L125 PetriNetUnfolderBase]: For 40457/40548 co-relation queries the response was YES. [2025-03-04 02:02:25,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70904 conditions, 22047 events. 13786/22047 cut-off events. For 40457/40548 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 156085 event pairs, 3656 based on Foata normal form. 326/22367 useless extension candidates. Maximal degree in co-relation 70263. Up to 8919 conditions per place. [2025-03-04 02:02:25,952 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 163 selfloop transitions, 11 changer transitions 49/235 dead transitions. [2025-03-04 02:02:25,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 235 transitions, 2087 flow [2025-03-04 02:02:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:02:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:02:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2025-03-04 02:02:25,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 02:02:25,953 INFO L175 Difference]: Start difference. First operand has 129 places, 146 transitions, 1227 flow. Second operand 7 states and 210 transitions. [2025-03-04 02:02:25,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 235 transitions, 2087 flow [2025-03-04 02:02:26,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 235 transitions, 2039 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-04 02:02:26,337 INFO L231 Difference]: Finished difference. Result has 132 places, 132 transitions, 1065 flow [2025-03-04 02:02:26,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1065, PETRI_PLACES=132, PETRI_TRANSITIONS=132} [2025-03-04 02:02:26,338 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 73 predicate places. [2025-03-04 02:02:26,338 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 132 transitions, 1065 flow [2025-03-04 02:02:26,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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 02:02:26,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:26,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:26,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:02:26,338 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:26,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:26,339 INFO L85 PathProgramCache]: Analyzing trace with hash -705054204, now seen corresponding path program 2 times [2025-03-04 02:02:26,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:26,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762444772] [2025-03-04 02:02:26,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:02:26,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:26,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:02:26,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:02:26,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:02:26,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:26,353 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:02:26,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:02:26,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:02:26,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:26,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:26,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:02:26,383 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:02:26,384 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-03-04 02:02:26,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-04 02:02:26,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-04 02:02:26,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 02:02:26,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-04 02:02:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-04 02:02:26,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-04 02:02:26,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:02:26,390 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-04 02:02:26,431 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:02:26,432 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:02:26,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:02:26 BasicIcfg [2025-03-04 02:02:26,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:02:26,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:02:26,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:02:26,438 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:02:26,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:02:08" (3/4) ... [2025-03-04 02:02:26,440 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 02:02:26,487 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 18. [2025-03-04 02:02:26,524 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:02:26,524 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:02:26,525 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:02:26,525 INFO L158 Benchmark]: Toolchain (without parser) took 18726.00ms. Allocated memory was 142.6MB in the beginning and 5.9GB in the end (delta: 5.8GB). Free memory was 104.6MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-03-04 02:02:26,525 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:02:26,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.24ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 84.1MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:02:26,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.20ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:02:26,526 INFO L158 Benchmark]: Boogie Preprocessor took 34.73ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 81.3MB in the end (delta: 944.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:02:26,526 INFO L158 Benchmark]: IcfgBuilder took 313.36ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 61.7MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:02:26,526 INFO L158 Benchmark]: TraceAbstraction took 17913.36ms. Allocated memory was 142.6MB in the beginning and 5.9GB in the end (delta: 5.8GB). Free memory was 60.8MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2025-03-04 02:02:26,526 INFO L158 Benchmark]: Witness Printer took 86.93ms. Allocated memory is still 5.9GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:02:26,530 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.24ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 84.1MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.20ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.73ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 81.3MB in the end (delta: 944.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 313.36ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 61.7MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17913.36ms. Allocated memory was 142.6MB in the beginning and 5.9GB in the end (delta: 5.8GB). Free memory was 60.8MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 86.93ms. Allocated memory is still 5.9GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 738]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-2, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-2, t2=-1, w=0, x=0, y=0] [L724] 2 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1=-2, t2=-1, t3=0, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=0, t1=-2, t2=-1, t3=0, t4=1, w=0, x=0, y=0] [L724] 4 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L730] 4 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L733] 4 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L716] 1 x = 3 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] [L738] 4 reach_error() VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 76 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 920 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 917 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2632 IncrementalHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 7 mSDtfsCounter, 2632 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1227occurred in iteration=6, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-04 02:02:26,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE