./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.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 ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:45:51,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:45:51,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:45:51,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:45:51,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:45:51,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:45:51,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:45:51,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:45:51,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:45:51,235 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:45:51,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:45:51,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:45:51,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:45:51,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:45:51,236 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:45:51,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:45:51,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:45:51,236 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:45:51,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:45:51,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:45:51,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:45:51,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:45:51,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:45:51,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:45:51,237 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:45:51,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:45:51,237 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:45:51,237 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:45:51,237 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:45:51,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:45:51,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:45:51,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:45:51,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:45:51,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:45:51,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:45:51,238 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:45:51,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:45:51,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:45:51,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:45:51,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:45:51,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:45:51,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:45:51,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:45:51,239 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 -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-03-14 00:45:51,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:45:51,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:45:51,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:45:51,478 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:45:51,478 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:45:51,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-14 00:45:52,624 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3804f9110/37a9b96ec63944ffb9ef54f0f9671484/FLAGc87444fc6 [2025-03-14 00:45:52,899 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:45:52,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-14 00:45:52,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3804f9110/37a9b96ec63944ffb9ef54f0f9671484/FLAGc87444fc6 [2025-03-14 00:45:53,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3804f9110/37a9b96ec63944ffb9ef54f0f9671484 [2025-03-14 00:45:53,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:45:53,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:45:53,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:45:53,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:45:53,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:45:53,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cbda4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53, skipping insertion in model container [2025-03-14 00:45:53,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:45:53,405 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/11_fmaxsymopt.i[30863,30876] [2025-03-14 00:45:53,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:45:53,424 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:45:53,452 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/11_fmaxsymopt.i[30863,30876] [2025-03-14 00:45:53,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:45:53,479 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:45:53,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53 WrapperNode [2025-03-14 00:45:53,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:45:53,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:45:53,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:45:53,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:45:53,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,502 INFO L138 Inliner]: procedures = 164, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-03-14 00:45:53,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:45:53,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:45:53,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:45:53,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:45:53,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,520 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-03-14 00:45:53,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,524 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:45:53,527 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:45:53,527 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:45:53,527 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:45:53,528 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53" (1/1) ... [2025-03-14 00:45:53,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:45:53,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:53,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 00:45:53,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 00:45:53,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 00:45:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:45:53,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:45:53,569 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:45:53,682 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:45:53,684 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:45:53,858 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:45:53,859 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:45:53,859 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:45:53,966 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:45:53,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:45:53 BoogieIcfgContainer [2025-03-14 00:45:53,967 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:45:53,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:45:53,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:45:53,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:45:53,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:45:53" (1/3) ... [2025-03-14 00:45:53,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311e5258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:45:53, skipping insertion in model container [2025-03-14 00:45:53,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:45:53" (2/3) ... [2025-03-14 00:45:53,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311e5258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:45:53, skipping insertion in model container [2025-03-14 00:45:53,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:45:53" (3/3) ... [2025-03-14 00:45:53,973 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-03-14 00:45:53,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:45:53,983 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 21 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-14 00:45:53,984 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:45:54,021 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:45:54,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 25 transitions, 54 flow [2025-03-14 00:45:54,062 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-03-14 00:45:54,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:45:54,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-03-14 00:45:54,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 25 transitions, 54 flow [2025-03-14 00:45:54,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 25 transitions, 54 flow [2025-03-14 00:45:54,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:45:54,088 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;@15748e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:45:54,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 00:45:54,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:45:54,095 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-03-14 00:45:54,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:45:54,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:54,095 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-14 00:45:54,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-14 00:45:54,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:54,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2127079005, now seen corresponding path program 1 times [2025-03-14 00:45:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:54,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420219981] [2025-03-14 00:45:54,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:54,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:45:54,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:45:54,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:54,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:54,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:54,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420219981] [2025-03-14 00:45:54,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420219981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:45:54,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:45:54,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:45:54,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139434567] [2025-03-14 00:45:54,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:45:54,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:45:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:54,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:45:54,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:45:54,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-14 00:45:54,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 25 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:54,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:54,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-14 00:45:54,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:54,352 INFO L124 PetriNetUnfolderBase]: 23/73 cut-off events. [2025-03-14 00:45:54,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:45:54,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 73 events. 23/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 171 event pairs, 16 based on Foata normal form. 3/71 useless extension candidates. Maximal degree in co-relation 109. Up to 51 conditions per place. [2025-03-14 00:45:54,354 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 14 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2025-03-14 00:45:54,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 84 flow [2025-03-14 00:45:54,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:45:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:45:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-03-14 00:45:54,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2025-03-14 00:45:54,364 INFO L175 Difference]: Start difference. First operand has 24 places, 25 transitions, 54 flow. Second operand 3 states and 43 transitions. [2025-03-14 00:45:54,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 84 flow [2025-03-14 00:45:54,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 00:45:54,368 INFO L231 Difference]: Finished difference. Result has 26 places, 24 transitions, 62 flow [2025-03-14 00:45:54,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=26, PETRI_TRANSITIONS=24} [2025-03-14 00:45:54,375 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-03-14 00:45:54,375 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2025-03-14 00:45:54,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:54,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:54,376 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:54,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:45:54,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-14 00:45:54,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash -455084267, now seen corresponding path program 1 times [2025-03-14 00:45:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524659934] [2025-03-14 00:45:54,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:54,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:54,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:45:54,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:45:54,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:54,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:54,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:54,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524659934] [2025-03-14 00:45:54,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524659934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:54,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129062490] [2025-03-14 00:45:54,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:54,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:54,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:54,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:54,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 00:45:54,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:45:54,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:45:54,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:54,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:54,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 00:45:54,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:54,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:54,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129062490] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:54,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:54,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-14 00:45:54,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607054614] [2025-03-14 00:45:54,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:54,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:45:54,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:54,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:45:54,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:45:54,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-14 00:45:54,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:54,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:54,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-14 00:45:54,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:54,653 INFO L124 PetriNetUnfolderBase]: 23/76 cut-off events. [2025-03-14 00:45:54,653 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:45:54,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 76 events. 23/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 171 event pairs, 16 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 133. Up to 51 conditions per place. [2025-03-14 00:45:54,654 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 14 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2025-03-14 00:45:54,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 112 flow [2025-03-14 00:45:54,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:45:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:45:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2025-03-14 00:45:54,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-14 00:45:54,656 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 6 states and 70 transitions. [2025-03-14 00:45:54,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 112 flow [2025-03-14 00:45:54,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 108 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 00:45:54,657 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 94 flow [2025-03-14 00:45:54,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2025-03-14 00:45:54,658 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2025-03-14 00:45:54,658 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 94 flow [2025-03-14 00:45:54,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:54,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:54,658 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-03-14 00:45:54,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 00:45:54,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:54,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-14 00:45:54,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1965827619, now seen corresponding path program 2 times [2025-03-14 00:45:54,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:54,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208265631] [2025-03-14 00:45:54,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:45:54,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:54,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-14 00:45:54,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:45:54,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:45:54,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:54,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:54,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208265631] [2025-03-14 00:45:54,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208265631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:54,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426097420] [2025-03-14 00:45:54,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:45:54,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:54,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:54,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:54,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 00:45:55,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-14 00:45:55,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:45:55,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:45:55,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:55,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 00:45:55,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:55,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:55,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426097420] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:55,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:55,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-14 00:45:55,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50067658] [2025-03-14 00:45:55,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:55,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 00:45:55,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:55,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 00:45:55,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-14 00:45:55,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-14 00:45:55,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 94 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:55,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:55,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-14 00:45:55,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:55,163 INFO L124 PetriNetUnfolderBase]: 23/78 cut-off events. [2025-03-14 00:45:55,163 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-14 00:45:55,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 78 events. 23/78 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 171 event pairs, 16 based on Foata normal form. 2/76 useless extension candidates. Maximal degree in co-relation 124. Up to 51 conditions per place. [2025-03-14 00:45:55,165 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 14 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2025-03-14 00:45:55,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 148 flow [2025-03-14 00:45:55,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 00:45:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 00:45:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2025-03-14 00:45:55,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.435 [2025-03-14 00:45:55,168 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 94 flow. Second operand 8 states and 87 transitions. [2025-03-14 00:45:55,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 148 flow [2025-03-14 00:45:55,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 134 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-14 00:45:55,169 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 116 flow [2025-03-14 00:45:55,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=116, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2025-03-14 00:45:55,170 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 17 predicate places. [2025-03-14 00:45:55,170 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 116 flow [2025-03-14 00:45:55,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:55,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:55,170 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2025-03-14 00:45:55,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 00:45:55,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-14 00:45:55,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-14 00:45:55,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1069632413, now seen corresponding path program 3 times [2025-03-14 00:45:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:55,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806659204] [2025-03-14 00:45:55,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:45:55,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:55,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-03-14 00:45:55,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-03-14 00:45:55,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 00:45:55,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:45:55,409 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:45:55,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-14 00:45:55,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-14 00:45:55,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:55,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:45:55,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:45:55,430 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:45:55,430 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-14 00:45:55,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-14 00:45:55,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-14 00:45:55,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:45:55,432 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-14 00:45:55,434 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:45:55,434 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 00:45:55,451 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:45:55,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 43 transitions, 96 flow [2025-03-14 00:45:55,463 INFO L124 PetriNetUnfolderBase]: 7/48 cut-off events. [2025-03-14 00:45:55,464 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:45:55,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 48 events. 7/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 111 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 37. Up to 3 conditions per place. [2025-03-14 00:45:55,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 43 transitions, 96 flow [2025-03-14 00:45:55,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 43 transitions, 96 flow [2025-03-14 00:45:55,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:45:55,467 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;@15748e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:45:55,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 00:45:55,470 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:45:55,472 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-03-14 00:45:55,472 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:45:55,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:55,472 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:55,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 00:45:55,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1207769093, now seen corresponding path program 1 times [2025-03-14 00:45:55,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848794721] [2025-03-14 00:45:55,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:55,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:55,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:45:55,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:45:55,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:55,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:55,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:55,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:55,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848794721] [2025-03-14 00:45:55,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848794721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:45:55,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:45:55,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:45:55,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329022106] [2025-03-14 00:45:55,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:45:55,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:45:55,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:55,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:45:55,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:45:55,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-14 00:45:55,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:55,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:55,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-14 00:45:55,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:55,613 INFO L124 PetriNetUnfolderBase]: 452/940 cut-off events. [2025-03-14 00:45:55,613 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-14 00:45:55,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 940 events. 452/940 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4852 event pairs, 376 based on Foata normal form. 83/971 useless extension candidates. Maximal degree in co-relation 954. Up to 708 conditions per place. [2025-03-14 00:45:55,619 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2025-03-14 00:45:55,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 144 flow [2025-03-14 00:45:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:45:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:45:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-03-14 00:45:55,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-03-14 00:45:55,620 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 96 flow. Second operand 3 states and 75 transitions. [2025-03-14 00:45:55,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 144 flow [2025-03-14 00:45:55,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 00:45:55,621 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 102 flow [2025-03-14 00:45:55,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-03-14 00:45:55,622 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-03-14 00:45:55,622 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 102 flow [2025-03-14 00:45:55,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:55,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:55,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:55,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:45:55,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 00:45:55,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:55,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1088867838, now seen corresponding path program 1 times [2025-03-14 00:45:55,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:55,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471737743] [2025-03-14 00:45:55,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:55,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:45:55,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:45:55,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:55,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:55,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:55,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471737743] [2025-03-14 00:45:55,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471737743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:55,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294486372] [2025-03-14 00:45:55,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:55,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:55,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:55,682 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:55,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 00:45:55,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:45:55,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:45:55,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:55,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:55,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 00:45:55,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:55,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:55,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294486372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:55,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:55,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-14 00:45:55,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793401793] [2025-03-14 00:45:55,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:55,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:45:55,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:55,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:45:55,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:45:55,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-14 00:45:55,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 102 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:55,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:55,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-14 00:45:55,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:55,881 INFO L124 PetriNetUnfolderBase]: 452/943 cut-off events. [2025-03-14 00:45:55,882 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-14 00:45:55,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1697 conditions, 943 events. 452/943 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4847 event pairs, 376 based on Foata normal form. 0/891 useless extension candidates. Maximal degree in co-relation 1684. Up to 708 conditions per place. [2025-03-14 00:45:55,887 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-03-14 00:45:55,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 172 flow [2025-03-14 00:45:55,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:45:55,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:45:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-03-14 00:45:55,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2025-03-14 00:45:55,889 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 102 flow. Second operand 6 states and 122 transitions. [2025-03-14 00:45:55,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 172 flow [2025-03-14 00:45:55,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 168 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 00:45:55,890 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 134 flow [2025-03-14 00:45:55,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-03-14 00:45:55,890 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2025-03-14 00:45:55,891 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 134 flow [2025-03-14 00:45:55,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:55,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:55,891 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:55,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 00:45:56,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:56,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 00:45:56,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:56,092 INFO L85 PathProgramCache]: Analyzing trace with hash 263671365, now seen corresponding path program 2 times [2025-03-14 00:45:56,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:56,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044519151] [2025-03-14 00:45:56,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:45:56,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:56,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-14 00:45:56,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-03-14 00:45:56,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:45:56,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 00:45:56,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:56,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044519151] [2025-03-14 00:45:56,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044519151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:45:56,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:45:56,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:45:56,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215001035] [2025-03-14 00:45:56,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:45:56,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:45:56,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:56,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:45:56,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:45:56,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-14 00:45:56,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:56,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:56,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-14 00:45:56,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:56,313 INFO L124 PetriNetUnfolderBase]: 764/1596 cut-off events. [2025-03-14 00:45:56,313 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-14 00:45:56,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2879 conditions, 1596 events. 764/1596 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9556 event pairs, 331 based on Foata normal form. 0/1515 useless extension candidates. Maximal degree in co-relation 2844. Up to 634 conditions per place. [2025-03-14 00:45:56,324 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 46 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-03-14 00:45:56,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 271 flow [2025-03-14 00:45:56,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:45:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:45:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-14 00:45:56,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2025-03-14 00:45:56,325 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 134 flow. Second operand 3 states and 87 transitions. [2025-03-14 00:45:56,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 271 flow [2025-03-14 00:45:56,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 257 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-14 00:45:56,327 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 134 flow [2025-03-14 00:45:56,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2025-03-14 00:45:56,327 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2025-03-14 00:45:56,327 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 134 flow [2025-03-14 00:45:56,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:56,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:56,328 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-03-14 00:45:56,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:45:56,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 00:45:56,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:56,328 INFO L85 PathProgramCache]: Analyzing trace with hash -559335426, now seen corresponding path program 1 times [2025-03-14 00:45:56,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:56,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856847893] [2025-03-14 00:45:56,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:56,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:56,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:45:56,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:45:56,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:56,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:56,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:56,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856847893] [2025-03-14 00:45:56,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856847893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:56,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241316938] [2025-03-14 00:45:56,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:56,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:56,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:56,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:56,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 00:45:56,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:45:56,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:45:56,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:56,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:56,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 00:45:56,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:56,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241316938] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:56,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-14 00:45:56,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709932568] [2025-03-14 00:45:56,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:56,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 00:45:56,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:56,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 00:45:56,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-14 00:45:56,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-14 00:45:56,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 134 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:56,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:56,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-14 00:45:56,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:56,693 INFO L124 PetriNetUnfolderBase]: 776/1626 cut-off events. [2025-03-14 00:45:56,694 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2025-03-14 00:45:56,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 1626 events. 776/1626 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9761 event pairs, 646 based on Foata normal form. 2/1535 useless extension candidates. Maximal degree in co-relation 3052. Up to 1206 conditions per place. [2025-03-14 00:45:56,702 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 26 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2025-03-14 00:45:56,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 212 flow [2025-03-14 00:45:56,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 00:45:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 00:45:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2025-03-14 00:45:56,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44476744186046513 [2025-03-14 00:45:56,704 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 134 flow. Second operand 8 states and 153 transitions. [2025-03-14 00:45:56,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 212 flow [2025-03-14 00:45:56,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:45:56,706 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 166 flow [2025-03-14 00:45:56,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=166, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2025-03-14 00:45:56,706 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2025-03-14 00:45:56,706 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 166 flow [2025-03-14 00:45:56,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:56,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:56,708 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1] [2025-03-14 00:45:56,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-14 00:45:56,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:56,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 00:45:56,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:56,909 INFO L85 PathProgramCache]: Analyzing trace with hash 509353758, now seen corresponding path program 2 times [2025-03-14 00:45:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:56,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985868830] [2025-03-14 00:45:56,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:45:56,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:56,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-14 00:45:56,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:45:56,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:45:56,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:45:56,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:45:56,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:45:56,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:45:56,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:56,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:45:56,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:45:56,941 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:45:56,942 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-14 00:45:56,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-14 00:45:56,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-14 00:45:56,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-14 00:45:56,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:45:56,942 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2025-03-14 00:45:56,942 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:45:56,942 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 00:45:56,966 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:45:56,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 140 flow [2025-03-14 00:45:56,973 INFO L124 PetriNetUnfolderBase]: 10/69 cut-off events. [2025-03-14 00:45:56,973 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 00:45:56,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 69 events. 10/69 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 186 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2025-03-14 00:45:56,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 140 flow [2025-03-14 00:45:56,975 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 140 flow [2025-03-14 00:45:56,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:45:56,976 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;@15748e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:45:56,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 00:45:56,979 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:45:56,980 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-03-14 00:45:56,980 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:45:56,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:56,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:56,981 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-14 00:45:56,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:56,981 INFO L85 PathProgramCache]: Analyzing trace with hash 268457494, now seen corresponding path program 1 times [2025-03-14 00:45:56,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:56,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764680817] [2025-03-14 00:45:56,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:56,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:56,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:45:56,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:45:56,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:56,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:57,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:57,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764680817] [2025-03-14 00:45:57,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764680817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:45:57,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:45:57,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:45:57,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453378993] [2025-03-14 00:45:57,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:45:57,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:45:57,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:57,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:45:57,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:45:57,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-14 00:45:57,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-03-14 00:45:57,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:57,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-14 00:45:57,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:57,664 INFO L124 PetriNetUnfolderBase]: 6485/10724 cut-off events. [2025-03-14 00:45:57,664 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-03-14 00:45:57,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19890 conditions, 10724 events. 6485/10724 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 72597 event pairs, 5560 based on Foata normal form. 1265/11470 useless extension candidates. Maximal degree in co-relation 2088. Up to 8808 conditions per place. [2025-03-14 00:45:57,721 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 34 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-03-14 00:45:57,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 206 flow [2025-03-14 00:45:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:45:57,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:45:57,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-14 00:45:57,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5846994535519126 [2025-03-14 00:45:57,722 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 140 flow. Second operand 3 states and 107 transitions. [2025-03-14 00:45:57,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 206 flow [2025-03-14 00:45:57,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 204 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-14 00:45:57,724 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 142 flow [2025-03-14 00:45:57,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2025-03-14 00:45:57,725 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-03-14 00:45:57,725 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 142 flow [2025-03-14 00:45:57,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-03-14 00:45:57,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:57,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:57,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 00:45:57,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:45:57,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:57,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1563983692, now seen corresponding path program 1 times [2025-03-14 00:45:57,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:57,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991463903] [2025-03-14 00:45:57,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:57,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:57,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:45:57,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:45:57,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:57,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:57,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:57,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991463903] [2025-03-14 00:45:57,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991463903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:57,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614525590] [2025-03-14 00:45:57,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:57,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:57,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:57,760 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:57,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 00:45:57,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:45:57,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:45:57,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:57,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:57,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 00:45:57,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:57,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:57,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614525590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:57,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:57,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-14 00:45:57,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587784206] [2025-03-14 00:45:57,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:57,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:45:57,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:57,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:45:57,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:45:57,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-14 00:45:57,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 142 flow. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:57,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:57,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-14 00:45:57,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:58,649 INFO L124 PetriNetUnfolderBase]: 6485/10727 cut-off events. [2025-03-14 00:45:58,649 INFO L125 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2025-03-14 00:45:58,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19825 conditions, 10727 events. 6485/10727 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 72524 event pairs, 5560 based on Foata normal form. 0/10208 useless extension candidates. Maximal degree in co-relation 19811. Up to 8808 conditions per place. [2025-03-14 00:45:58,691 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 34 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2025-03-14 00:45:58,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 232 flow [2025-03-14 00:45:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:45:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:45:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2025-03-14 00:45:58,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47540983606557374 [2025-03-14 00:45:58,693 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 142 flow. Second operand 6 states and 174 transitions. [2025-03-14 00:45:58,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 232 flow [2025-03-14 00:45:58,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 228 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 00:45:58,695 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 174 flow [2025-03-14 00:45:58,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-03-14 00:45:58,696 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-03-14 00:45:58,696 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 174 flow [2025-03-14 00:45:58,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:58,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:58,696 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:58,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-14 00:45:58,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-14 00:45:58,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:45:58,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:58,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1319373930, now seen corresponding path program 2 times [2025-03-14 00:45:58,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:58,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547805463] [2025-03-14 00:45:58,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:45:58,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:58,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-14 00:45:58,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-03-14 00:45:58,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:45:58,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 00:45:58,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:58,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547805463] [2025-03-14 00:45:58,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547805463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:45:58,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:45:58,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:45:58,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943534742] [2025-03-14 00:45:58,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:45:58,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:45:58,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:58,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:45:58,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:45:58,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-03-14 00:45:58,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:58,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:58,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-03-14 00:45:58,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:59,904 INFO L124 PetriNetUnfolderBase]: 10967/18271 cut-off events. [2025-03-14 00:45:59,904 INFO L125 PetriNetUnfolderBase]: For 528/528 co-relation queries the response was YES. [2025-03-14 00:45:59,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33703 conditions, 18271 events. 10967/18271 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 136829 event pairs, 4912 based on Foata normal form. 0/17486 useless extension candidates. Maximal degree in co-relation 33667. Up to 7834 conditions per place. [2025-03-14 00:45:59,990 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 66 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-03-14 00:45:59,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 376 flow [2025-03-14 00:45:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:45:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:45:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-03-14 00:45:59,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6994535519125683 [2025-03-14 00:45:59,991 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 174 flow. Second operand 3 states and 128 transitions. [2025-03-14 00:45:59,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 376 flow [2025-03-14 00:45:59,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 362 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-14 00:45:59,994 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 174 flow [2025-03-14 00:45:59,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2025-03-14 00:45:59,994 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2025-03-14 00:45:59,994 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 174 flow [2025-03-14 00:45:59,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:59,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:59,995 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:59,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 00:45:59,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:45:59,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1904151662, now seen corresponding path program 1 times [2025-03-14 00:45:59,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:59,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990129892] [2025-03-14 00:45:59,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:45:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:00,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 00:46:00,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 00:46:00,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:00,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 00:46:00,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:00,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990129892] [2025-03-14 00:46:00,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990129892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:00,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:00,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:46:00,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153186240] [2025-03-14 00:46:00,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:00,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:00,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:00,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:00,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:00,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-03-14 00:46:00,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:46:00,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:00,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-03-14 00:46:00,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:01,755 INFO L124 PetriNetUnfolderBase]: 18668/31005 cut-off events. [2025-03-14 00:46:01,755 INFO L125 PetriNetUnfolderBase]: For 4419/4419 co-relation queries the response was YES. [2025-03-14 00:46:01,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59770 conditions, 31005 events. 18668/31005 cut-off events. For 4419/4419 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 250148 event pairs, 8353 based on Foata normal form. 0/29699 useless extension candidates. Maximal degree in co-relation 59739. Up to 13303 conditions per place. [2025-03-14 00:46:01,950 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 69 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-03-14 00:46:01,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 391 flow [2025-03-14 00:46:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-03-14 00:46:01,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6939890710382514 [2025-03-14 00:46:01,952 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 174 flow. Second operand 3 states and 127 transitions. [2025-03-14 00:46:01,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 391 flow [2025-03-14 00:46:01,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:46:01,968 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 184 flow [2025-03-14 00:46:01,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2025-03-14 00:46:01,969 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2025-03-14 00:46:01,969 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 184 flow [2025-03-14 00:46:01,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:46:01,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:01,970 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:01,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 00:46:01,970 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:46:01,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:01,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1280505814, now seen corresponding path program 1 times [2025-03-14 00:46:01,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:01,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146061073] [2025-03-14 00:46:01,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:01,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:01,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 00:46:01,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 00:46:01,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:01,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:02,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:02,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146061073] [2025-03-14 00:46:02,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146061073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:46:02,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157095654] [2025-03-14 00:46:02,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:02,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:46:02,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:46:02,038 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:46:02,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 00:46:02,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 00:46:02,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 00:46:02,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:02,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:02,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 00:46:02,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:46:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:02,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:46:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:02,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157095654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:46:02,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:46:02,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-14 00:46:02,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208726435] [2025-03-14 00:46:02,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:46:02,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 00:46:02,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:02,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 00:46:02,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-14 00:46:02,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-14 00:46:02,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 184 flow. Second operand has 9 states, 9 states have (on average 23.77777777777778) internal successors, (214), 9 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:46:02,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:02,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-14 00:46:02,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:04,066 INFO L124 PetriNetUnfolderBase]: 18836/31249 cut-off events. [2025-03-14 00:46:04,066 INFO L125 PetriNetUnfolderBase]: For 5514/5514 co-relation queries the response was YES. [2025-03-14 00:46:04,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61815 conditions, 31249 events. 18836/31249 cut-off events. For 5514/5514 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 251584 event pairs, 16018 based on Foata normal form. 2/29730 useless extension candidates. Maximal degree in co-relation 61775. Up to 25299 conditions per place. [2025-03-14 00:46:04,296 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 38 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2025-03-14 00:46:04,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 65 transitions, 286 flow [2025-03-14 00:46:04,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 00:46:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 00:46:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2025-03-14 00:46:04,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4487704918032787 [2025-03-14 00:46:04,298 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 184 flow. Second operand 8 states and 219 transitions. [2025-03-14 00:46:04,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 65 transitions, 286 flow [2025-03-14 00:46:04,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 65 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:46:04,323 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 216 flow [2025-03-14 00:46:04,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2025-03-14 00:46:04,324 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 21 predicate places. [2025-03-14 00:46:04,324 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 216 flow [2025-03-14 00:46:04,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.77777777777778) internal successors, (214), 9 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:46:04,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:04,324 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:04,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-14 00:46:04,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:46:04,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 00:46:04,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:04,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1076328810, now seen corresponding path program 2 times [2025-03-14 00:46:04,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:04,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001056779] [2025-03-14 00:46:04,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:46:04,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:04,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-14 00:46:04,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 00:46:04,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:46:04,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:04,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:46:04,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 00:46:04,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 00:46:04,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:04,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:46:04,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:46:04,568 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:46:04,569 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-14 00:46:04,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-14 00:46:04,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-14 00:46:04,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-14 00:46:04,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-14 00:46:04,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 00:46:04,570 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-03-14 00:46:04,570 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:46:04,570 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 00:46:04,601 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:46:04,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 79 transitions, 186 flow [2025-03-14 00:46:04,610 INFO L124 PetriNetUnfolderBase]: 13/90 cut-off events. [2025-03-14 00:46:04,610 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 00:46:04,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 90 events. 13/90 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 272 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2025-03-14 00:46:04,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 79 transitions, 186 flow [2025-03-14 00:46:04,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 79 transitions, 186 flow [2025-03-14 00:46:04,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:46:04,612 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;@15748e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:46:04,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 00:46:04,614 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:46:04,614 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-03-14 00:46:04,614 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:46:04,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:04,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:04,615 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-14 00:46:04,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:04,615 INFO L85 PathProgramCache]: Analyzing trace with hash -36816537, now seen corresponding path program 1 times [2025-03-14 00:46:04,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:04,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317074157] [2025-03-14 00:46:04,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:04,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:04,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:46:04,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:46:04,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:04,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:04,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:04,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317074157] [2025-03-14 00:46:04,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317074157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:04,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:04,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:46:04,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803986345] [2025-03-14 00:46:04,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:04,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:04,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:04,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:04,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:04,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2025-03-14 00:46:04,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:46:04,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:04,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2025-03-14 00:46:04,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:11,107 INFO L124 PetriNetUnfolderBase]: 80345/117739 cut-off events. [2025-03-14 00:46:11,108 INFO L125 PetriNetUnfolderBase]: For 9197/9197 co-relation queries the response was YES. [2025-03-14 00:46:11,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223134 conditions, 117739 events. 80345/117739 cut-off events. For 9197/9197 co-relation queries the response was YES. Maximal size of possible extension queue 3143. Compared 905583 event pairs, 69712 based on Foata normal form. 16246/129231 useless extension candidates. Maximal degree in co-relation 19970. Up to 101391 conditions per place. [2025-03-14 00:46:11,761 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 44 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-03-14 00:46:11,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 75 transitions, 270 flow [2025-03-14 00:46:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:46:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:46:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-03-14 00:46:11,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5864978902953587 [2025-03-14 00:46:11,763 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 186 flow. Second operand 3 states and 139 transitions. [2025-03-14 00:46:11,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 75 transitions, 270 flow [2025-03-14 00:46:11,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 264 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-14 00:46:11,767 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 182 flow [2025-03-14 00:46:11,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2025-03-14 00:46:11,767 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-03-14 00:46:11,768 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 182 flow [2025-03-14 00:46:11,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:46:11,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:11,768 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:11,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 00:46:11,768 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-14 00:46:11,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash 203727852, now seen corresponding path program 1 times [2025-03-14 00:46:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:11,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113590599] [2025-03-14 00:46:11,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:11,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:11,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:46:11,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:46:11,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:11,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:11,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:11,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113590599] [2025-03-14 00:46:11,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113590599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:46:11,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080559710] [2025-03-14 00:46:11,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:46:11,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:46:11,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:46:11,805 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:46:11,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 00:46:11,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:46:11,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:46:11,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:46:11,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:11,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 00:46:11,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:46:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:11,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:46:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:46:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080559710] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:46:11,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:46:11,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-14 00:46:11,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284222640] [2025-03-14 00:46:11,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:46:11,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:46:11,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:11,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:46:11,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:46:11,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2025-03-14 00:46:11,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:46:11,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:11,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2025-03-14 00:46:11,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:46:18,548 INFO L124 PetriNetUnfolderBase]: 80345/117742 cut-off events. [2025-03-14 00:46:18,548 INFO L125 PetriNetUnfolderBase]: For 3919/3919 co-relation queries the response was YES. [2025-03-14 00:46:18,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221611 conditions, 117742 events. 80345/117742 cut-off events. For 3919/3919 co-relation queries the response was YES. Maximal size of possible extension queue 3143. Compared 905896 event pairs, 69712 based on Foata normal form. 0/112988 useless extension candidates. Maximal degree in co-relation 221596. Up to 101391 conditions per place. [2025-03-14 00:46:19,192 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 44 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2025-03-14 00:46:19,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 78 transitions, 292 flow [2025-03-14 00:46:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:46:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:46:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2025-03-14 00:46:19,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4767932489451477 [2025-03-14 00:46:19,193 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 182 flow. Second operand 6 states and 226 transitions. [2025-03-14 00:46:19,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 78 transitions, 292 flow [2025-03-14 00:46:19,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 78 transitions, 288 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 00:46:19,204 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 214 flow [2025-03-14 00:46:19,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2025-03-14 00:46:19,204 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-03-14 00:46:19,204 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 214 flow [2025-03-14 00:46:19,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:46:19,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:46:19,204 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:46:19,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 00:46:19,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:46:19,408 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:46:19,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:46:19,408 INFO L85 PathProgramCache]: Analyzing trace with hash 358036135, now seen corresponding path program 2 times [2025-03-14 00:46:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:46:19,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505926528] [2025-03-14 00:46:19,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:46:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:46:19,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-14 00:46:19,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-03-14 00:46:19,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:46:19,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:46:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 00:46:19,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:46:19,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505926528] [2025-03-14 00:46:19,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505926528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:46:19,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:46:19,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:46:19,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941374041] [2025-03-14 00:46:19,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:46:19,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:46:19,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:46:19,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:46:19,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:46:19,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2025-03-14 00:46:19,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:46:19,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:46:19,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2025-03-14 00:46:19,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand