./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe016_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe016_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e946e8dea30db7efb52f6f71a24f03cd895152f9df0eae9d8d1291d135f806ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:24:49,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:24:49,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:24:49,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:24:49,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:24:49,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:24:49,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:24:49,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:24:49,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:24:49,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:24:49,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:24:49,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:24:49,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:24:49,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:24:49,912 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:24:49,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:24:49,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:24:49,912 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:24:49,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:24:49,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:24:49,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:24:49,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:24:49,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:24:49,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:24:49,912 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:24:49,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:24:49,912 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:24:49,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:24:49,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:24:49,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:24:49,918 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-jdk21/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 -> e946e8dea30db7efb52f6f71a24f03cd895152f9df0eae9d8d1291d135f806ee [2025-02-06 04:24:50,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:24:50,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:24:50,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:24:50,358 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:24:50,359 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:24:50,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe016_rmo.opt.i [2025-02-06 04:24:51,900 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a603c4b43/2d6225401a704afeb54d5647d0e82132/FLAGd21ab4f95 [2025-02-06 04:24:52,278 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:24:52,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe016_rmo.opt.i [2025-02-06 04:24:52,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a603c4b43/2d6225401a704afeb54d5647d0e82132/FLAGd21ab4f95 [2025-02-06 04:24:52,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a603c4b43/2d6225401a704afeb54d5647d0e82132 [2025-02-06 04:24:52,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:24:52,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:24:52,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:24:52,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:24:52,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:24:52,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:52,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be8be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52, skipping insertion in model container [2025-02-06 04:24:52,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:52,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:24:52,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe016_rmo.opt.i[949,962] [2025-02-06 04:24:52,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:24:52,793 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:24:52,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe016_rmo.opt.i[949,962] [2025-02-06 04:24:52,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:24:52,970 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:24:52,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52 WrapperNode [2025-02-06 04:24:52,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:24:52,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:24:52,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:24:52,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:24:52,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:53,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:53,054 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2025-02-06 04:24:53,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:24:53,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:24:53,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:24:53,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:24:53,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:53,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:53,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:53,116 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 11 writes are split as follows [0, 11]. [2025-02-06 04:24:53,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:53,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:53,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:53,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:53,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:53,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:53,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:24:53,165 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:24:53,169 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:24:53,169 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:24:53,170 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52" (1/1) ... [2025-02-06 04:24:53,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:24:53,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:24:53,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:24:53,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:24:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:24:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:24:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:24:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:24:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:24:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:24:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 04:24:53,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 04:24:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 04:24:53,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 04:24:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 04:24:53,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 04:24:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-02-06 04:24:53,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-02-06 04:24:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:24:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:24:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:24:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:24:53,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:24:53,245 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:24:53,363 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:24:53,364 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:24:53,674 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:24:53,674 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:24:54,078 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:24:54,078 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:24:54,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:24:54 BoogieIcfgContainer [2025-02-06 04:24:54,079 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:24:54,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:24:54,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:24:54,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:24:54,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:24:52" (1/3) ... [2025-02-06 04:24:54,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216b5665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:24:54, skipping insertion in model container [2025-02-06 04:24:54,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:52" (2/3) ... [2025-02-06 04:24:54,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216b5665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:24:54, skipping insertion in model container [2025-02-06 04:24:54,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:24:54" (3/3) ... [2025-02-06 04:24:54,087 INFO L128 eAbstractionObserver]: Analyzing ICFG safe016_rmo.opt.i [2025-02-06 04:24:54,097 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:24:54,100 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe016_rmo.opt.i that has 5 procedures, 45 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-06 04:24:54,100 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:24:54,167 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:24:54,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 106 flow [2025-02-06 04:24:54,234 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2025-02-06 04:24:54,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:24:54,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 1/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-02-06 04:24:54,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 45 transitions, 106 flow [2025-02-06 04:24:54,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 88 flow [2025-02-06 04:24:54,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:24:54,267 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;@489b2e2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:24:54,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 04:24:54,286 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:24:54,286 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-02-06 04:24:54,286 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:24:54,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:24:54,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:24:54,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:24:54,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:24:54,297 INFO L85 PathProgramCache]: Analyzing trace with hash -504818187, now seen corresponding path program 1 times [2025-02-06 04:24:54,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:24:54,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842801319] [2025-02-06 04:24:54,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:24:54,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:24:54,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:24:54,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:24:54,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:24:54,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:24:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:24:55,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:24:55,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842801319] [2025-02-06 04:24:55,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842801319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:24:55,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:24:55,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:24:55,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994854614] [2025-02-06 04:24:55,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:24:55,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:24:55,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:24:55,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:24:55,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:24:55,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 04:24:55,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:24:55,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:24:55,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 04:24:55,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:24:59,373 INFO L124 PetriNetUnfolderBase]: 27202/36947 cut-off events. [2025-02-06 04:24:59,374 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2025-02-06 04:24:59,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73572 conditions, 36947 events. 27202/36947 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 1228. Compared 221448 event pairs, 3582 based on Foata normal form. 900/37834 useless extension candidates. Maximal degree in co-relation 73560. Up to 26651 conditions per place. [2025-02-06 04:24:59,578 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 54 selfloop transitions, 2 changer transitions 65/126 dead transitions. [2025-02-06 04:24:59,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 126 transitions, 515 flow [2025-02-06 04:24:59,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:24:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:24:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2025-02-06 04:24:59,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-02-06 04:24:59,590 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 7 states and 186 transitions. [2025-02-06 04:24:59,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 126 transitions, 515 flow [2025-02-06 04:24:59,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 126 transitions, 508 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:24:59,604 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 100 flow [2025-02-06 04:24:59,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=100, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2025-02-06 04:24:59,609 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2025-02-06 04:24:59,609 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 100 flow [2025-02-06 04:24:59,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:24:59,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:24:59,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:24:59,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:24:59,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:24:59,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:24:59,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1512207412, now seen corresponding path program 1 times [2025-02-06 04:24:59,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:24:59,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509347351] [2025-02-06 04:24:59,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:24:59,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:24:59,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:24:59,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:24:59,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:24:59,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:24:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:24:59,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:24:59,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509347351] [2025-02-06 04:24:59,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509347351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:24:59,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:24:59,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:24:59,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285896695] [2025-02-06 04:24:59,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:24:59,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:24:59,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:24:59,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:24:59,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:24:59,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 04:24:59,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-02-06 04:24:59,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:24:59,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 04:24:59,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:04,556 INFO L124 PetriNetUnfolderBase]: 37377/50369 cut-off events. [2025-02-06 04:25:04,557 INFO L125 PetriNetUnfolderBase]: For 4982/4982 co-relation queries the response was YES. [2025-02-06 04:25:04,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108016 conditions, 50369 events. 37377/50369 cut-off events. For 4982/4982 co-relation queries the response was YES. Maximal size of possible extension queue 1653. Compared 296010 event pairs, 4425 based on Foata normal form. 750/51044 useless extension candidates. Maximal degree in co-relation 108001. Up to 24271 conditions per place. [2025-02-06 04:25:04,752 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 61 selfloop transitions, 4 changer transitions 69/139 dead transitions. [2025-02-06 04:25:04,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 139 transitions, 589 flow [2025-02-06 04:25:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:25:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:25:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2025-02-06 04:25:04,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-02-06 04:25:04,754 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 100 flow. Second operand 8 states and 208 transitions. [2025-02-06 04:25:04,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 139 transitions, 589 flow [2025-02-06 04:25:05,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 139 transitions, 567 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 04:25:05,630 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 130 flow [2025-02-06 04:25:05,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2025-02-06 04:25:05,631 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2025-02-06 04:25:05,632 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 130 flow [2025-02-06 04:25:05,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-02-06 04:25:05,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:05,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:05,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:25:05,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:25:05,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1754330793, now seen corresponding path program 1 times [2025-02-06 04:25:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:05,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902507124] [2025-02-06 04:25:05,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:05,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:05,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:25:05,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:25:05,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:05,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:06,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:06,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902507124] [2025-02-06 04:25:06,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902507124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:06,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:06,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:25:06,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357799024] [2025-02-06 04:25:06,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:06,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:25:06,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:06,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:25:06,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:25:06,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 04:25:06,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-02-06 04:25:06,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:06,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 04:25:06,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:08,977 INFO L124 PetriNetUnfolderBase]: 22567/30698 cut-off events. [2025-02-06 04:25:08,977 INFO L125 PetriNetUnfolderBase]: For 17241/17241 co-relation queries the response was YES. [2025-02-06 04:25:09,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75163 conditions, 30698 events. 22567/30698 cut-off events. For 17241/17241 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 171457 event pairs, 9457 based on Foata normal form. 600/31290 useless extension candidates. Maximal degree in co-relation 75146. Up to 23556 conditions per place. [2025-02-06 04:25:09,254 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 52 selfloop transitions, 2 changer transitions 57/116 dead transitions. [2025-02-06 04:25:09,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 116 transitions, 540 flow [2025-02-06 04:25:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:25:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:25:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-02-06 04:25:09,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-02-06 04:25:09,261 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 130 flow. Second operand 7 states and 174 transitions. [2025-02-06 04:25:09,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 116 transitions, 540 flow [2025-02-06 04:25:09,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 116 transitions, 520 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-06 04:25:09,603 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 135 flow [2025-02-06 04:25:09,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2025-02-06 04:25:09,603 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-02-06 04:25:09,604 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 135 flow [2025-02-06 04:25:09,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-02-06 04:25:09,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:09,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:09,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:25:09,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:25:09,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:09,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1138015622, now seen corresponding path program 1 times [2025-02-06 04:25:09,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:09,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040657970] [2025-02-06 04:25:09,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:09,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:09,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:25:09,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:25:09,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:09,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:09,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:09,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040657970] [2025-02-06 04:25:09,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040657970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:09,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:09,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:25:09,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999814571] [2025-02-06 04:25:09,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:09,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:25:09,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:09,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:25:09,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:25:09,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 04:25:09,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-02-06 04:25:09,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:09,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 04:25:09,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:15,851 INFO L124 PetriNetUnfolderBase]: 48312/65047 cut-off events. [2025-02-06 04:25:15,852 INFO L125 PetriNetUnfolderBase]: For 35178/35178 co-relation queries the response was YES. [2025-02-06 04:25:16,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152250 conditions, 65047 events. 48312/65047 cut-off events. For 35178/35178 co-relation queries the response was YES. Maximal size of possible extension queue 2061. Compared 393028 event pairs, 12225 based on Foata normal form. 1300/66334 useless extension candidates. Maximal degree in co-relation 152230. Up to 20109 conditions per place. [2025-02-06 04:25:16,244 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 54 selfloop transitions, 3 changer transitions 132/194 dead transitions. [2025-02-06 04:25:16,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 194 transitions, 893 flow [2025-02-06 04:25:16,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:25:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:25:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 290 transitions. [2025-02-06 04:25:16,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2025-02-06 04:25:16,246 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 135 flow. Second operand 11 states and 290 transitions. [2025-02-06 04:25:16,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 194 transitions, 893 flow [2025-02-06 04:25:18,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 194 transitions, 853 flow, removed 18 selfloop flow, removed 6 redundant places. [2025-02-06 04:25:18,022 INFO L231 Difference]: Finished difference. Result has 73 places, 40 transitions, 150 flow [2025-02-06 04:25:18,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=150, PETRI_PLACES=73, PETRI_TRANSITIONS=40} [2025-02-06 04:25:18,023 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2025-02-06 04:25:18,023 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 40 transitions, 150 flow [2025-02-06 04:25:18,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-02-06 04:25:18,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:18,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:18,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:25:18,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:25:18,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:18,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1413993324, now seen corresponding path program 1 times [2025-02-06 04:25:18,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:18,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89409069] [2025-02-06 04:25:18,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:18,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:18,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:25:18,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:25:18,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:18,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:18,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:18,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89409069] [2025-02-06 04:25:18,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89409069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:18,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:18,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:25:18,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021337059] [2025-02-06 04:25:18,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:18,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:25:18,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:18,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:25:18,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:25:18,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 04:25:18,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 40 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-02-06 04:25:18,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:18,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 04:25:18,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:22,553 INFO L124 PetriNetUnfolderBase]: 30402/41886 cut-off events. [2025-02-06 04:25:22,553 INFO L125 PetriNetUnfolderBase]: For 52810/52810 co-relation queries the response was YES. [2025-02-06 04:25:22,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103299 conditions, 41886 events. 30402/41886 cut-off events. For 52810/52810 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 250154 event pairs, 7992 based on Foata normal form. 900/42783 useless extension candidates. Maximal degree in co-relation 103275. Up to 33301 conditions per place. [2025-02-06 04:25:22,895 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 53 selfloop transitions, 3 changer transitions 52/113 dead transitions. [2025-02-06 04:25:22,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 113 transitions, 610 flow [2025-02-06 04:25:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:25:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:25:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2025-02-06 04:25:22,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5365079365079365 [2025-02-06 04:25:22,897 INFO L175 Difference]: Start difference. First operand has 73 places, 40 transitions, 150 flow. Second operand 7 states and 169 transitions. [2025-02-06 04:25:22,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 113 transitions, 610 flow [2025-02-06 04:25:23,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 113 transitions, 560 flow, removed 20 selfloop flow, removed 9 redundant places. [2025-02-06 04:25:23,408 INFO L231 Difference]: Finished difference. Result has 67 places, 42 transitions, 162 flow [2025-02-06 04:25:23,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=67, PETRI_TRANSITIONS=42} [2025-02-06 04:25:23,409 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2025-02-06 04:25:23,409 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 42 transitions, 162 flow [2025-02-06 04:25:23,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-02-06 04:25:23,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:23,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:23,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:25:23,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:25:23,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash -908774704, now seen corresponding path program 1 times [2025-02-06 04:25:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:23,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287419529] [2025-02-06 04:25:23,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:23,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:23,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:25:23,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:25:23,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:23,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:23,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:23,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287419529] [2025-02-06 04:25:23,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287419529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:23,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:23,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:25:23,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942878417] [2025-02-06 04:25:23,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:23,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:25:23,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:23,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:25:23,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:25:23,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 04:25:23,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 42 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-02-06 04:25:23,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:23,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 04:25:23,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand