./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 06:20:29,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:20:29,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:20:29,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:20:29,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:20:29,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:20:29,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:20:29,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:20:29,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:20:29,564 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:20:29,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:20:29,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:20:29,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:20:29,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:20:29,565 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:20:29,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:20:29,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:20:29,566 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:20:29,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:20:29,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:20:29,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:20:29,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:20:29,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:20:29,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:20:29,566 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:20:29,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:20:29,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:20:29,566 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:20:29,566 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:20:29,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:20:29,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:20:29,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:20:29,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:20:29,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:20:29,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:20:29,567 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:20:29,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:20:29,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:20:29,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:20:29,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:20:29,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:20:29,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:20:29,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:20:29,568 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-17 06:20:29,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:20:29,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:20:29,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:20:29,810 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:20:29,811 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:20:29,812 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-17 06:20:30,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a32dbbbf/175e6b9324b04ca4bb3372934ed35f19/FLAG0f9849ae3 [2025-03-17 06:20:31,238 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:20:31,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-17 06:20:31,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a32dbbbf/175e6b9324b04ca4bb3372934ed35f19/FLAG0f9849ae3 [2025-03-17 06:20:31,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a32dbbbf/175e6b9324b04ca4bb3372934ed35f19 [2025-03-17 06:20:31,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:20:31,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:20:31,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:20:31,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:20:31,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:20:31,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a751b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31, skipping insertion in model container [2025-03-17 06:20:31,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:20:31,737 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-17 06:20:31,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:20:31,754 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:20:31,782 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-17 06:20:31,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:20:31,811 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:20:31,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31 WrapperNode [2025-03-17 06:20:31,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:20:31,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:20:31,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:20:31,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:20:31,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,836 INFO L138 Inliner]: procedures = 164, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-03-17 06:20:31,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:20:31,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:20:31,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:20:31,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:20:31,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,858 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-17 06:20:31,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,864 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:20:31,868 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:20:31,868 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:20:31,868 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:20:31,869 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31" (1/1) ... [2025-03-17 06:20:31,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:20:31,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:20:31,902 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-17 06:20:31,909 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-17 06:20:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:20:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:20:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 06:20:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 06:20:31,924 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 06:20:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:20:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:20:31,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 06:20:31,925 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 06:20:31,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:20:31,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:20:31,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:20:31,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 06:20:31,926 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 06:20:31,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:20:31,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:20:31,927 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:20:32,028 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:20:32,030 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:20:32,225 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:20:32,227 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:20:32,356 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:20:32,356 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:20:32,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:20:32 BoogieIcfgContainer [2025-03-17 06:20:32,357 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:20:32,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:20:32,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:20:32,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:20:32,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:20:31" (1/3) ... [2025-03-17 06:20:32,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4931a785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:20:32, skipping insertion in model container [2025-03-17 06:20:32,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:20:31" (2/3) ... [2025-03-17 06:20:32,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4931a785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:20:32, skipping insertion in model container [2025-03-17 06:20:32,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:20:32" (3/3) ... [2025-03-17 06:20:32,365 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-03-17 06:20:32,375 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:20:32,377 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-17 06:20:32,377 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:20:32,419 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:20:32,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 25 transitions, 54 flow [2025-03-17 06:20:32,470 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-03-17 06:20:32,472 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:20:32,474 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-17 06:20:32,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 25 transitions, 54 flow [2025-03-17 06:20:32,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 25 transitions, 54 flow [2025-03-17 06:20:32,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:20:32,490 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;@6ebc113b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:20:32,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-17 06:20:32,495 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:20:32,495 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-03-17 06:20:32,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:20:32,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:32,496 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-17 06:20:32,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:20:32,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:32,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2098449854, now seen corresponding path program 1 times [2025-03-17 06:20:32,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:32,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632693049] [2025-03-17 06:20:32,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:32,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:32,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 06:20:32,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 06:20:32,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:32,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:32,687 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-17 06:20:32,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:32,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632693049] [2025-03-17 06:20:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632693049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:20:32,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:20:32,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:20:32,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417475484] [2025-03-17 06:20:32,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:20:32,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:20:32,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:32,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:20:32,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:20:32,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-17 06:20:32,726 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-17 06:20:32,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:32,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-17 06:20:32,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:32,798 INFO L124 PetriNetUnfolderBase]: 23/73 cut-off events. [2025-03-17 06:20:32,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:20:32,799 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-17 06:20:32,801 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 14 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2025-03-17 06:20:32,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 84 flow [2025-03-17 06:20:32,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:20:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:20:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-03-17 06:20:32,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2025-03-17 06:20:32,813 INFO L175 Difference]: Start difference. First operand has 24 places, 25 transitions, 54 flow. Second operand 3 states and 43 transitions. [2025-03-17 06:20:32,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 84 flow [2025-03-17 06:20:32,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 06:20:32,819 INFO L231 Difference]: Finished difference. Result has 26 places, 24 transitions, 62 flow [2025-03-17 06:20:32,821 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-17 06:20:32,823 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-03-17 06:20:32,823 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2025-03-17 06:20:32,823 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-17 06:20:32,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:32,824 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 06:20:32,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:20:32,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:20:32,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:32,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1313958797, now seen corresponding path program 1 times [2025-03-17 06:20:32,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:32,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699541633] [2025-03-17 06:20:32,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:32,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:32,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 06:20:32,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 06:20:32,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:32,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:32,934 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-17 06:20:32,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:32,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699541633] [2025-03-17 06:20:32,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699541633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:20:32,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312837730] [2025-03-17 06:20:32,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:32,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:20:32,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:20:32,937 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-17 06:20:32,938 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-17 06:20:32,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 06:20:33,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 06:20:33,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:33,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:33,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:20:33,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:20:33,046 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-17 06:20:33,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:20:33,064 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-17 06:20:33,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312837730] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:20:33,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:20:33,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 06:20:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589323574] [2025-03-17 06:20:33,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:20:33,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:20:33,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:33,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:20:33,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:20:33,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-17 06:20:33,067 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-17 06:20:33,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:33,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-17 06:20:33,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:33,122 INFO L124 PetriNetUnfolderBase]: 23/76 cut-off events. [2025-03-17 06:20:33,123 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:20:33,123 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-17 06:20:33,124 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 14 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2025-03-17 06:20:33,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 112 flow [2025-03-17 06:20:33,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:20:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:20:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2025-03-17 06:20:33,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-17 06:20:33,126 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 6 states and 70 transitions. [2025-03-17 06:20:33,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 112 flow [2025-03-17 06:20:33,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 108 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 06:20:33,127 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 94 flow [2025-03-17 06:20:33,128 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-17 06:20:33,128 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2025-03-17 06:20:33,128 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 94 flow [2025-03-17 06:20:33,128 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-17 06:20:33,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:33,128 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-03-17 06:20:33,135 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-17 06:20:33,329 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-17 06:20:33,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:20:33,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:33,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1368110722, now seen corresponding path program 2 times [2025-03-17 06:20:33,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:33,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490142095] [2025-03-17 06:20:33,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:20:33,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:33,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 06:20:33,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 06:20:33,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:20:33,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:33,464 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-17 06:20:33,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490142095] [2025-03-17 06:20:33,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490142095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:20:33,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873290175] [2025-03-17 06:20:33,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:20:33,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:20:33,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:20:33,467 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-17 06:20:33,469 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-17 06:20:33,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 06:20:33,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 06:20:33,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:20:33,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:33,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:20:33,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:20:33,543 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-17 06:20:33,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:20:33,575 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-17 06:20:33,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873290175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:20:33,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:20:33,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-17 06:20:33,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730938619] [2025-03-17 06:20:33,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:20:33,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:20:33,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:33,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:20:33,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:20:33,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-17 06:20:33,578 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-17 06:20:33,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:33,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-17 06:20:33,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:33,616 INFO L124 PetriNetUnfolderBase]: 23/78 cut-off events. [2025-03-17 06:20:33,616 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-17 06:20:33,617 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-17 06:20:33,619 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 14 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2025-03-17 06:20:33,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 148 flow [2025-03-17 06:20:33,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:20:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:20:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2025-03-17 06:20:33,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.435 [2025-03-17 06:20:33,625 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 94 flow. Second operand 8 states and 87 transitions. [2025-03-17 06:20:33,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 148 flow [2025-03-17 06:20:33,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 134 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 06:20:33,626 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 116 flow [2025-03-17 06:20:33,626 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-17 06:20:33,626 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 17 predicate places. [2025-03-17 06:20:33,627 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 116 flow [2025-03-17 06:20:33,627 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-17 06:20:33,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:33,627 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2025-03-17 06:20:33,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:20:33,827 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-17 06:20:33,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:20:33,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:33,828 INFO L85 PathProgramCache]: Analyzing trace with hash 519330, now seen corresponding path program 3 times [2025-03-17 06:20:33,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:33,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391645904] [2025-03-17 06:20:33,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:20:33,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:33,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-03-17 06:20:33,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 06:20:33,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 06:20:33,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:20:33,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:20:33,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 06:20:33,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 06:20:33,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:33,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:20:33,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:20:33,895 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:20:33,896 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-17 06:20:33,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-17 06:20:33,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-17 06:20:33,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:20:33,898 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-17 06:20:33,899 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 06:20:33,899 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 06:20:33,924 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:20:33,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 43 transitions, 96 flow [2025-03-17 06:20:33,934 INFO L124 PetriNetUnfolderBase]: 7/48 cut-off events. [2025-03-17 06:20:33,935 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 06:20:33,935 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-17 06:20:33,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 43 transitions, 96 flow [2025-03-17 06:20:33,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 43 transitions, 96 flow [2025-03-17 06:20:33,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:20:33,936 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;@6ebc113b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:20:33,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 06:20:33,939 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:20:33,939 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-03-17 06:20:33,939 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 06:20:33,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:33,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:20:33,940 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-17 06:20:33,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:33,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2095272774, now seen corresponding path program 1 times [2025-03-17 06:20:33,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:33,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237134654] [2025-03-17 06:20:33,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:33,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:33,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 06:20:33,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 06:20:33,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:33,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:33,978 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-17 06:20:33,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:33,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237134654] [2025-03-17 06:20:33,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237134654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:20:33,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:20:33,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:20:33,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297935021] [2025-03-17 06:20:33,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:20:33,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:20:33,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:33,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:20:33,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:20:33,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-17 06:20:33,980 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-17 06:20:33,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:33,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-17 06:20:33,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:34,159 INFO L124 PetriNetUnfolderBase]: 452/940 cut-off events. [2025-03-17 06:20:34,160 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-17 06:20:34,163 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-17 06:20:34,167 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2025-03-17 06:20:34,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 144 flow [2025-03-17 06:20:34,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:20:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:20:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-03-17 06:20:34,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-03-17 06:20:34,170 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 96 flow. Second operand 3 states and 75 transitions. [2025-03-17 06:20:34,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 144 flow [2025-03-17 06:20:34,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 06:20:34,171 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 102 flow [2025-03-17 06:20:34,171 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-17 06:20:34,172 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-03-17 06:20:34,172 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 102 flow [2025-03-17 06:20:34,172 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-17 06:20:34,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:34,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:20:34,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:20:34,172 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-17 06:20:34,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:34,174 INFO L85 PathProgramCache]: Analyzing trace with hash 233561184, now seen corresponding path program 1 times [2025-03-17 06:20:34,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:34,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50301179] [2025-03-17 06:20:34,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:34,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:34,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:20:34,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:20:34,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:34,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:34,219 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-17 06:20:34,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50301179] [2025-03-17 06:20:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50301179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:20:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405512241] [2025-03-17 06:20:34,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:34,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:20:34,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:20:34,224 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-17 06:20:34,226 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-17 06:20:34,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:20:34,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:20:34,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:34,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:34,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:20:34,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:20:34,290 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-17 06:20:34,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:20:34,311 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-17 06:20:34,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405512241] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:20:34,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:20:34,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 06:20:34,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274602930] [2025-03-17 06:20:34,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:20:34,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:20:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:34,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:20:34,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:20:34,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-17 06:20:34,313 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-17 06:20:34,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:34,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-17 06:20:34,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:34,445 INFO L124 PetriNetUnfolderBase]: 452/943 cut-off events. [2025-03-17 06:20:34,445 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-17 06:20:34,448 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-17 06:20:34,451 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-03-17 06:20:34,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 172 flow [2025-03-17 06:20:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:20:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:20:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-03-17 06:20:34,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2025-03-17 06:20:34,454 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 102 flow. Second operand 6 states and 122 transitions. [2025-03-17 06:20:34,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 172 flow [2025-03-17 06:20:34,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 168 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 06:20:34,456 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 134 flow [2025-03-17 06:20:34,456 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-17 06:20:34,457 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2025-03-17 06:20:34,457 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 134 flow [2025-03-17 06:20:34,457 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-17 06:20:34,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:34,458 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:20:34,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:20:34,658 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-17 06:20:34,659 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-17 06:20:34,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:34,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1085683258, now seen corresponding path program 2 times [2025-03-17 06:20:34,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:34,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545701428] [2025-03-17 06:20:34,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:20:34,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:34,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 06:20:34,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-03-17 06:20:34,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:20:34,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:34,733 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-17 06:20:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:34,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545701428] [2025-03-17 06:20:34,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545701428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:20:34,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:20:34,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:20:34,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200982389] [2025-03-17 06:20:34,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:20:34,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:20:34,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:34,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:20:34,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:20:34,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-17 06:20:34,742 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-17 06:20:34,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:34,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-17 06:20:34,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:34,901 INFO L124 PetriNetUnfolderBase]: 764/1596 cut-off events. [2025-03-17 06:20:34,901 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 06:20:34,906 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-17 06:20:34,913 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 46 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-03-17 06:20:34,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 271 flow [2025-03-17 06:20:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:20:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:20:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-17 06:20:34,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2025-03-17 06:20:34,914 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 134 flow. Second operand 3 states and 87 transitions. [2025-03-17 06:20:34,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 271 flow [2025-03-17 06:20:34,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 257 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 06:20:34,916 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 134 flow [2025-03-17 06:20:34,916 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-17 06:20:34,917 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2025-03-17 06:20:34,917 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 134 flow [2025-03-17 06:20:34,917 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-17 06:20:34,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:34,917 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 06:20:34,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:20:34,917 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-17 06:20:34,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:34,918 INFO L85 PathProgramCache]: Analyzing trace with hash -209004737, now seen corresponding path program 1 times [2025-03-17 06:20:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:34,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471457751] [2025-03-17 06:20:34,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:34,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 06:20:34,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 06:20:34,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:34,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:34,999 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-17 06:20:34,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:34,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471457751] [2025-03-17 06:20:34,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471457751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:20:34,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201259347] [2025-03-17 06:20:34,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:34,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:20:34,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:20:35,002 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-17 06:20:35,004 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-17 06:20:35,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 06:20:35,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 06:20:35,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:35,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:35,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:20:35,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:20:35,095 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-17 06:20:35,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:20:35,133 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-17 06:20:35,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201259347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:20:35,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:20:35,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-17 06:20:35,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949345827] [2025-03-17 06:20:35,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:20:35,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:20:35,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:35,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:20:35,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:20:35,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-17 06:20:35,135 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-17 06:20:35,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:35,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-17 06:20:35,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:35,277 INFO L124 PetriNetUnfolderBase]: 776/1626 cut-off events. [2025-03-17 06:20:35,277 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2025-03-17 06:20:35,280 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-17 06:20:35,285 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 26 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2025-03-17 06:20:35,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 212 flow [2025-03-17 06:20:35,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:20:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:20:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2025-03-17 06:20:35,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44476744186046513 [2025-03-17 06:20:35,287 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 134 flow. Second operand 8 states and 153 transitions. [2025-03-17 06:20:35,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 212 flow [2025-03-17 06:20:35,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:20:35,289 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 166 flow [2025-03-17 06:20:35,289 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-17 06:20:35,289 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2025-03-17 06:20:35,290 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 166 flow [2025-03-17 06:20:35,290 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-17 06:20:35,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:35,290 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 06:20:35,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 06:20:35,490 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-17 06:20:35,491 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-17 06:20:35,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:35,491 INFO L85 PathProgramCache]: Analyzing trace with hash -142308737, now seen corresponding path program 2 times [2025-03-17 06:20:35,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:35,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074517058] [2025-03-17 06:20:35,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:20:35,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:35,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 06:20:35,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 06:20:35,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:20:35,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:20:35,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:20:35,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 06:20:35,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 06:20:35,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:35,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:20:35,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:20:35,526 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:20:35,526 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-17 06:20:35,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-17 06:20:35,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-17 06:20:35,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-17 06:20:35,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:20:35,528 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2025-03-17 06:20:35,528 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 06:20:35,528 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 06:20:35,550 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:20:35,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 140 flow [2025-03-17 06:20:35,572 INFO L124 PetriNetUnfolderBase]: 10/69 cut-off events. [2025-03-17 06:20:35,573 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 06:20:35,574 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-17 06:20:35,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 140 flow [2025-03-17 06:20:35,575 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 140 flow [2025-03-17 06:20:35,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:20:35,576 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;@6ebc113b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:20:35,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-17 06:20:35,579 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:20:35,581 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-03-17 06:20:35,581 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 06:20:35,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:35,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:20:35,582 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-17 06:20:35,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:35,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1155961175, now seen corresponding path program 1 times [2025-03-17 06:20:35,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:35,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392552656] [2025-03-17 06:20:35,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:35,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:35,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 06:20:35,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 06:20:35,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:35,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:35,606 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-17 06:20:35,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:35,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392552656] [2025-03-17 06:20:35,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392552656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:20:35,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:20:35,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:20:35,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549350737] [2025-03-17 06:20:35,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:20:35,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:20:35,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:35,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:20:35,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:20:35,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-17 06:20:35,608 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-17 06:20:35,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:35,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-17 06:20:35,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:36,352 INFO L124 PetriNetUnfolderBase]: 6485/10724 cut-off events. [2025-03-17 06:20:36,353 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-03-17 06:20:36,367 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-17 06:20:36,410 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 34 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-03-17 06:20:36,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 206 flow [2025-03-17 06:20:36,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:20:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:20:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-17 06:20:36,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5846994535519126 [2025-03-17 06:20:36,411 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 140 flow. Second operand 3 states and 107 transitions. [2025-03-17 06:20:36,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 206 flow [2025-03-17 06:20:36,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 204 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 06:20:36,413 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 142 flow [2025-03-17 06:20:36,413 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-17 06:20:36,413 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-03-17 06:20:36,413 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 142 flow [2025-03-17 06:20:36,414 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-17 06:20:36,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:36,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:20:36,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:20:36,414 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-17 06:20:36,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash 708677038, now seen corresponding path program 1 times [2025-03-17 06:20:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:36,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683317562] [2025-03-17 06:20:36,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:36,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:36,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:20:36,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:20:36,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:36,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:36,440 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-17 06:20:36,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:36,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683317562] [2025-03-17 06:20:36,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683317562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:20:36,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635233557] [2025-03-17 06:20:36,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:36,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:20:36,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:20:36,443 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-17 06:20:36,444 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-17 06:20:36,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:20:36,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:20:36,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:36,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:36,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:20:36,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:20:36,512 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-17 06:20:36,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:20:36,525 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-17 06:20:36,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635233557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:20:36,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:20:36,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 06:20:36,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24258756] [2025-03-17 06:20:36,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:20:36,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:20:36,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:36,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:20:36,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:20:36,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-17 06:20:36,527 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-17 06:20:36,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:36,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-17 06:20:36,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:37,292 INFO L124 PetriNetUnfolderBase]: 6485/10727 cut-off events. [2025-03-17 06:20:37,293 INFO L125 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2025-03-17 06:20:37,315 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-17 06:20:37,354 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 34 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2025-03-17 06:20:37,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 232 flow [2025-03-17 06:20:37,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:20:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:20:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2025-03-17 06:20:37,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47540983606557374 [2025-03-17 06:20:37,357 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 142 flow. Second operand 6 states and 174 transitions. [2025-03-17 06:20:37,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 232 flow [2025-03-17 06:20:37,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 228 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 06:20:37,358 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 174 flow [2025-03-17 06:20:37,358 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-17 06:20:37,359 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-03-17 06:20:37,359 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 174 flow [2025-03-17 06:20:37,359 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-17 06:20:37,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:37,359 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:20:37,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 06:20:37,565 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-17 06:20:37,565 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-17 06:20:37,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:37,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1626238743, now seen corresponding path program 2 times [2025-03-17 06:20:37,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:37,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863614365] [2025-03-17 06:20:37,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:20:37,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:37,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 06:20:37,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-03-17 06:20:37,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:20:37,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:37,595 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-17 06:20:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863614365] [2025-03-17 06:20:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863614365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:20:37,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:20:37,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:20:37,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047887956] [2025-03-17 06:20:37,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:20:37,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:20:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:37,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:20:37,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:20:37,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-03-17 06:20:37,603 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-17 06:20:37,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:37,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-03-17 06:20:37,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:38,619 INFO L124 PetriNetUnfolderBase]: 10967/18271 cut-off events. [2025-03-17 06:20:38,619 INFO L125 PetriNetUnfolderBase]: For 528/528 co-relation queries the response was YES. [2025-03-17 06:20:38,658 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-17 06:20:38,724 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 66 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-03-17 06:20:38,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 376 flow [2025-03-17 06:20:38,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:20:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:20:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-03-17 06:20:38,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6994535519125683 [2025-03-17 06:20:38,725 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 174 flow. Second operand 3 states and 128 transitions. [2025-03-17 06:20:38,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 376 flow [2025-03-17 06:20:38,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 362 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 06:20:38,729 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 174 flow [2025-03-17 06:20:38,729 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-17 06:20:38,730 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2025-03-17 06:20:38,730 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 174 flow [2025-03-17 06:20:38,730 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-17 06:20:38,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:38,730 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:20:38,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:20:38,731 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-17 06:20:38,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:38,731 INFO L85 PathProgramCache]: Analyzing trace with hash 366165105, now seen corresponding path program 1 times [2025-03-17 06:20:38,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:38,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535387843] [2025-03-17 06:20:38,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:38,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:38,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 06:20:38,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 06:20:38,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:38,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:38,787 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-17 06:20:38,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:38,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535387843] [2025-03-17 06:20:38,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535387843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:20:38,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:20:38,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:20:38,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723639110] [2025-03-17 06:20:38,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:20:38,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:20:38,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:38,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:20:38,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:20:38,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-03-17 06:20:38,794 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-17 06:20:38,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:38,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-03-17 06:20:38,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:40,482 INFO L124 PetriNetUnfolderBase]: 18668/31005 cut-off events. [2025-03-17 06:20:40,483 INFO L125 PetriNetUnfolderBase]: For 4419/4419 co-relation queries the response was YES. [2025-03-17 06:20:40,573 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-17 06:20:40,662 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 69 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-03-17 06:20:40,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 391 flow [2025-03-17 06:20:40,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:20:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:20:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-03-17 06:20:40,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6939890710382514 [2025-03-17 06:20:40,664 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 174 flow. Second operand 3 states and 127 transitions. [2025-03-17 06:20:40,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 391 flow [2025-03-17 06:20:40,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:20:40,680 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 184 flow [2025-03-17 06:20:40,680 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-17 06:20:40,681 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2025-03-17 06:20:40,681 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 184 flow [2025-03-17 06:20:40,681 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-17 06:20:40,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:40,681 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 06:20:40,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:20:40,681 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-17 06:20:40,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:40,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1349479095, now seen corresponding path program 1 times [2025-03-17 06:20:40,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:40,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675067575] [2025-03-17 06:20:40,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:40,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:40,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 06:20:40,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 06:20:40,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:40,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:40,741 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-17 06:20:40,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:40,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675067575] [2025-03-17 06:20:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675067575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:20:40,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496200865] [2025-03-17 06:20:40,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:40,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:20:40,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:20:40,744 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-17 06:20:40,746 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-17 06:20:40,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 06:20:40,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 06:20:40,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:40,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:40,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:20:40,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:20:40,828 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-17 06:20:40,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:20:40,860 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-17 06:20:40,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496200865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:20:40,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:20:40,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-17 06:20:40,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684936755] [2025-03-17 06:20:40,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:20:40,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:20:40,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:40,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:20:40,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:20:40,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-17 06:20:40,862 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-17 06:20:40,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:40,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-17 06:20:40,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:42,779 INFO L124 PetriNetUnfolderBase]: 18836/31249 cut-off events. [2025-03-17 06:20:42,779 INFO L125 PetriNetUnfolderBase]: For 5514/5514 co-relation queries the response was YES. [2025-03-17 06:20:42,952 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-17 06:20:43,083 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 38 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2025-03-17 06:20:43,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 65 transitions, 286 flow [2025-03-17 06:20:43,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:20:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:20:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2025-03-17 06:20:43,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4487704918032787 [2025-03-17 06:20:43,085 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 184 flow. Second operand 8 states and 219 transitions. [2025-03-17 06:20:43,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 65 transitions, 286 flow [2025-03-17 06:20:43,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 65 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:20:43,113 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 216 flow [2025-03-17 06:20:43,114 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-17 06:20:43,114 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 21 predicate places. [2025-03-17 06:20:43,115 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 216 flow [2025-03-17 06:20:43,115 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-17 06:20:43,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:43,116 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 06:20:43,122 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-17 06:20:43,320 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-17 06:20:43,320 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-17 06:20:43,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash 651118185, now seen corresponding path program 2 times [2025-03-17 06:20:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:43,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087772142] [2025-03-17 06:20:43,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:20:43,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:43,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-17 06:20:43,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 06:20:43,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:20:43,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:20:43,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:20:43,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 06:20:43,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 06:20:43,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:43,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:20:43,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:20:43,368 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:20:43,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-17 06:20:43,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-17 06:20:43,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-17 06:20:43,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-17 06:20:43,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-17 06:20:43,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:20:43,369 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-03-17 06:20:43,370 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 06:20:43,370 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 06:20:43,403 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:20:43,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 79 transitions, 186 flow [2025-03-17 06:20:43,412 INFO L124 PetriNetUnfolderBase]: 13/90 cut-off events. [2025-03-17 06:20:43,413 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 06:20:43,413 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-17 06:20:43,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 79 transitions, 186 flow [2025-03-17 06:20:43,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 79 transitions, 186 flow [2025-03-17 06:20:43,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:20:43,416 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;@6ebc113b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:20:43,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 06:20:43,417 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:20:43,418 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-03-17 06:20:43,418 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 06:20:43,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:43,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:20:43,418 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-17 06:20:43,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:43,419 INFO L85 PathProgramCache]: Analyzing trace with hash 850687144, now seen corresponding path program 1 times [2025-03-17 06:20:43,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:43,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700621824] [2025-03-17 06:20:43,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:43,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:43,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 06:20:43,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 06:20:43,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:43,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:43,442 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-17 06:20:43,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:43,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700621824] [2025-03-17 06:20:43,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700621824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:20:43,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:20:43,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:20:43,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137603003] [2025-03-17 06:20:43,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:20:43,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:20:43,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:43,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:20:43,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:20:43,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2025-03-17 06:20:43,444 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-17 06:20:43,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:43,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2025-03-17 06:20:43,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:49,761 INFO L124 PetriNetUnfolderBase]: 80345/117739 cut-off events. [2025-03-17 06:20:49,761 INFO L125 PetriNetUnfolderBase]: For 9197/9197 co-relation queries the response was YES. [2025-03-17 06:20:49,985 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-17 06:20:50,388 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 44 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-03-17 06:20:50,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 75 transitions, 270 flow [2025-03-17 06:20:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:20:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:20:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-03-17 06:20:50,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5864978902953587 [2025-03-17 06:20:50,389 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 186 flow. Second operand 3 states and 139 transitions. [2025-03-17 06:20:50,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 75 transitions, 270 flow [2025-03-17 06:20:50,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 264 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-17 06:20:50,393 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 182 flow [2025-03-17 06:20:50,393 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-17 06:20:50,394 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-03-17 06:20:50,394 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 182 flow [2025-03-17 06:20:50,394 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-17 06:20:50,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:50,394 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:20:50,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 06:20:50,394 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-17 06:20:50,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:50,394 INFO L85 PathProgramCache]: Analyzing trace with hash -651578802, now seen corresponding path program 1 times [2025-03-17 06:20:50,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:50,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352759690] [2025-03-17 06:20:50,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:50,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:20:50,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:20:50,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:50,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:50,422 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-17 06:20:50,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:50,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352759690] [2025-03-17 06:20:50,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352759690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:20:50,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247368077] [2025-03-17 06:20:50,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:20:50,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:20:50,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:20:50,426 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-17 06:20:50,428 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-17 06:20:50,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:20:50,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:20:50,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:20:50,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:50,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:20:50,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:20:50,497 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-17 06:20:50,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:20:50,509 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-17 06:20:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247368077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:20:50,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:20:50,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 06:20:50,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170087145] [2025-03-17 06:20:50,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:20:50,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:20:50,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:50,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:20:50,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:20:50,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2025-03-17 06:20:50,511 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-17 06:20:50,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:50,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2025-03-17 06:20:50,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:20:57,438 INFO L124 PetriNetUnfolderBase]: 80345/117742 cut-off events. [2025-03-17 06:20:57,438 INFO L125 PetriNetUnfolderBase]: For 3919/3919 co-relation queries the response was YES. [2025-03-17 06:20:57,864 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-17 06:20:58,342 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 44 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2025-03-17 06:20:58,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 78 transitions, 292 flow [2025-03-17 06:20:58,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:20:58,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:20:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2025-03-17 06:20:58,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4767932489451477 [2025-03-17 06:20:58,344 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 182 flow. Second operand 6 states and 226 transitions. [2025-03-17 06:20:58,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 78 transitions, 292 flow [2025-03-17 06:20:58,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 78 transitions, 288 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 06:20:58,356 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 214 flow [2025-03-17 06:20:58,356 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-17 06:20:58,356 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-03-17 06:20:58,356 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 214 flow [2025-03-17 06:20:58,357 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-17 06:20:58,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:20:58,357 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:20:58,565 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-17 06:20:58,565 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-17 06:20:58,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:20:58,566 INFO L85 PathProgramCache]: Analyzing trace with hash -991318488, now seen corresponding path program 2 times [2025-03-17 06:20:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:20:58,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445899137] [2025-03-17 06:20:58,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:20:58,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:20:58,573 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-17 06:20:58,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 06:20:58,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-03-17 06:20:58,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:20:58,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:20:58,621 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-17 06:20:58,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:20:58,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445899137] [2025-03-17 06:20:58,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445899137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:20:58,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:20:58,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:20:58,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634328048] [2025-03-17 06:20:58,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:20:58,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:20:58,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:20:58,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:20:58,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:20:58,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2025-03-17 06:20:58,629 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-17 06:20:58,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:20:58,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2025-03-17 06:20:58,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand