./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/09_fmaxsym.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 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:02:30,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:02:30,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:02:30,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:02:30,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:02:30,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:02:30,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:02:30,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:02:30,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:02:30,131 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:02:30,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:02:30,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:02:30,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:02:30,132 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:02:30,133 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:02:30,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:02:30,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:02:30,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:02:30,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:02:30,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:02:30,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:02:30,133 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:02:30,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:02:30,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:02:30,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:02:30,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:02:30,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:02:30,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:02:30,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:02:30,133 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 -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-03-04 02:02:30,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:02:30,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:02:30,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:02:30,383 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:02:30,383 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:02:30,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-04 02:02:31,471 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7bef991b/291e6d9a31b24ba19bc63653b506357e/FLAG0fd639461 [2025-03-04 02:02:31,737 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:02:31,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-04 02:02:31,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7bef991b/291e6d9a31b24ba19bc63653b506357e/FLAG0fd639461 [2025-03-04 02:02:32,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7bef991b/291e6d9a31b24ba19bc63653b506357e [2025-03-04 02:02:32,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:02:32,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:02:32,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:02:32,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:02:32,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:02:32,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5577a651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32, skipping insertion in model container [2025-03-04 02:02:32,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:02:32,308 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/09_fmaxsym.i[30746,30759] [2025-03-04 02:02:32,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:02:32,330 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:02:32,355 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/09_fmaxsym.i[30746,30759] [2025-03-04 02:02:32,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:02:32,381 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:02:32,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32 WrapperNode [2025-03-04 02:02:32,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:02:32,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:02:32,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:02:32,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:02:32,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,410 INFO L138 Inliner]: procedures = 164, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2025-03-04 02:02:32,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:02:32,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:02:32,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:02:32,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:02:32,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,426 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-04 02:02:32,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,430 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:02:32,433 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:02:32,433 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:02:32,433 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:02:32,434 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32" (1/1) ... [2025-03-04 02:02:32,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:02:32,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:32,455 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-04 02:02:32,459 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-04 02:02:32,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:02:32,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:02:32,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:02:32,471 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 02:02:32,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 02:02:32,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:02:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:02:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:02:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 02:02:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:02:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:02:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:02:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:02:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 02:02:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:02:32,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:02:32,473 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:02:32,560 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:02:32,562 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:02:32,701 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:02:32,701 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:02:32,809 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:02:32,810 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:02:32,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:02:32 BoogieIcfgContainer [2025-03-04 02:02:32,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:02:32,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:02:32,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:02:32,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:02:32,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:02:32" (1/3) ... [2025-03-04 02:02:32,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac6da71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:02:32, skipping insertion in model container [2025-03-04 02:02:32,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:32" (2/3) ... [2025-03-04 02:02:32,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac6da71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:02:32, skipping insertion in model container [2025-03-04 02:02:32,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:02:32" (3/3) ... [2025-03-04 02:02:32,817 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-03-04 02:02:32,827 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:02:32,829 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 20 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:02:32,829 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:02:32,866 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:32,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 23 transitions, 50 flow [2025-03-04 02:02:32,912 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-03-04 02:02:32,914 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:02:32,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 25 events. 3/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 22 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-03-04 02:02:32,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 23 transitions, 50 flow [2025-03-04 02:02:32,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 23 transitions, 50 flow [2025-03-04 02:02:32,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:32,948 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;@1756a974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:32,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:02:32,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:32,955 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-03-04 02:02:32,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:02:32,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:32,956 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 02:02:32,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:02:32,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:32,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1413728522, now seen corresponding path program 1 times [2025-03-04 02:02:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:32,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167429137] [2025-03-04 02:02:32,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:32,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:33,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 02:02:33,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 02:02:33,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:33,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:33,159 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-04 02:02:33,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:33,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167429137] [2025-03-04 02:02:33,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167429137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:33,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:33,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:02:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817454441] [2025-03-04 02:02:33,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:33,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:33,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:33,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:33,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:33,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-04 02:02:33,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-04 02:02:33,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:33,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-04 02:02:33,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:33,236 INFO L124 PetriNetUnfolderBase]: 20/68 cut-off events. [2025-03-04 02:02:33,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:02:33,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 68 events. 20/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 16 based on Foata normal form. 3/64 useless extension candidates. Maximal degree in co-relation 105. Up to 51 conditions per place. [2025-03-04 02:02:33,238 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 14 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2025-03-04 02:02:33,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 80 flow [2025-03-04 02:02:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:02:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:02:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-03-04 02:02:33,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2025-03-04 02:02:33,246 INFO L175 Difference]: Start difference. First operand has 23 places, 23 transitions, 50 flow. Second operand 3 states and 37 transitions. [2025-03-04 02:02:33,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 80 flow [2025-03-04 02:02:33,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 22 transitions, 80 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:33,251 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 58 flow [2025-03-04 02:02:33,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=25, PETRI_TRANSITIONS=22} [2025-03-04 02:02:33,254 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-03-04 02:02:33,254 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 58 flow [2025-03-04 02:02:33,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-04 02:02:33,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:33,255 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:33,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:02:33,255 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:02:33,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:33,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2096037558, now seen corresponding path program 1 times [2025-03-04 02:02:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:33,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738429253] [2025-03-04 02:02:33,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:33,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:33,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:02:33,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:02:33,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:33,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:33,327 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-04 02:02:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738429253] [2025-03-04 02:02:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738429253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:02:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480581576] [2025-03-04 02:02:33,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:33,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:33,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:33,330 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-04 02:02:33,331 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-04 02:02:33,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:02:33,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:02:33,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:33,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:33,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:02:33,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:02:33,418 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-04 02:02:33,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:02:33,435 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-04 02:02:33,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480581576] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:02:33,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:02:33,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 02:02:33,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560310708] [2025-03-04 02:02:33,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:02:33,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:02:33,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:33,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:02:33,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:02:33,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-04 02:02:33,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 58 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-04 02:02:33,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:33,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-04 02:02:33,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:33,488 INFO L124 PetriNetUnfolderBase]: 20/71 cut-off events. [2025-03-04 02:02:33,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:02:33,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 71 events. 20/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 16 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 128. Up to 51 conditions per place. [2025-03-04 02:02:33,488 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 14 selfloop transitions, 5 changer transitions 0/25 dead transitions. [2025-03-04 02:02:33,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 108 flow [2025-03-04 02:02:33,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:02:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:02:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-03-04 02:02:33,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42028985507246375 [2025-03-04 02:02:33,490 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 58 flow. Second operand 6 states and 58 transitions. [2025-03-04 02:02:33,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 108 flow [2025-03-04 02:02:33,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 104 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:02:33,491 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 90 flow [2025-03-04 02:02:33,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2025-03-04 02:02:33,492 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 9 predicate places. [2025-03-04 02:02:33,492 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 90 flow [2025-03-04 02:02:33,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-04 02:02:33,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:33,492 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-03-04 02:02:33,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:02:33,696 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-04 02:02:33,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:02:33,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:33,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1069951990, now seen corresponding path program 2 times [2025-03-04 02:02:33,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:33,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222064365] [2025-03-04 02:02:33,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:02:33,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:33,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 02:02:33,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:02:33,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:02:33,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:33,832 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-04 02:02:33,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:33,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222064365] [2025-03-04 02:02:33,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222064365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:02:33,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364472255] [2025-03-04 02:02:33,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:02:33,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:33,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:33,836 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-04 02:02:33,838 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-04 02:02:33,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 02:02:33,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:02:33,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:02:33,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:33,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:02:33,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:02:33,909 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-04 02:02:33,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:02:33,945 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-04 02:02:33,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364472255] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:02:33,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:02:33,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-04 02:02:33,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200864370] [2025-03-04 02:02:33,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:02:33,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:02:33,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:33,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:02:33,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:02:33,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-04 02:02:33,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 90 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-04 02:02:33,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:33,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-04 02:02:33,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:34,012 INFO L124 PetriNetUnfolderBase]: 20/73 cut-off events. [2025-03-04 02:02:34,012 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 02:02:34,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 73 events. 20/73 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 16 based on Foata normal form. 2/69 useless extension candidates. Maximal degree in co-relation 119. Up to 51 conditions per place. [2025-03-04 02:02:34,013 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 14 selfloop transitions, 7 changer transitions 0/27 dead transitions. [2025-03-04 02:02:34,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 144 flow [2025-03-04 02:02:34,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:02:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:02:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2025-03-04 02:02:34,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3858695652173913 [2025-03-04 02:02:34,015 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 90 flow. Second operand 8 states and 71 transitions. [2025-03-04 02:02:34,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 144 flow [2025-03-04 02:02:34,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 130 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 02:02:34,017 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 112 flow [2025-03-04 02:02:34,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=112, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2025-03-04 02:02:34,017 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 17 predicate places. [2025-03-04 02:02:34,017 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 112 flow [2025-03-04 02:02:34,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-04 02:02:34,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:34,017 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2025-03-04 02:02:34,025 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-04 02:02:34,225 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-04 02:02:34,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:02:34,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1337341558, now seen corresponding path program 3 times [2025-03-04 02:02:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:34,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816377043] [2025-03-04 02:02:34,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:02:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:34,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-03-04 02:02:34,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:02:34,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 02:02:34,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:34,257 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:02:34,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:02:34,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:02:34,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:34,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:34,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:02:34,297 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:02:34,298 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-04 02:02:34,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-04 02:02:34,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-04 02:02:34,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:02:34,300 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-04 02:02:34,302 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:02:34,302 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 02:02:34,338 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:34,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 39 transitions, 88 flow [2025-03-04 02:02:34,349 INFO L124 PetriNetUnfolderBase]: 5/44 cut-off events. [2025-03-04 02:02:34,350 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:02:34,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 44 events. 5/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2025-03-04 02:02:34,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 39 transitions, 88 flow [2025-03-04 02:02:34,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 39 transitions, 88 flow [2025-03-04 02:02:34,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:34,354 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;@1756a974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:34,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:02:34,360 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:34,360 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-03-04 02:02:34,360 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:02:34,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:34,360 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-03-04 02:02:34,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 02:02:34,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:34,361 INFO L85 PathProgramCache]: Analyzing trace with hash 302701224, now seen corresponding path program 1 times [2025-03-04 02:02:34,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:34,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568270945] [2025-03-04 02:02:34,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:34,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:02:34,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:02:34,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:34,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:34,393 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-04 02:02:34,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:34,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568270945] [2025-03-04 02:02:34,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568270945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:34,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:34,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:02:34,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940380976] [2025-03-04 02:02:34,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:34,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:34,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:34,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:34,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:34,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-03-04 02:02:34,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-04 02:02:34,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:34,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-03-04 02:02:34,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:34,540 INFO L124 PetriNetUnfolderBase]: 434/922 cut-off events. [2025-03-04 02:02:34,541 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 02:02:34,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 922 events. 434/922 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4760 event pairs, 376 based on Foata normal form. 51/864 useless extension candidates. Maximal degree in co-relation 1014. Up to 708 conditions per place. [2025-03-04 02:02:34,546 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 24 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-04 02:02:34,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 136 flow [2025-03-04 02:02:34,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:02:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:02:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-03-04 02:02:34,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-03-04 02:02:34,547 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 88 flow. Second operand 3 states and 63 transitions. [2025-03-04 02:02:34,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 136 flow [2025-03-04 02:02:34,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:34,548 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 94 flow [2025-03-04 02:02:34,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-03-04 02:02:34,549 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2025-03-04 02:02:34,549 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 94 flow [2025-03-04 02:02:34,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-04 02:02:34,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:34,549 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:34,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:02:34,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 02:02:34,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:34,549 INFO L85 PathProgramCache]: Analyzing trace with hash 352795451, now seen corresponding path program 1 times [2025-03-04 02:02:34,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:34,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410626756] [2025-03-04 02:02:34,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:34,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:34,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:02:34,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:02:34,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:34,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:34,580 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-04 02:02:34,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:34,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410626756] [2025-03-04 02:02:34,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410626756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:02:34,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730145931] [2025-03-04 02:02:34,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:34,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:34,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:34,583 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-04 02:02:34,584 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-04 02:02:34,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:02:34,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:02:34,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:34,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:34,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:02:34,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:02:34,652 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-04 02:02:34,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:02:34,664 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-04 02:02:34,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730145931] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:02:34,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:02:34,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 02:02:34,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948774783] [2025-03-04 02:02:34,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:02:34,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:02:34,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:34,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:02:34,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:02:34,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-03-04 02:02:34,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-04 02:02:34,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:34,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-03-04 02:02:34,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:34,803 INFO L124 PetriNetUnfolderBase]: 434/925 cut-off events. [2025-03-04 02:02:34,803 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 02:02:34,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 925 events. 434/925 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4756 event pairs, 376 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 1666. Up to 708 conditions per place. [2025-03-04 02:02:34,813 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 24 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2025-03-04 02:02:34,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 164 flow [2025-03-04 02:02:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:02:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:02:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-04 02:02:34,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4188034188034188 [2025-03-04 02:02:34,814 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 94 flow. Second operand 6 states and 98 transitions. [2025-03-04 02:02:34,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 164 flow [2025-03-04 02:02:34,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 160 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:02:34,816 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 126 flow [2025-03-04 02:02:34,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-03-04 02:02:34,816 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2025-03-04 02:02:34,816 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 126 flow [2025-03-04 02:02:34,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-04 02:02:34,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:34,817 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 02:02:34,824 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-04 02:02:35,017 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-04 02:02:35,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 02:02:35,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash 510125928, now seen corresponding path program 2 times [2025-03-04 02:02:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:35,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994120077] [2025-03-04 02:02:35,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:02:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:35,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 02:02:35,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:02:35,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:02:35,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:35,114 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-04 02:02:35,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:35,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994120077] [2025-03-04 02:02:35,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994120077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:02:35,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843605531] [2025-03-04 02:02:35,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:02:35,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:35,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:35,117 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-04 02:02:35,121 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-04 02:02:35,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 02:02:35,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:02:35,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:02:35,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:35,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:02:35,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:02:35,199 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-04 02:02:35,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:02:35,234 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-04 02:02:35,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843605531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:02:35,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:02:35,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-04 02:02:35,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112638081] [2025-03-04 02:02:35,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:02:35,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:02:35,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:35,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:02:35,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:02:35,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-03-04 02:02:35,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 126 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-04 02:02:35,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:35,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-03-04 02:02:35,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:35,370 INFO L124 PetriNetUnfolderBase]: 434/927 cut-off events. [2025-03-04 02:02:35,370 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 02:02:35,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1700 conditions, 927 events. 434/927 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4764 event pairs, 376 based on Foata normal form. 2/821 useless extension candidates. Maximal degree in co-relation 1657. Up to 708 conditions per place. [2025-03-04 02:02:35,375 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 24 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2025-03-04 02:02:35,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 42 transitions, 200 flow [2025-03-04 02:02:35,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:02:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:02:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2025-03-04 02:02:35,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38782051282051283 [2025-03-04 02:02:35,376 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 126 flow. Second operand 8 states and 121 transitions. [2025-03-04 02:02:35,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 42 transitions, 200 flow [2025-03-04 02:02:35,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 42 transitions, 186 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 02:02:35,378 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 148 flow [2025-03-04 02:02:35,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=148, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-03-04 02:02:35,379 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2025-03-04 02:02:35,379 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 148 flow [2025-03-04 02:02:35,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-04 02:02:35,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:35,379 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 02:02:35,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:02:35,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:35,580 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-04 02:02:35,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:35,580 INFO L85 PathProgramCache]: Analyzing trace with hash -622605880, now seen corresponding path program 3 times [2025-03-04 02:02:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:35,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254262432] [2025-03-04 02:02:35,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:02:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:35,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 4 equivalence classes. [2025-03-04 02:02:35,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:02:35,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 02:02:35,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:35,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:02:35,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:02:35,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:02:35,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:35,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:35,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:02:35,624 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:02:35,624 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-04 02:02:35,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-04 02:02:35,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-04 02:02:35,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-04 02:02:35,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:02:35,625 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-04 02:02:35,625 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:02:35,625 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 02:02:35,652 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:35,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 128 flow [2025-03-04 02:02:35,659 INFO L124 PetriNetUnfolderBase]: 7/63 cut-off events. [2025-03-04 02:02:35,660 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 02:02:35,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 7/63 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 136 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2025-03-04 02:02:35,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 55 transitions, 128 flow [2025-03-04 02:02:35,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 55 transitions, 128 flow [2025-03-04 02:02:35,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:35,661 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;@1756a974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:35,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 02:02:35,665 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:35,665 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2025-03-04 02:02:35,665 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 02:02:35,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:35,665 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:35,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:02:35,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:35,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1337150675, now seen corresponding path program 1 times [2025-03-04 02:02:35,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:35,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87375484] [2025-03-04 02:02:35,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:35,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:35,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:02:35,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:02:35,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:35,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:35,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-04 02:02:35,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87375484] [2025-03-04 02:02:35,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87375484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:35,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:35,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:02:35,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589698402] [2025-03-04 02:02:35,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:35,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:35,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:35,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:35,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:35,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 02:02:35,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-04 02:02:35,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:35,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 02:02:35,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:36,323 INFO L124 PetriNetUnfolderBase]: 6347/10809 cut-off events. [2025-03-04 02:02:36,323 INFO L125 PetriNetUnfolderBase]: For 607/607 co-relation queries the response was YES. [2025-03-04 02:02:36,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19975 conditions, 10809 events. 6347/10809 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 74720 event pairs, 5560 based on Foata normal form. 713/10235 useless extension candidates. Maximal degree in co-relation 1663. Up to 8808 conditions per place. [2025-03-04 02:02:36,372 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 34 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-03-04 02:02:36,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 194 flow [2025-03-04 02:02:36,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:02:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:02:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-04 02:02:36,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2025-03-04 02:02:36,373 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 128 flow. Second operand 3 states and 89 transitions. [2025-03-04 02:02:36,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 194 flow [2025-03-04 02:02:36,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:36,375 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 130 flow [2025-03-04 02:02:36,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2025-03-04 02:02:36,375 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2025-03-04 02:02:36,375 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 130 flow [2025-03-04 02:02:36,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-04 02:02:36,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:36,375 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:36,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:02:36,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:02:36,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1304694921, now seen corresponding path program 1 times [2025-03-04 02:02:36,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:36,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184388697] [2025-03-04 02:02:36,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:36,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:36,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:02:36,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:02:36,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:36,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:36,402 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-04 02:02:36,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:36,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184388697] [2025-03-04 02:02:36,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184388697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:02:36,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865260182] [2025-03-04 02:02:36,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:36,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:36,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:36,404 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-04 02:02:36,406 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-04 02:02:36,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:02:36,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:02:36,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:36,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:36,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:02:36,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:02:36,468 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-04 02:02:36,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:02:36,483 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-04 02:02:36,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865260182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:02:36,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:02:36,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 02:02:36,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253011688] [2025-03-04 02:02:36,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:02:36,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:02:36,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:36,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:02:36,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:02:36,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 02:02:36,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 130 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-04 02:02:36,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:36,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 02:02:36,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:37,154 INFO L124 PetriNetUnfolderBase]: 6347/10812 cut-off events. [2025-03-04 02:02:37,154 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2025-03-04 02:02:37,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19910 conditions, 10812 events. 6347/10812 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 74703 event pairs, 5560 based on Foata normal form. 0/9525 useless extension candidates. Maximal degree in co-relation 19896. Up to 8808 conditions per place. [2025-03-04 02:02:37,209 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 34 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-03-04 02:02:37,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 55 transitions, 220 flow [2025-03-04 02:02:37,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:02:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:02:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-03-04 02:02:37,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2025-03-04 02:02:37,211 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 130 flow. Second operand 6 states and 138 transitions. [2025-03-04 02:02:37,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 55 transitions, 220 flow [2025-03-04 02:02:37,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 216 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:02:37,215 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 162 flow [2025-03-04 02:02:37,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-03-04 02:02:37,215 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2025-03-04 02:02:37,215 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 162 flow [2025-03-04 02:02:37,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-04 02:02:37,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:37,215 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:37,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 02:02:37,416 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,SelfDestructingSolverStorable9 [2025-03-04 02:02:37,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:02:37,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1348367789, now seen corresponding path program 2 times [2025-03-04 02:02:37,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:37,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747184956] [2025-03-04 02:02:37,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:02:37,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:37,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:02:37,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:02:37,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:02:37,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:37,493 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-04 02:02:37,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:37,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747184956] [2025-03-04 02:02:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747184956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:02:37,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392423032] [2025-03-04 02:02:37,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:02:37,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:37,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:37,496 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-04 02:02:37,497 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-04 02:02:37,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:02:37,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:02:37,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:02:37,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:37,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:02:37,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:02:37,583 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-04 02:02:37,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:02:37,620 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-04 02:02:37,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392423032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:02:37,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:02:37,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-04 02:02:37,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597438644] [2025-03-04 02:02:37,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:02:37,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:02:37,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:37,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:02:37,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:02:37,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-04 02:02:37,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 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-04 02:02:37,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:37,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-04 02:02:37,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:38,212 INFO L124 PetriNetUnfolderBase]: 6347/10814 cut-off events. [2025-03-04 02:02:38,212 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2025-03-04 02:02:38,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19931 conditions, 10814 events. 6347/10814 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 74715 event pairs, 5560 based on Foata normal form. 2/9530 useless extension candidates. Maximal degree in co-relation 19887. Up to 8808 conditions per place. [2025-03-04 02:02:38,258 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 34 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2025-03-04 02:02:38,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 256 flow [2025-03-04 02:02:38,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:02:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:02:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2025-03-04 02:02:38,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3886363636363636 [2025-03-04 02:02:38,259 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 162 flow. Second operand 8 states and 171 transitions. [2025-03-04 02:02:38,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 256 flow [2025-03-04 02:02:38,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 57 transitions, 242 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 02:02:38,261 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 184 flow [2025-03-04 02:02:38,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=184, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2025-03-04 02:02:38,262 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2025-03-04 02:02:38,262 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 184 flow [2025-03-04 02:02:38,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 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-04 02:02:38,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:38,262 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:38,270 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-04 02:02:38,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:38,463 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:02:38,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:38,463 INFO L85 PathProgramCache]: Analyzing trace with hash 790667539, now seen corresponding path program 3 times [2025-03-04 02:02:38,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:38,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490288523] [2025-03-04 02:02:38,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:02:38,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:38,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 4 equivalence classes. [2025-03-04 02:02:38,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:02:38,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 02:02:38,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:38,484 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:02:38,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:02:38,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:02:38,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:38,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:38,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:02:38,505 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:02:38,506 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-04 02:02:38,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-04 02:02:38,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-04 02:02:38,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-04 02:02:38,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-04 02:02:38,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:02:38,506 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-04 02:02:38,507 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:02:38,507 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 02:02:38,533 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:38,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 170 flow [2025-03-04 02:02:38,540 INFO L124 PetriNetUnfolderBase]: 9/82 cut-off events. [2025-03-04 02:02:38,541 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 02:02:38,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 82 events. 9/82 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 209 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 73. Up to 5 conditions per place. [2025-03-04 02:02:38,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 71 transitions, 170 flow [2025-03-04 02:02:38,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 71 transitions, 170 flow [2025-03-04 02:02:38,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:38,543 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;@1756a974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:38,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:02:38,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:38,548 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2025-03-04 02:02:38,548 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 02:02:38,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:38,548 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:38,548 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-04 02:02:38,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:38,549 INFO L85 PathProgramCache]: Analyzing trace with hash 550949583, now seen corresponding path program 1 times [2025-03-04 02:02:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:38,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827191348] [2025-03-04 02:02:38,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:38,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:02:38,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:02:38,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:38,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:38,579 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-04 02:02:38,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:38,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827191348] [2025-03-04 02:02:38,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827191348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:38,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:38,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:02:38,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519382222] [2025-03-04 02:02:38,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:38,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:38,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:38,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:38,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:38,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2025-03-04 02:02:38,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 170 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-04 02:02:38,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:38,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2025-03-04 02:02:38,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:44,051 INFO L124 PetriNetUnfolderBase]: 79247/119475 cut-off events. [2025-03-04 02:02:44,051 INFO L125 PetriNetUnfolderBase]: For 9589/9589 co-relation queries the response was YES. [2025-03-04 02:02:44,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224870 conditions, 119475 events. 79247/119475 cut-off events. For 9589/9589 co-relation queries the response was YES. Maximal size of possible extension queue 3771. Compared 958310 event pairs, 69712 based on Foata normal form. 8858/114257 useless extension candidates. Maximal degree in co-relation 20055. Up to 101391 conditions per place. [2025-03-04 02:02:44,764 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 44 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2025-03-04 02:02:44,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 254 flow [2025-03-04 02:02:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:02:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:02:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-03-04 02:02:44,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.539906103286385 [2025-03-04 02:02:44,765 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 170 flow. Second operand 3 states and 115 transitions. [2025-03-04 02:02:44,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 254 flow [2025-03-04 02:02:44,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 248 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:44,770 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 166 flow [2025-03-04 02:02:44,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2025-03-04 02:02:44,771 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2025-03-04 02:02:44,771 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 166 flow [2025-03-04 02:02:44,771 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-04 02:02:44,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:44,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:44,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:02:44,771 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-04 02:02:44,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:44,772 INFO L85 PathProgramCache]: Analyzing trace with hash -793182752, now seen corresponding path program 1 times [2025-03-04 02:02:44,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:44,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697642124] [2025-03-04 02:02:44,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:44,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:44,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:02:44,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:02:44,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:44,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:44,809 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-04 02:02:44,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:44,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697642124] [2025-03-04 02:02:44,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697642124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:02:44,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471114022] [2025-03-04 02:02:44,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:44,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:44,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:44,812 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-04 02:02:44,813 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-04 02:02:44,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:02:44,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:02:44,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:44,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:44,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:02:44,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:02:44,891 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-04 02:02:44,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:02:44,901 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-04 02:02:44,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471114022] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:02:44,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:02:44,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 02:02:44,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929914335] [2025-03-04 02:02:44,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:02:44,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:02:44,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:44,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:02:44,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:02:44,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2025-03-04 02:02:44,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 166 flow. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-04 02:02:44,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:44,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2025-03-04 02:02:44,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:51,108 INFO L124 PetriNetUnfolderBase]: 79247/119478 cut-off events. [2025-03-04 02:02:51,108 INFO L125 PetriNetUnfolderBase]: For 4319/4319 co-relation queries the response was YES. [2025-03-04 02:02:51,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223347 conditions, 119478 events. 79247/119478 cut-off events. For 4319/4319 co-relation queries the response was YES. Maximal size of possible extension queue 3771. Compared 958261 event pairs, 69712 based on Foata normal form. 0/105402 useless extension candidates. Maximal degree in co-relation 223332. Up to 101391 conditions per place. [2025-03-04 02:02:51,733 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 44 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2025-03-04 02:02:51,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 276 flow [2025-03-04 02:02:51,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:02:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:02:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-03-04 02:02:51,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41784037558685444 [2025-03-04 02:02:51,734 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 166 flow. Second operand 6 states and 178 transitions. [2025-03-04 02:02:51,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 276 flow [2025-03-04 02:02:51,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 272 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:02:51,750 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 198 flow [2025-03-04 02:02:51,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2025-03-04 02:02:51,750 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2025-03-04 02:02:51,750 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 198 flow [2025-03-04 02:02:51,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-04 02:02:51,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:51,750 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:51,756 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-04 02:02:51,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:51,951 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-04 02:02:51,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash 496078607, now seen corresponding path program 2 times [2025-03-04 02:02:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:51,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178898561] [2025-03-04 02:02:51,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:02:51,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:51,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:02:51,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 18 statements. [2025-03-04 02:02:51,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:02:51,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:51,991 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-04 02:02:51,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:51,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178898561] [2025-03-04 02:02:51,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178898561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:51,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:51,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:02:51,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042964827] [2025-03-04 02:02:51,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:51,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:51,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:51,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:51,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:52,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2025-03-04 02:02:52,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-04 02:02:52,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:52,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2025-03-04 02:02:52,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:59,485 INFO L124 PetriNetUnfolderBase]: 99317/141309 cut-off events. [2025-03-04 02:02:59,485 INFO L125 PetriNetUnfolderBase]: For 4035/4035 co-relation queries the response was YES. [2025-03-04 02:02:59,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270727 conditions, 141309 events. 99317/141309 cut-off events. For 4035/4035 co-relation queries the response was YES. Maximal size of possible extension queue 3792. Compared 1043054 event pairs, 37636 based on Foata normal form. 0/124816 useless extension candidates. Maximal degree in co-relation 270690. Up to 67590 conditions per place. [2025-03-04 02:03:00,285 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 81 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2025-03-04 02:03:00,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 102 transitions, 445 flow [2025-03-04 02:03:00,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:03:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:03:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-03-04 02:03:00,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.647887323943662 [2025-03-04 02:03:00,287 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 198 flow. Second operand 3 states and 138 transitions. [2025-03-04 02:03:00,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 102 transitions, 445 flow [2025-03-04 02:03:00,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 102 transitions, 431 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 02:03:00,295 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 197 flow [2025-03-04 02:03:00,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2025-03-04 02:03:00,296 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2025-03-04 02:03:00,296 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 197 flow [2025-03-04 02:03:00,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-04 02:03:00,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:03:00,296 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:03:00,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:03:00,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:03:00,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:03:00,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2056216165, now seen corresponding path program 1 times [2025-03-04 02:03:00,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:03:00,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592007718] [2025-03-04 02:03:00,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:03:00,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:03:00,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:03:00,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:03:00,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:03:00,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:03:00,351 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-04 02:03:00,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:03:00,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592007718] [2025-03-04 02:03:00,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592007718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:03:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420215398] [2025-03-04 02:03:00,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:03:00,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:03:00,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:03:00,354 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:03:00,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:03:00,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:03:00,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:03:00,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:03:00,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:03:00,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:03:00,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:03:00,443 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-04 02:03:00,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:03:00,475 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-04 02:03:00,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420215398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:03:00,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:03:00,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-04 02:03:00,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547231583] [2025-03-04 02:03:00,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:03:00,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:03:00,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:03:00,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:03:00,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:03:00,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2025-03-04 02:03:00,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 197 flow. Second operand has 9 states, 9 states have (on average 22.88888888888889) internal successors, (206), 9 states have internal predecessors, (206), 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-04 02:03:00,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:03:00,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2025-03-04 02:03:00,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand