./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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-ext/36_stack_cas_p0_vs_concur.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 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:27:57,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:27:57,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:27:57,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:27:57,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:27:57,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:27:57,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:27:57,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:27:57,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:27:57,944 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:27:57,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:27:57,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:27:57,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:27:57,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:27:57,945 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:27:57,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:27:57,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:27:57,946 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:27:57,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:27:57,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:27:57,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:27:57,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:27:57,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:27:57,947 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:27:57,947 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:27:57,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:27:57,947 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:27:57,947 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:27:57,947 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:27:57,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:27:57,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:27:57,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:27:57,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:27:57,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:27:57,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:27:57,948 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:27:57,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:27:57,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:27:57,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:27:57,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:27:57,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:27:57,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:27:57,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:27:57,949 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 -> 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 [2025-03-13 21:27:58,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:27:58,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:27:58,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:27:58,175 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:27:58,175 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:27:58,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i [2025-03-13 21:27:59,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df771c7f1/b60339dc6cb84058b2d8bbe2ad4e5613/FLAGca18f6ec8 [2025-03-13 21:27:59,559 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:27:59,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i [2025-03-13 21:27:59,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df771c7f1/b60339dc6cb84058b2d8bbe2ad4e5613/FLAGca18f6ec8 [2025-03-13 21:27:59,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df771c7f1/b60339dc6cb84058b2d8bbe2ad4e5613 [2025-03-13 21:27:59,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:27:59,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:27:59,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:27:59,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:27:59,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:27:59,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:27:59,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdd5cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59, skipping insertion in model container [2025-03-13 21:27:59,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:27:59,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:27:59,852 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-ext/36_stack_cas_p0_vs_concur.i[30869,30882] [2025-03-13 21:27:59,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:27:59,874 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:27:59,918 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-ext/36_stack_cas_p0_vs_concur.i[30869,30882] [2025-03-13 21:27:59,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:27:59,953 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:27:59,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59 WrapperNode [2025-03-13 21:27:59,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:27:59,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:27:59,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:27:59,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:27:59,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:27:59,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:27:59,980 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 158 [2025-03-13 21:27:59,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:27:59,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:27:59,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:27:59,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:27:59,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:27:59,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:27:59,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:28:00,002 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 5, 6, 3]. 38 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0]. The 5 writes are split as follows [0, 1, 2, 2]. [2025-03-13 21:28:00,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:28:00,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:28:00,009 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:28:00,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:28:00,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:28:00,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:28:00,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:28:00,018 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:28:00,018 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:28:00,018 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:28:00,018 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59" (1/1) ... [2025-03-13 21:28:00,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:28:00,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:28:00,043 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-13 21:28:00,046 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-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:28:00,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:28:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:28:00,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:28:00,064 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:28:00,158 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:28:00,160 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:28:00,417 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:28:00,418 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:28:00,418 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:28:00,747 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:28:00,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:28:00 BoogieIcfgContainer [2025-03-13 21:28:00,748 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:28:00,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:28:00,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:28:00,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:28:00,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:27:59" (1/3) ... [2025-03-13 21:28:00,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3562c903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:28:00, skipping insertion in model container [2025-03-13 21:28:00,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:59" (2/3) ... [2025-03-13 21:28:00,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3562c903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:28:00, skipping insertion in model container [2025-03-13 21:28:00,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:28:00" (3/3) ... [2025-03-13 21:28:00,756 INFO L128 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2025-03-13 21:28:00,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:28:00,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36_stack_cas_p0_vs_concur.i that has 2 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-13 21:28:00,769 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:28:00,797 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:28:00,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 21 transitions, 46 flow [2025-03-13 21:28:00,853 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-03-13 21:28:00,857 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:28:00,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 23 events. 3/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-03-13 21:28:00,860 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 21 transitions, 46 flow [2025-03-13 21:28:00,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 21 transitions, 46 flow [2025-03-13 21:28:00,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:28:00,878 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;@7b940e19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:28:00,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:28:00,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:28:00,884 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-13 21:28:00,884 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:28:00,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:28:00,884 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-13 21:28:00,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-13 21:28:00,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:28:00,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1957365430, now seen corresponding path program 1 times [2025-03-13 21:28:00,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:28:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609072635] [2025-03-13 21:28:00,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:28:00,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:28:01,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-13 21:28:01,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-13 21:28:01,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:01,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:28:01,282 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:28:01,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-13 21:28:01,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-13 21:28:01,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:01,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:28:01,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:28:01,338 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:28:01,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-13 21:28:01,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-13 21:28:01,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-13 21:28:01,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:28:01,341 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-13 21:28:01,346 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:28:01,346 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:28:01,366 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:28:01,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 37 transitions, 84 flow [2025-03-13 21:28:01,383 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2025-03-13 21:28:01,383 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:28:01,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 42 events. 6/42 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 84 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2025-03-13 21:28:01,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 37 transitions, 84 flow [2025-03-13 21:28:01,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 37 transitions, 84 flow [2025-03-13 21:28:01,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:28:01,385 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;@7b940e19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:28:01,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:28:01,391 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:28:01,391 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-03-13 21:28:01,391 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:28:01,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:28:01,392 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-13 21:28:01,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:28:01,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:28:01,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1493387971, now seen corresponding path program 1 times [2025-03-13 21:28:01,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:28:01,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331787003] [2025-03-13 21:28:01,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:28:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:28:01,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:28:01,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:28:01,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:01,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:28:01,709 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:28:01,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:28:01,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:28:01,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:01,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:28:01,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:28:01,754 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:28:01,755 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-13 21:28:01,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-13 21:28:01,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-13 21:28:01,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-13 21:28:01,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:28:01,755 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-13 21:28:01,756 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:28:01,756 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:28:01,793 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:28:01,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 53 transitions, 124 flow [2025-03-13 21:28:01,828 INFO L124 PetriNetUnfolderBase]: 9/61 cut-off events. [2025-03-13 21:28:01,828 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:28:01,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 61 events. 9/61 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2025-03-13 21:28:01,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 53 transitions, 124 flow [2025-03-13 21:28:01,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 53 transitions, 124 flow [2025-03-13 21:28:01,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:28:01,831 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;@7b940e19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:28:01,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:28:01,836 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:28:01,836 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-03-13 21:28:01,836 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:28:01,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:28:01,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:28:01,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:28:01,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:28:01,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1123400398, now seen corresponding path program 1 times [2025-03-13 21:28:01,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:28:01,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781838734] [2025-03-13 21:28:01,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:28:01,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:28:02,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-13 21:28:02,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:28:02,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:02,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:28:02,079 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-13 21:28:02,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:28:02,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781838734] [2025-03-13 21:28:02,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781838734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:28:02,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:28:02,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:28:02,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874560031] [2025-03-13 21:28:02,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:28:02,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:28:02,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:28:02,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:28:02,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:28:02,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 53 [2025-03-13 21:28:02,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 53 transitions, 124 flow. Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-13 21:28:02,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:28:02,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 53 [2025-03-13 21:28:02,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:28:03,659 INFO L124 PetriNetUnfolderBase]: 16061/21735 cut-off events. [2025-03-13 21:28:03,660 INFO L125 PetriNetUnfolderBase]: For 944/944 co-relation queries the response was YES. [2025-03-13 21:28:03,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44056 conditions, 21735 events. 16061/21735 cut-off events. For 944/944 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 104403 event pairs, 13319 based on Foata normal form. 0/18973 useless extension candidates. Maximal degree in co-relation 25121. Up to 21703 conditions per place. [2025-03-13 21:28:03,796 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 42 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2025-03-13 21:28:03,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 194 flow [2025-03-13 21:28:03,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:28:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:28:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2025-03-13 21:28:03,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5377358490566038 [2025-03-13 21:28:03,805 INFO L175 Difference]: Start difference. First operand has 51 places, 53 transitions, 124 flow. Second operand 2 states and 57 transitions. [2025-03-13 21:28:03,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 194 flow [2025-03-13 21:28:03,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 21:28:03,814 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 108 flow [2025-03-13 21:28:03,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2025-03-13 21:28:03,820 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-03-13 21:28:03,820 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 108 flow [2025-03-13 21:28:03,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-13 21:28:03,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:28:03,820 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-13 21:28:03,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:28:03,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:28:03,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:28:03,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1727846217, now seen corresponding path program 1 times [2025-03-13 21:28:03,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:28:03,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415716487] [2025-03-13 21:28:03,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:28:03,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:28:04,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:28:04,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:28:04,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:04,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:28:04,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:28:04,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:28:04,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:28:04,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:04,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:28:04,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:28:04,077 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:28:04,078 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-13 21:28:04,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-13 21:28:04,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-13 21:28:04,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-13 21:28:04,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-13 21:28:04,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:28:04,078 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 21:28:04,079 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:28:04,079 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 21:28:04,109 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:28:04,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 69 transitions, 166 flow [2025-03-13 21:28:04,118 INFO L124 PetriNetUnfolderBase]: 12/80 cut-off events. [2025-03-13 21:28:04,118 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:28:04,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 80 events. 12/80 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 206 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 73. Up to 5 conditions per place. [2025-03-13 21:28:04,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 69 transitions, 166 flow [2025-03-13 21:28:04,124 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 69 transitions, 166 flow [2025-03-13 21:28:04,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:28:04,125 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;@7b940e19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:28:04,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 21:28:04,129 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:28:04,129 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-03-13 21:28:04,130 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:28:04,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:28:04,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:28:04,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:28:04,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:28:04,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1865148462, now seen corresponding path program 1 times [2025-03-13 21:28:04,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:28:04,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767237132] [2025-03-13 21:28:04,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:28:04,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:28:04,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-13 21:28:04,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:28:04,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:04,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:28:04,336 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-13 21:28:04,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:28:04,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767237132] [2025-03-13 21:28:04,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767237132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:28:04,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:28:04,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:28:04,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571573226] [2025-03-13 21:28:04,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:28:04,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:28:04,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:28:04,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:28:04,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:28:04,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 69 [2025-03-13 21:28:04,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 166 flow. Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-13 21:28:04,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:28:04,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 69 [2025-03-13 21:28:04,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:28:22,022 INFO L124 PetriNetUnfolderBase]: 266291/334313 cut-off events. [2025-03-13 21:28:22,022 INFO L125 PetriNetUnfolderBase]: For 19044/19044 co-relation queries the response was YES. [2025-03-13 21:28:22,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677633 conditions, 334313 events. 266291/334313 cut-off events. For 19044/19044 co-relation queries the response was YES. Maximal size of possible extension queue 4630. Compared 1807692 event pairs, 222087 based on Foata normal form. 0/289942 useless extension candidates. Maximal degree in co-relation 163645. Up to 334061 conditions per place. [2025-03-13 21:28:23,923 INFO L140 encePairwiseOnDemand]: 60/69 looper letters, 55 selfloop transitions, 0 changer transitions 0/60 dead transitions. [2025-03-13 21:28:23,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 60 transitions, 258 flow [2025-03-13 21:28:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:28:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:28:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2025-03-13 21:28:23,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2025-03-13 21:28:23,925 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 166 flow. Second operand 2 states and 74 transitions. [2025-03-13 21:28:23,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 60 transitions, 258 flow [2025-03-13 21:28:23,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 252 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-13 21:28:23,938 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 142 flow [2025-03-13 21:28:23,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=142, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2025-03-13 21:28:23,938 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2025-03-13 21:28:23,938 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 142 flow [2025-03-13 21:28:23,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-13 21:28:23,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:28:23,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:28:23,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:28:23,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:28:23,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:28:23,939 INFO L85 PathProgramCache]: Analyzing trace with hash 551405173, now seen corresponding path program 1 times [2025-03-13 21:28:23,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:28:23,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243862639] [2025-03-13 21:28:23,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:28:23,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:28:24,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:28:24,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:28:24,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:28:24,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:28:24,269 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-13 21:28:24,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:28:24,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243862639] [2025-03-13 21:28:24,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243862639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:28:24,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:28:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:28:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716091301] [2025-03-13 21:28:24,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:28:24,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:28:24,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:28:24,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:28:24,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:28:24,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 69 [2025-03-13 21:28:24,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-13 21:28:24,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:28:24,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 69 [2025-03-13 21:28:24,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand