./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe013_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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-wmm/safe013_tso.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 0cdeed82108b12e5d5525e3abe542fd48b9a422ac7475147d5db7c8538ce4dc0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:53:10,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:53:10,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:53:10,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:53:10,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:53:10,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:53:10,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:53:10,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:53:10,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:53:10,321 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:53:10,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:53:10,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:53:10,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:53:10,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:53:10,322 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:53:10,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:53:10,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:53:10,322 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:53:10,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:53:10,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:53:10,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:53:10,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:53:10,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:53:10,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:53:10,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:53:10,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:53:10,323 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:53:10,323 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:53:10,323 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:53:10,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:53:10,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:53:10,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:53:10,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:53:10,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:53:10,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:53:10,324 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:53:10,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:53:10,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:53:10,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:53:10,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:53:10,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:53:10,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:53:10,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:53:10,324 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 -> 0cdeed82108b12e5d5525e3abe542fd48b9a422ac7475147d5db7c8538ce4dc0 [2025-03-14 00:53:10,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:53:10,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:53:10,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:53:10,531 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:53:10,531 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:53:10,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe013_tso.i [2025-03-14 00:53:11,644 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67393d2fc/3bf784051a924d719531cc98ad713d45/FLAGde82526a7 [2025-03-14 00:53:11,888 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:53:11,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe013_tso.i [2025-03-14 00:53:11,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67393d2fc/3bf784051a924d719531cc98ad713d45/FLAGde82526a7 [2025-03-14 00:53:12,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67393d2fc/3bf784051a924d719531cc98ad713d45 [2025-03-14 00:53:12,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:53:12,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:53:12,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:53:12,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:53:12,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:53:12,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67366e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12, skipping insertion in model container [2025-03-14 00:53:12,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:53:12,367 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-wmm/safe013_tso.i[945,958] [2025-03-14 00:53:12,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:53:12,521 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:53:12,529 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-wmm/safe013_tso.i[945,958] [2025-03-14 00:53:12,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:53:12,577 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:53:12,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12 WrapperNode [2025-03-14 00:53:12,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:53:12,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:53:12,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:53:12,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:53:12,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,615 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-03-14 00:53:12,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:53:12,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:53:12,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:53:12,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:53:12,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,646 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-14 00:53:12,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,656 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:53:12,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:53:12,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:53:12,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:53:12,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12" (1/1) ... [2025-03-14 00:53:12,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:53:12,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:53:12,698 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-14 00:53:12,701 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-14 00:53:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 00:53:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:53:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-14 00:53:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-14 00:53:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-14 00:53:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-14 00:53:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-14 00:53:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-14 00:53:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:53:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 00:53:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:53:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:53:12,724 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:53:12,823 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:53:12,824 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:53:12,980 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:53:12,981 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:53:12,981 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:53:13,084 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:53:13,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:53:13 BoogieIcfgContainer [2025-03-14 00:53:13,086 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:53:13,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:53:13,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:53:13,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:53:13,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:53:12" (1/3) ... [2025-03-14 00:53:13,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b43a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:53:13, skipping insertion in model container [2025-03-14 00:53:13,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:12" (2/3) ... [2025-03-14 00:53:13,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b43a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:53:13, skipping insertion in model container [2025-03-14 00:53:13,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:53:13" (3/3) ... [2025-03-14 00:53:13,093 INFO L128 eAbstractionObserver]: Analyzing ICFG safe013_tso.i [2025-03-14 00:53:13,104 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:53:13,105 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe013_tso.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-14 00:53:13,105 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:53:13,145 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:53:13,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2025-03-14 00:53:13,202 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-03-14 00:53:13,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:53:13,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-03-14 00:53:13,206 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2025-03-14 00:53:13,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2025-03-14 00:53:13,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:53:13,225 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;@5b9a31b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:53:13,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 00:53:13,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:53:13,236 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-14 00:53:13,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:53:13,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:13,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:13,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:13,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash -193255488, now seen corresponding path program 1 times [2025-03-14 00:53:13,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:13,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044687567] [2025-03-14 00:53:13,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:13,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:13,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:53:13,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:53:13,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:13,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:13,680 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-14 00:53:13,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044687567] [2025-03-14 00:53:13,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044687567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:13,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:13,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:53:13,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202983473] [2025-03-14 00:53:13,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:13,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:53:13,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:13,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:53:13,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:53:13,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:53:13,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-14 00:53:13,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:13,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:53:13,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:14,767 INFO L124 PetriNetUnfolderBase]: 9158/13425 cut-off events. [2025-03-14 00:53:14,767 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-14 00:53:14,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26729 conditions, 13425 events. 9158/13425 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 79846 event pairs, 2752 based on Foata normal form. 396/13819 useless extension candidates. Maximal degree in co-relation 26718. Up to 6347 conditions per place. [2025-03-14 00:53:14,840 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 49 selfloop transitions, 5 changer transitions 65/123 dead transitions. [2025-03-14 00:53:14,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 123 transitions, 499 flow [2025-03-14 00:53:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:53:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:53:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2025-03-14 00:53:14,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227106227106227 [2025-03-14 00:53:14,856 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 7 states and 170 transitions. [2025-03-14 00:53:14,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 123 transitions, 499 flow [2025-03-14 00:53:14,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 123 transitions, 494 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:53:14,868 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 121 flow [2025-03-14 00:53:14,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=121, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2025-03-14 00:53:14,875 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2025-03-14 00:53:14,875 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 121 flow [2025-03-14 00:53:14,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-14 00:53:14,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:14,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:14,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:53:14,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:14,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:14,878 INFO L85 PathProgramCache]: Analyzing trace with hash -256452095, now seen corresponding path program 1 times [2025-03-14 00:53:14,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:14,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922939275] [2025-03-14 00:53:14,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:14,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:14,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:53:14,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:53:14,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:14,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:15,036 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-14 00:53:15,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:15,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922939275] [2025-03-14 00:53:15,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922939275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:15,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:15,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:15,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437573559] [2025-03-14 00:53:15,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:15,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:15,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:15,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:15,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:15,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:53:15,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:53:15,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:15,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:53:15,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:15,980 INFO L124 PetriNetUnfolderBase]: 8376/12336 cut-off events. [2025-03-14 00:53:15,981 INFO L125 PetriNetUnfolderBase]: For 6254/6266 co-relation queries the response was YES. [2025-03-14 00:53:16,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30092 conditions, 12336 events. 8376/12336 cut-off events. For 6254/6266 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 71428 event pairs, 900 based on Foata normal form. 312/12643 useless extension candidates. Maximal degree in co-relation 30077. Up to 5249 conditions per place. [2025-03-14 00:53:16,054 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 59 selfloop transitions, 6 changer transitions 80/149 dead transitions. [2025-03-14 00:53:16,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 149 transitions, 716 flow [2025-03-14 00:53:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:53:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:53:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2025-03-14 00:53:16,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5564102564102564 [2025-03-14 00:53:16,057 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 121 flow. Second operand 10 states and 217 transitions. [2025-03-14 00:53:16,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 149 transitions, 716 flow [2025-03-14 00:53:16,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 149 transitions, 692 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-14 00:53:16,188 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 150 flow [2025-03-14 00:53:16,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=150, PETRI_PLACES=61, PETRI_TRANSITIONS=37} [2025-03-14 00:53:16,189 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2025-03-14 00:53:16,189 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 150 flow [2025-03-14 00:53:16,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:53:16,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:16,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:16,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:53:16,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:16,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash 127732641, now seen corresponding path program 1 times [2025-03-14 00:53:16,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:16,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705803762] [2025-03-14 00:53:16,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:16,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:16,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:53:16,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:53:16,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:16,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:16,332 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-14 00:53:16,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:16,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705803762] [2025-03-14 00:53:16,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705803762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:16,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:16,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:16,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275948991] [2025-03-14 00:53:16,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:16,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:16,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:16,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:16,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:16,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:53:16,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 37 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:53:16,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:16,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:53:16,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:17,272 INFO L124 PetriNetUnfolderBase]: 9129/13392 cut-off events. [2025-03-14 00:53:17,273 INFO L125 PetriNetUnfolderBase]: For 20814/20814 co-relation queries the response was YES. [2025-03-14 00:53:17,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36690 conditions, 13392 events. 9129/13392 cut-off events. For 20814/20814 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 79537 event pairs, 1139 based on Foata normal form. 390/13780 useless extension candidates. Maximal degree in co-relation 36668. Up to 4177 conditions per place. [2025-03-14 00:53:17,339 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 82 selfloop transitions, 17 changer transitions 110/213 dead transitions. [2025-03-14 00:53:17,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 213 transitions, 1245 flow [2025-03-14 00:53:17,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 00:53:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 00:53:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 290 transitions. [2025-03-14 00:53:17,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.571992110453649 [2025-03-14 00:53:17,343 INFO L175 Difference]: Start difference. First operand has 61 places, 37 transitions, 150 flow. Second operand 13 states and 290 transitions. [2025-03-14 00:53:17,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 213 transitions, 1245 flow [2025-03-14 00:53:17,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 213 transitions, 1139 flow, removed 36 selfloop flow, removed 8 redundant places. [2025-03-14 00:53:17,493 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 325 flow [2025-03-14 00:53:17,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=325, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2025-03-14 00:53:17,495 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2025-03-14 00:53:17,495 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 325 flow [2025-03-14 00:53:17,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:53:17,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:17,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:17,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:53:17,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:17,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:17,496 INFO L85 PathProgramCache]: Analyzing trace with hash -2068709662, now seen corresponding path program 1 times [2025-03-14 00:53:17,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:17,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273479718] [2025-03-14 00:53:17,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:17,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:17,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:53:17,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:53:17,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:17,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:17,633 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-14 00:53:17,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:17,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273479718] [2025-03-14 00:53:17,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273479718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:17,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:17,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:53:17,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341333885] [2025-03-14 00:53:17,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:17,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:53:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:17,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:53:17,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:53:17,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:53:17,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 325 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-14 00:53:17,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:17,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:53:17,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:18,575 INFO L124 PetriNetUnfolderBase]: 10703/15631 cut-off events. [2025-03-14 00:53:18,575 INFO L125 PetriNetUnfolderBase]: For 48655/48671 co-relation queries the response was YES. [2025-03-14 00:53:18,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48571 conditions, 15631 events. 10703/15631 cut-off events. For 48655/48671 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 92132 event pairs, 2020 based on Foata normal form. 324/15950 useless extension candidates. Maximal degree in co-relation 48543. Up to 5012 conditions per place. [2025-03-14 00:53:18,634 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 66 selfloop transitions, 8 changer transitions 76/154 dead transitions. [2025-03-14 00:53:18,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 154 transitions, 1121 flow [2025-03-14 00:53:18,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 00:53:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 00:53:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2025-03-14 00:53:18,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5584045584045584 [2025-03-14 00:53:18,636 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 325 flow. Second operand 9 states and 196 transitions. [2025-03-14 00:53:18,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 154 transitions, 1121 flow [2025-03-14 00:53:18,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 154 transitions, 1005 flow, removed 58 selfloop flow, removed 6 redundant places. [2025-03-14 00:53:18,759 INFO L231 Difference]: Finished difference. Result has 71 places, 39 transitions, 220 flow [2025-03-14 00:53:18,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=71, PETRI_TRANSITIONS=39} [2025-03-14 00:53:18,759 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2025-03-14 00:53:18,760 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 39 transitions, 220 flow [2025-03-14 00:53:18,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-14 00:53:18,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:18,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:18,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:53:18,760 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:18,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:18,761 INFO L85 PathProgramCache]: Analyzing trace with hash -647728907, now seen corresponding path program 1 times [2025-03-14 00:53:18,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:18,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982806686] [2025-03-14 00:53:18,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:18,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:18,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 00:53:18,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 00:53:18,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:18,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:18,843 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-14 00:53:18,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:18,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982806686] [2025-03-14 00:53:18,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982806686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:18,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:18,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:53:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764418789] [2025-03-14 00:53:18,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:18,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:53:18,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:18,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:53:18,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:53:18,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:53:18,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 39 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-14 00:53:18,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:18,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:53:18,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:19,419 INFO L124 PetriNetUnfolderBase]: 5501/8330 cut-off events. [2025-03-14 00:53:19,420 INFO L125 PetriNetUnfolderBase]: For 17075/17075 co-relation queries the response was YES. [2025-03-14 00:53:19,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24676 conditions, 8330 events. 5501/8330 cut-off events. For 17075/17075 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 45923 event pairs, 3185 based on Foata normal form. 236/8564 useless extension candidates. Maximal degree in co-relation 24656. Up to 6623 conditions per place. [2025-03-14 00:53:19,494 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 43 selfloop transitions, 5 changer transitions 41/93 dead transitions. [2025-03-14 00:53:19,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 93 transitions, 660 flow [2025-03-14 00:53:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:53:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:53:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-03-14 00:53:19,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4945054945054945 [2025-03-14 00:53:19,500 INFO L175 Difference]: Start difference. First operand has 71 places, 39 transitions, 220 flow. Second operand 7 states and 135 transitions. [2025-03-14 00:53:19,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 93 transitions, 660 flow [2025-03-14 00:53:19,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 517 flow, removed 27 selfloop flow, removed 14 redundant places. [2025-03-14 00:53:19,553 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 188 flow [2025-03-14 00:53:19,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2025-03-14 00:53:19,554 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2025-03-14 00:53:19,554 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 188 flow [2025-03-14 00:53:19,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-14 00:53:19,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:19,554 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] [2025-03-14 00:53:19,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:53:19,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:19,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:19,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1559633848, now seen corresponding path program 1 times [2025-03-14 00:53:19,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:19,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689253620] [2025-03-14 00:53:19,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:19,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:19,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 00:53:19,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 00:53:19,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:19,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:19,686 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-14 00:53:19,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:19,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689253620] [2025-03-14 00:53:19,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689253620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:19,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:19,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:53:19,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311108848] [2025-03-14 00:53:19,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:19,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:53:19,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:19,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:53:19,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:53:19,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-14 00:53:19,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-14 00:53:19,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:19,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-14 00:53:19,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:20,046 INFO L124 PetriNetUnfolderBase]: 3727/5945 cut-off events. [2025-03-14 00:53:20,046 INFO L125 PetriNetUnfolderBase]: For 7513/7513 co-relation queries the response was YES. [2025-03-14 00:53:20,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15821 conditions, 5945 events. 3727/5945 cut-off events. For 7513/7513 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 34148 event pairs, 631 based on Foata normal form. 278/6220 useless extension candidates. Maximal degree in co-relation 15805. Up to 3039 conditions per place. [2025-03-14 00:53:20,075 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 74 selfloop transitions, 5 changer transitions 1/85 dead transitions. [2025-03-14 00:53:20,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 578 flow [2025-03-14 00:53:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:53:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:53:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-03-14 00:53:20,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6474358974358975 [2025-03-14 00:53:20,077 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 188 flow. Second operand 4 states and 101 transitions. [2025-03-14 00:53:20,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 578 flow [2025-03-14 00:53:20,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 539 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-14 00:53:20,089 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 205 flow [2025-03-14 00:53:20,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2025-03-14 00:53:20,090 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2025-03-14 00:53:20,090 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 205 flow [2025-03-14 00:53:20,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-14 00:53:20,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:20,090 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] [2025-03-14 00:53:20,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:53:20,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:20,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:20,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1410003603, now seen corresponding path program 1 times [2025-03-14 00:53:20,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:20,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011556709] [2025-03-14 00:53:20,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:20,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 00:53:20,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 00:53:20,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:20,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:20,182 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-14 00:53:20,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:20,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011556709] [2025-03-14 00:53:20,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011556709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:20,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:20,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:53:20,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261457353] [2025-03-14 00:53:20,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:20,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:53:20,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:20,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:53:20,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:53:20,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-14 00:53:20,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-14 00:53:20,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:20,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-14 00:53:20,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:20,406 INFO L124 PetriNetUnfolderBase]: 2321/3713 cut-off events. [2025-03-14 00:53:20,407 INFO L125 PetriNetUnfolderBase]: For 4144/4144 co-relation queries the response was YES. [2025-03-14 00:53:20,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10607 conditions, 3713 events. 2321/3713 cut-off events. For 4144/4144 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 18912 event pairs, 345 based on Foata normal form. 212/3922 useless extension candidates. Maximal degree in co-relation 10592. Up to 1141 conditions per place. [2025-03-14 00:53:20,419 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 82 selfloop transitions, 8 changer transitions 2/97 dead transitions. [2025-03-14 00:53:20,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 97 transitions, 639 flow [2025-03-14 00:53:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:53:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:53:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-14 00:53:20,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2025-03-14 00:53:20,420 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 205 flow. Second operand 5 states and 125 transitions. [2025-03-14 00:53:20,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 97 transitions, 639 flow [2025-03-14 00:53:20,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 629 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-14 00:53:20,425 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 245 flow [2025-03-14 00:53:20,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2025-03-14 00:53:20,426 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2025-03-14 00:53:20,426 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 245 flow [2025-03-14 00:53:20,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-14 00:53:20,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:20,426 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:20,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:53:20,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:20,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:20,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1304323193, now seen corresponding path program 1 times [2025-03-14 00:53:20,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:20,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555727071] [2025-03-14 00:53:20,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:20,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:20,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 00:53:20,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 00:53:20,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:20,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:20,509 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-14 00:53:20,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:20,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555727071] [2025-03-14 00:53:20,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555727071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:20,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:20,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:20,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710098690] [2025-03-14 00:53:20,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:20,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:20,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:20,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:20,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:20,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-14 00:53:20,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 245 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-14 00:53:20,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:20,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-14 00:53:20,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:20,692 INFO L124 PetriNetUnfolderBase]: 1453/2289 cut-off events. [2025-03-14 00:53:20,692 INFO L125 PetriNetUnfolderBase]: For 3582/3582 co-relation queries the response was YES. [2025-03-14 00:53:20,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7033 conditions, 2289 events. 1453/2289 cut-off events. For 3582/3582 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10387 event pairs, 279 based on Foata normal form. 92/2378 useless extension candidates. Maximal degree in co-relation 7017. Up to 788 conditions per place. [2025-03-14 00:53:20,700 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 64 selfloop transitions, 11 changer transitions 9/89 dead transitions. [2025-03-14 00:53:20,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 598 flow [2025-03-14 00:53:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:53:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:53:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-03-14 00:53:20,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5427350427350427 [2025-03-14 00:53:20,702 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 245 flow. Second operand 6 states and 127 transitions. [2025-03-14 00:53:20,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 598 flow [2025-03-14 00:53:20,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 543 flow, removed 16 selfloop flow, removed 7 redundant places. [2025-03-14 00:53:20,709 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 240 flow [2025-03-14 00:53:20,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2025-03-14 00:53:20,710 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2025-03-14 00:53:20,710 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 240 flow [2025-03-14 00:53:20,710 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-14 00:53:20,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:20,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:20,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:53:20,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:53:20,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash -204086235, now seen corresponding path program 1 times [2025-03-14 00:53:20,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:20,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593780511] [2025-03-14 00:53:20,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:20,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:20,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 00:53:20,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 00:53:20,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:20,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:20,812 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-14 00:53:20,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:20,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593780511] [2025-03-14 00:53:20,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593780511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:20,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:20,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:53:20,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690151316] [2025-03-14 00:53:20,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:20,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:20,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:20,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:20,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:20,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:53:20,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-14 00:53:20,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:20,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:53:20,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:21,048 INFO L124 PetriNetUnfolderBase]: 1493/2327 cut-off events. [2025-03-14 00:53:21,048 INFO L125 PetriNetUnfolderBase]: For 3452/3452 co-relation queries the response was YES. [2025-03-14 00:53:21,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7197 conditions, 2327 events. 1493/2327 cut-off events. For 3452/3452 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10340 event pairs, 394 based on Foata normal form. 8/2333 useless extension candidates. Maximal degree in co-relation 7183. Up to 1511 conditions per place. [2025-03-14 00:53:21,054 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 0 selfloop transitions, 0 changer transitions 84/84 dead transitions. [2025-03-14 00:53:21,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 555 flow [2025-03-14 00:53:21,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:53:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:53:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2025-03-14 00:53:21,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-14 00:53:21,055 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 240 flow. Second operand 7 states and 117 transitions. [2025-03-14 00:53:21,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 555 flow [2025-03-14 00:53:21,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 455 flow, removed 18 selfloop flow, removed 10 redundant places. [2025-03-14 00:53:21,062 INFO L231 Difference]: Finished difference. Result has 59 places, 0 transitions, 0 flow [2025-03-14 00:53:21,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=59, PETRI_TRANSITIONS=0} [2025-03-14 00:53:21,063 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2025-03-14 00:53:21,063 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 0 transitions, 0 flow [2025-03-14 00:53:21,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-14 00:53:21,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-14 00:53:21,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-14 00:53:21,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 00:53:21,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-14 00:53:21,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:53:21,066 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:21,068 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:53:21,068 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:53:21,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:53:21 BasicIcfg [2025-03-14 00:53:21,071 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:53:21,072 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:53:21,072 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:53:21,072 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:53:21,072 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:53:13" (3/4) ... [2025-03-14 00:53:21,074 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:53:21,076 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-14 00:53:21,076 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-14 00:53:21,076 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-03-14 00:53:21,078 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2025-03-14 00:53:21,078 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-14 00:53:21,078 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 00:53:21,078 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 00:53:21,121 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:53:21,121 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:53:21,121 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:53:21,122 INFO L158 Benchmark]: Toolchain (without parser) took 8907.62ms. Allocated memory was 167.8MB in the beginning and 897.6MB in the end (delta: 729.8MB). Free memory was 132.8MB in the beginning and 538.9MB in the end (delta: -406.0MB). Peak memory consumption was 324.2MB. Max. memory is 16.1GB. [2025-03-14 00:53:21,122 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:53:21,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.53ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 112.6MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:53:21,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.97ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 111.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:53:21,122 INFO L158 Benchmark]: Boogie Preprocessor took 47.38ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 109.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:53:21,123 INFO L158 Benchmark]: IcfgBuilder took 421.09ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 87.4MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:53:21,123 INFO L158 Benchmark]: TraceAbstraction took 7984.32ms. Allocated memory was 167.8MB in the beginning and 897.6MB in the end (delta: 729.8MB). Free memory was 86.5MB in the beginning and 543.3MB in the end (delta: -456.9MB). Peak memory consumption was 265.5MB. Max. memory is 16.1GB. [2025-03-14 00:53:21,123 INFO L158 Benchmark]: Witness Printer took 49.50ms. Allocated memory is still 897.6MB. Free memory was 543.3MB in the beginning and 538.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:53:21,124 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 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.53ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 112.6MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.97ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 111.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.38ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 109.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 421.09ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 87.4MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7984.32ms. Allocated memory was 167.8MB in the beginning and 897.6MB in the end (delta: 729.8MB). Free memory was 86.5MB in the beginning and 543.3MB in the end (delta: -456.9MB). Peak memory consumption was 265.5MB. Max. memory is 16.1GB. * Witness Printer took 49.50ms. Allocated memory is still 897.6MB. Free memory was 543.3MB in the beginning and 538.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 4 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: 7.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 778 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 772 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1619 IncrementalHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 3 mSDtfsCounter, 1619 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=3, InterpolantAutomatonStates: 68, 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, 1.1s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 00:53:21,135 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 Result: TRUE