./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-lit/sssc12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-lit/sssc12.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 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:22:54,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:22:54,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:22:54,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:22:54,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:22:54,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:22:54,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:22:54,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:22:54,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:22:54,815 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:22:54,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:22:54,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:22:54,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:22:54,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:22:54,816 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:22:54,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:22:54,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:22:54,817 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:22:54,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:22:54,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:22:54,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:22:54,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:22:54,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:22:54,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:22:54,817 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:22:54,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:22:54,817 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:22:54,817 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:22:54,817 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:22:54,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:22:54,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:22:54,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:22:54,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:22:54,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:22:54,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:22:54,818 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:22:54,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:22:54,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:22:54,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:22:54,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:22:54,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:22:54,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:22:54,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:22:54,819 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 -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2025-03-08 17:22:55,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:22:55,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:22:55,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:22:55,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:22:55,080 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:22:55,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-08 17:22:56,232 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441c6bbfc/b60e79e24f6a49eb8716ac749c826d65/FLAG153274a0a [2025-03-08 17:22:56,495 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:22:56,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-08 17:22:56,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441c6bbfc/b60e79e24f6a49eb8716ac749c826d65/FLAG153274a0a [2025-03-08 17:22:56,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441c6bbfc/b60e79e24f6a49eb8716ac749c826d65 [2025-03-08 17:22:56,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:22:56,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:22:56,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:22:56,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:22:56,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:22:56,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:22:56" (1/1) ... [2025-03-08 17:22:56,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341259bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:56, skipping insertion in model container [2025-03-08 17:22:56,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:22:56" (1/1) ... [2025-03-08 17:22:56,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:22:57,097 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-lit/sssc12.i[47777,47790] [2025-03-08 17:22:57,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:22:57,125 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:22:57,168 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-lit/sssc12.i[47777,47790] [2025-03-08 17:22:57,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:22:57,214 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:22:57,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57 WrapperNode [2025-03-08 17:22:57,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:22:57,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:22:57,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:22:57,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:22:57,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57" (1/1) ... [2025-03-08 17:22:57,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57" (1/1) ... [2025-03-08 17:22:57,248 INFO L138 Inliner]: procedures = 272, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2025-03-08 17:22:57,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:22:57,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:22:57,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:22:57,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:22:57,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57" (1/1) ... [2025-03-08 17:22:57,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57" (1/1) ... [2025-03-08 17:22:57,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57" (1/1) ... [2025-03-08 17:22:57,274 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 5, 1]. 63 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 1 writes are split as follows [0, 0, 1]. [2025-03-08 17:22:57,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57" (1/1) ... [2025-03-08 17:22:57,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57" (1/1) ... [2025-03-08 17:22:57,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57" (1/1) ... [2025-03-08 17:22:57,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57" (1/1) ... [2025-03-08 17:22:57,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57" (1/1) ... [2025-03-08 17:22:57,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57" (1/1) ... [2025-03-08 17:22:57,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:22:57,291 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:22:57,291 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:22:57,291 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:22:57,293 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57" (1/1) ... [2025-03-08 17:22:57,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:22:57,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:22:57,321 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-08 17:22:57,323 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-08 17:22:57,338 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-03-08 17:22:57,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-03-08 17:22:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 17:22:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:22:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:22:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 17:22:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 17:22:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:22:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:22:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:22:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:22:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 17:22:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:22:57,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:22:57,340 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:22:57,427 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:22:57,428 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:22:57,543 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:22:57,543 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:22:57,649 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:22:57,649 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:22:57,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:22:57 BoogieIcfgContainer [2025-03-08 17:22:57,649 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:22:57,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:22:57,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:22:57,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:22:57,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:22:56" (1/3) ... [2025-03-08 17:22:57,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f25cc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:22:57, skipping insertion in model container [2025-03-08 17:22:57,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:57" (2/3) ... [2025-03-08 17:22:57,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f25cc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:22:57, skipping insertion in model container [2025-03-08 17:22:57,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:22:57" (3/3) ... [2025-03-08 17:22:57,657 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12.i [2025-03-08 17:22:57,672 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:22:57,673 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12.i that has 2 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 17:22:57,673 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:22:57,710 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:22:57,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 18 transitions, 40 flow [2025-03-08 17:22:57,761 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-03-08 17:22:57,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:22:57,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 20 events. 2/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-03-08 17:22:57,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 18 transitions, 40 flow [2025-03-08 17:22:57,768 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 18 transitions, 40 flow [2025-03-08 17:22:57,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:22:57,784 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;@f8582d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:22:57,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 17:22:57,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:22:57,790 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-08 17:22:57,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:22:57,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:22:57,791 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-08 17:22:57,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:22:57,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:22:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash 895973485, now seen corresponding path program 1 times [2025-03-08 17:22:57,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:22:57,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199878566] [2025-03-08 17:22:57,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:22:57,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:22:57,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 17:22:57,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 17:22:57,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:22:57,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:22:57,896 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:22:57,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 17:22:57,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 17:22:57,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:22:57,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:22:57,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:22:57,938 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:22:57,939 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-08 17:22:57,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-08 17:22:57,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-08 17:22:57,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:22:57,942 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-08 17:22:57,945 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:22:57,947 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 17:22:57,969 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:22:57,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 72 flow [2025-03-08 17:22:57,983 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-03-08 17:22:57,984 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:22:57,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 36 events. 4/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-03-08 17:22:57,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 72 flow [2025-03-08 17:22:57,985 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 31 transitions, 72 flow [2025-03-08 17:22:57,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:22:57,986 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;@f8582d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:22:57,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:22:57,994 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:22:57,995 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-08 17:22:57,996 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:22:57,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:22:57,996 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-08 17:22:57,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 17:22:57,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:22:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1440960105, now seen corresponding path program 1 times [2025-03-08 17:22:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:22:57,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021683995] [2025-03-08 17:22:57,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:22:57,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:22:58,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 17:22:58,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 17:22:58,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:22:58,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:22:58,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:22:58,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 17:22:58,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 17:22:58,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:22:58,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:22:58,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:22:58,040 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:22:58,040 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-08 17:22:58,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-08 17:22:58,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-08 17:22:58,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-08 17:22:58,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:22:58,040 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-08 17:22:58,041 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:22:58,041 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 17:22:58,080 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:22:58,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 106 flow [2025-03-08 17:22:58,095 INFO L124 PetriNetUnfolderBase]: 6/52 cut-off events. [2025-03-08 17:22:58,095 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 17:22:58,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 6/52 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 118 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 43. Up to 4 conditions per place. [2025-03-08 17:22:58,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 44 transitions, 106 flow [2025-03-08 17:22:58,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 106 flow [2025-03-08 17:22:58,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:22:58,097 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;@f8582d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:22:58,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-08 17:22:58,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:22:58,107 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-03-08 17:22:58,107 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 17:22:58,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:22:58,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:22:58,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:22:58,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:22:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash -140863672, now seen corresponding path program 1 times [2025-03-08 17:22:58,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:22:58,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026471143] [2025-03-08 17:22:58,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:22:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:22:58,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 17:22:58,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:22:58,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:22:58,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:22:58,433 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-08 17:22:58,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:22:58,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026471143] [2025-03-08 17:22:58,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026471143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:22:58,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:22:58,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:22:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699729666] [2025-03-08 17:22:58,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:22:58,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:22:58,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:22:58,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:22:58,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:22:58,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-03-08 17:22:58,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 106 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-08 17:22:58,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:22:58,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-03-08 17:22:58,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:22:59,695 INFO L124 PetriNetUnfolderBase]: 8725/13362 cut-off events. [2025-03-08 17:22:59,695 INFO L125 PetriNetUnfolderBase]: For 721/721 co-relation queries the response was YES. [2025-03-08 17:22:59,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25734 conditions, 13362 events. 8725/13362 cut-off events. For 721/721 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 85432 event pairs, 1834 based on Foata normal form. 963/11922 useless extension candidates. Maximal degree in co-relation 17547. Up to 6223 conditions per place. [2025-03-08 17:22:59,788 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 101 selfloop transitions, 12 changer transitions 0/124 dead transitions. [2025-03-08 17:22:59,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 124 transitions, 552 flow [2025-03-08 17:22:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:22:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:22:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2025-03-08 17:22:59,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6688311688311688 [2025-03-08 17:22:59,798 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 106 flow. Second operand 7 states and 206 transitions. [2025-03-08 17:22:59,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 124 transitions, 552 flow [2025-03-08 17:22:59,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 540 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-08 17:22:59,813 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 180 flow [2025-03-08 17:22:59,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2025-03-08 17:22:59,817 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2025-03-08 17:22:59,817 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 180 flow [2025-03-08 17:22:59,817 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-08 17:22:59,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:22:59,818 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-08 17:22:59,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:22:59,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:22:59,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:22:59,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1866264940, now seen corresponding path program 1 times [2025-03-08 17:22:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:22:59,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149022087] [2025-03-08 17:22:59,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:22:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:22:59,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 17:22:59,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 17:22:59,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:22:59,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:22:59,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:22:59,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 17:22:59,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 17:22:59,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:22:59,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:22:59,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:22:59,858 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:22:59,858 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-08 17:22:59,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-08 17:22:59,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-08 17:22:59,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-08 17:22:59,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-08 17:22:59,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:22:59,859 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 17:22:59,859 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:22:59,860 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-08 17:22:59,884 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:22:59,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 57 transitions, 142 flow [2025-03-08 17:22:59,895 INFO L124 PetriNetUnfolderBase]: 8/68 cut-off events. [2025-03-08 17:22:59,895 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-08 17:22:59,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 68 events. 8/68 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 158 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 64. Up to 5 conditions per place. [2025-03-08 17:22:59,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 57 transitions, 142 flow [2025-03-08 17:22:59,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 57 transitions, 142 flow [2025-03-08 17:22:59,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:22:59,897 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;@f8582d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:22:59,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-08 17:22:59,902 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:22:59,903 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-03-08 17:22:59,903 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 17:22:59,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:22:59,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:22:59,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 17:22:59,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:22:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash -969217043, now seen corresponding path program 1 times [2025-03-08 17:22:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:22:59,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158748751] [2025-03-08 17:22:59,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:22:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:22:59,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 17:22:59,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:22:59,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:22:59,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:00,080 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-08 17:23:00,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:00,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158748751] [2025-03-08 17:23:00,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158748751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:00,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:00,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:23:00,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633153471] [2025-03-08 17:23:00,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:00,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:23:00,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:00,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:23:00,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:23:00,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-08 17:23:00,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-08 17:23:00,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:00,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-08 17:23:00,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:06,429 INFO L124 PetriNetUnfolderBase]: 98531/139216 cut-off events. [2025-03-08 17:23:06,430 INFO L125 PetriNetUnfolderBase]: For 9994/9994 co-relation queries the response was YES. [2025-03-08 17:23:06,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268248 conditions, 139216 events. 98531/139216 cut-off events. For 9994/9994 co-relation queries the response was YES. Maximal size of possible extension queue 4519. Compared 1019996 event pairs, 23890 based on Foata normal form. 11088/124117 useless extension candidates. Maximal degree in co-relation 136311. Up to 65858 conditions per place. [2025-03-08 17:23:07,258 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 139 selfloop transitions, 14 changer transitions 0/168 dead transitions. [2025-03-08 17:23:07,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 168 transitions, 775 flow [2025-03-08 17:23:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:23:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:23:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 278 transitions. [2025-03-08 17:23:07,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6967418546365914 [2025-03-08 17:23:07,260 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 142 flow. Second operand 7 states and 278 transitions. [2025-03-08 17:23:07,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 168 transitions, 775 flow [2025-03-08 17:23:07,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 168 transitions, 739 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-08 17:23:07,269 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 226 flow [2025-03-08 17:23:07,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2025-03-08 17:23:07,270 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2025-03-08 17:23:07,270 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 226 flow [2025-03-08 17:23:07,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-08 17:23:07,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:07,271 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:23:07,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:23:07,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 17:23:07,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:07,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2109217172, now seen corresponding path program 1 times [2025-03-08 17:23:07,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:07,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306583289] [2025-03-08 17:23:07,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:23:07,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:07,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 17:23:07,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 17:23:07,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:07,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:07,430 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-08 17:23:07,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:07,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306583289] [2025-03-08 17:23:07,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306583289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:07,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:07,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:23:07,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808245596] [2025-03-08 17:23:07,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:07,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:23:07,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:07,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:23:07,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:23:07,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-08 17:23:07,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-08 17:23:07,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:07,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-08 17:23:07,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:18,837 INFO L124 PetriNetUnfolderBase]: 153451/218781 cut-off events. [2025-03-08 17:23:18,837 INFO L125 PetriNetUnfolderBase]: For 84512/86609 co-relation queries the response was YES. [2025-03-08 17:23:19,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477648 conditions, 218781 events. 153451/218781 cut-off events. For 84512/86609 co-relation queries the response was YES. Maximal size of possible extension queue 7564. Compared 1725075 event pairs, 43744 based on Foata normal form. 0/187554 useless extension candidates. Maximal degree in co-relation 398346. Up to 112061 conditions per place. [2025-03-08 17:23:20,364 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 145 selfloop transitions, 19 changer transitions 0/180 dead transitions. [2025-03-08 17:23:20,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 180 transitions, 948 flow [2025-03-08 17:23:20,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:23:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:23:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 255 transitions. [2025-03-08 17:23:20,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6390977443609023 [2025-03-08 17:23:20,366 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 226 flow. Second operand 7 states and 255 transitions. [2025-03-08 17:23:20,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 180 transitions, 948 flow [2025-03-08 17:23:20,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 180 transitions, 948 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:23:20,806 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 346 flow [2025-03-08 17:23:20,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-03-08 17:23:20,806 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2025-03-08 17:23:20,806 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 346 flow [2025-03-08 17:23:20,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-08 17:23:20,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:20,807 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:23:20,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:23:20,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 17:23:20,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1121483071, now seen corresponding path program 1 times [2025-03-08 17:23:20,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:20,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432870911] [2025-03-08 17:23:20,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:23:20,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:20,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 17:23:20,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 17:23:20,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:20,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:23:20,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:20,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432870911] [2025-03-08 17:23:20,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432870911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:23:20,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007862610] [2025-03-08 17:23:20,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:23:20,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:23:20,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:23:20,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:23:20,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:23:21,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 17:23:21,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 17:23:21,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:21,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:21,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 17:23:21,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:23:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:23:21,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:23:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:23:21,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007862610] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:23:21,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:23:21,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2025-03-08 17:23:21,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748516027] [2025-03-08 17:23:21,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:23:21,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 17:23:21,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:21,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 17:23:21,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-08 17:23:21,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-08 17:23:21,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 346 flow. Second operand has 18 states, 18 states have (on average 16.77777777777778) internal successors, (302), 18 states have internal predecessors, (302), 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-08 17:23:21,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:21,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-08 17:23:21,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand