./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-nonblocking-counter-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-nonblocking-counter-alt2.wvr.c -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 87e1a1d3acb3ee9b7a4a97eb7b14df31d5b38b7566b1218cea0dabfe5ec8ddbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:49:16,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:49:16,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:49:16,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:49:16,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:49:16,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:49:16,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:49:16,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:49:16,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:49:16,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:49:16,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:49:16,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:49:16,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:49:16,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:49:16,341 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:49:16,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:49:16,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:49:16,341 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:49:16,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:49:16,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:49:16,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:49:16,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:49:16,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:49:16,342 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:49:16,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:49:16,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:49:16,343 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 -> 87e1a1d3acb3ee9b7a4a97eb7b14df31d5b38b7566b1218cea0dabfe5ec8ddbd [2025-03-13 21:49:16,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:49:16,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:49:16,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:49:16,607 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:49:16,607 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:49:16,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2025-03-13 21:49:17,767 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b3f6baf1/7769256ec38c478797814b724234a373/FLAGebedee506 [2025-03-13 21:49:17,970 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:49:17,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2025-03-13 21:49:17,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b3f6baf1/7769256ec38c478797814b724234a373/FLAGebedee506 [2025-03-13 21:49:17,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b3f6baf1/7769256ec38c478797814b724234a373 [2025-03-13 21:49:17,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:49:17,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:49:17,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:49:17,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:49:18,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:49:18,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:49:17" (1/1) ... [2025-03-13 21:49:18,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575fa61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18, skipping insertion in model container [2025-03-13 21:49:18,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:49:17" (1/1) ... [2025-03-13 21:49:18,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:49:18,139 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/weaver/popl20-more-nonblocking-counter-alt2.wvr.c[2173,2186] [2025-03-13 21:49:18,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:49:18,148 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:49:18,161 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/weaver/popl20-more-nonblocking-counter-alt2.wvr.c[2173,2186] [2025-03-13 21:49:18,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:49:18,176 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:49:18,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18 WrapperNode [2025-03-13 21:49:18,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:49:18,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:49:18,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:49:18,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:49:18,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18" (1/1) ... [2025-03-13 21:49:18,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18" (1/1) ... [2025-03-13 21:49:18,201 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2025-03-13 21:49:18,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:49:18,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:49:18,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:49:18,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:49:18,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18" (1/1) ... [2025-03-13 21:49:18,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18" (1/1) ... [2025-03-13 21:49:18,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18" (1/1) ... [2025-03-13 21:49:18,226 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-13 21:49:18,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18" (1/1) ... [2025-03-13 21:49:18,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18" (1/1) ... [2025-03-13 21:49:18,230 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18" (1/1) ... [2025-03-13 21:49:18,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18" (1/1) ... [2025-03-13 21:49:18,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18" (1/1) ... [2025-03-13 21:49:18,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18" (1/1) ... [2025-03-13 21:49:18,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:49:18,237 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:49:18,237 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:49:18,237 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:49:18,238 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18" (1/1) ... [2025-03-13 21:49:18,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:49:18,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:18,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:49:18,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:49:18,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:49:18,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:49:18,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:49:18,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:49:18,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:49:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:49:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:49:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:49:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:49:18,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:49:18,284 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:49:18,341 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:49:18,343 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:49:18,481 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:49:18,482 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:49:18,482 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:49:18,616 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:49:18,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:49:18 BoogieIcfgContainer [2025-03-13 21:49:18,617 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:49:18,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:49:18,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:49:18,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:49:18,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:49:17" (1/3) ... [2025-03-13 21:49:18,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f74157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:49:18, skipping insertion in model container [2025-03-13 21:49:18,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:18" (2/3) ... [2025-03-13 21:49:18,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f74157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:49:18, skipping insertion in model container [2025-03-13 21:49:18,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:49:18" (3/3) ... [2025-03-13 21:49:18,625 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-nonblocking-counter-alt2.wvr.c [2025-03-13 21:49:18,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:49:18,640 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-nonblocking-counter-alt2.wvr.c that has 3 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-13 21:49:18,640 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:49:18,689 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:49:18,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 56 flow [2025-03-13 21:49:18,741 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-03-13 21:49:18,747 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:49:18,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 2/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-03-13 21:49:18,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 21 transitions, 56 flow [2025-03-13 21:49:18,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 48 flow [2025-03-13 21:49:18,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:49:18,779 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;@6220a9ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:49:18,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:49:18,793 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:49:18,793 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-03-13 21:49:18,793 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:49:18,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:18,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:18,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:18,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:18,800 INFO L85 PathProgramCache]: Analyzing trace with hash -510011595, now seen corresponding path program 1 times [2025-03-13 21:49:18,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:18,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505621551] [2025-03-13 21:49:18,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:18,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-13 21:49:18,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:49:18,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:18,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:19,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:19,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505621551] [2025-03-13 21:49:19,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505621551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:19,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:19,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:49:19,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39010878] [2025-03-13 21:49:19,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:19,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:49:19,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:19,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:49:19,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:49:19,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-13 21:49:19,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:19,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:19,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-13 21:49:19,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:19,181 INFO L124 PetriNetUnfolderBase]: 73/147 cut-off events. [2025-03-13 21:49:19,182 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:49:19,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 147 events. 73/147 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 438 event pairs, 22 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 255. Up to 74 conditions per place. [2025-03-13 21:49:19,185 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 20 selfloop transitions, 2 changer transitions 3/28 dead transitions. [2025-03-13 21:49:19,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 127 flow [2025-03-13 21:49:19,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:49:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:49:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-03-13 21:49:19,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2025-03-13 21:49:19,196 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 48 flow. Second operand 3 states and 41 transitions. [2025-03-13 21:49:19,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 127 flow [2025-03-13 21:49:19,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 28 transitions, 113 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:19,201 INFO L231 Difference]: Finished difference. Result has 22 places, 19 transitions, 52 flow [2025-03-13 21:49:19,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=22, PETRI_TRANSITIONS=19} [2025-03-13 21:49:19,205 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2025-03-13 21:49:19,205 INFO L471 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 52 flow [2025-03-13 21:49:19,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:19,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:19,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:19,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:49:19,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:19,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:19,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1628349778, now seen corresponding path program 1 times [2025-03-13 21:49:19,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:19,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077112749] [2025-03-13 21:49:19,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:19,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:19,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:49:19,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:49:19,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:19,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:19,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:19,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077112749] [2025-03-13 21:49:19,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077112749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:19,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:19,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:49:19,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292855415] [2025-03-13 21:49:19,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:19,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:49:19,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:19,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:49:19,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:49:19,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:49:19,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:19,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:19,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:49:19,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:19,473 INFO L124 PetriNetUnfolderBase]: 173/302 cut-off events. [2025-03-13 21:49:19,473 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-13 21:49:19,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 302 events. 173/302 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 987 event pairs, 93 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 282. Up to 213 conditions per place. [2025-03-13 21:49:19,475 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 25 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2025-03-13 21:49:19,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 29 transitions, 134 flow [2025-03-13 21:49:19,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:49:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:49:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2025-03-13 21:49:19,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-13 21:49:19,476 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 52 flow. Second operand 4 states and 39 transitions. [2025-03-13 21:49:19,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 29 transitions, 134 flow [2025-03-13 21:49:19,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 29 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:19,477 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 64 flow [2025-03-13 21:49:19,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2025-03-13 21:49:19,478 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-03-13 21:49:19,478 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 64 flow [2025-03-13 21:49:19,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:19,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:19,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:19,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:49:19,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:19,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:19,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1499780884, now seen corresponding path program 1 times [2025-03-13 21:49:19,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:19,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205598134] [2025-03-13 21:49:19,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:19,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:19,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:49:19,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:49:19,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:19,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:19,778 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-13 21:49:19,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:19,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205598134] [2025-03-13 21:49:19,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205598134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:19,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982619330] [2025-03-13 21:49:19,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:19,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:19,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:19,782 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-13 21:49:19,783 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-13 21:49:19,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:49:19,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:49:19,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:19,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:19,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:49:19,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:19,954 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-13 21:49:19,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:20,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982619330] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:20,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:49:20,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 12 [2025-03-13 21:49:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884500098] [2025-03-13 21:49:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:20,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:49:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:20,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:49:20,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:49:20,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-03-13 21:49:20,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:20,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:20,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-03-13 21:49:20,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:20,252 INFO L124 PetriNetUnfolderBase]: 207/376 cut-off events. [2025-03-13 21:49:20,252 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-03-13 21:49:20,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 376 events. 207/376 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1406 event pairs, 55 based on Foata normal form. 1/331 useless extension candidates. Maximal degree in co-relation 261. Up to 156 conditions per place. [2025-03-13 21:49:20,254 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 36 selfloop transitions, 6 changer transitions 3/47 dead transitions. [2025-03-13 21:49:20,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 47 transitions, 240 flow [2025-03-13 21:49:20,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:49:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:49:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-03-13 21:49:20,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2025-03-13 21:49:20,256 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 64 flow. Second operand 4 states and 58 transitions. [2025-03-13 21:49:20,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 47 transitions, 240 flow [2025-03-13 21:49:20,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 47 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:49:20,257 INFO L231 Difference]: Finished difference. Result has 28 places, 24 transitions, 106 flow [2025-03-13 21:49:20,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=28, PETRI_TRANSITIONS=24} [2025-03-13 21:49:20,258 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2025-03-13 21:49:20,258 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 24 transitions, 106 flow [2025-03-13 21:49:20,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:20,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:20,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:20,265 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-13 21:49:20,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:20,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:20,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:20,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1257977062, now seen corresponding path program 2 times [2025-03-13 21:49:20,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:20,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734560462] [2025-03-13 21:49:20,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:20,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:20,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:49:20,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:49:20,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:20,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:20,611 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-13 21:49:20,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:20,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734560462] [2025-03-13 21:49:20,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734560462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:20,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558918621] [2025-03-13 21:49:20,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:20,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:20,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:20,613 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-13 21:49:20,615 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-13 21:49:20,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:49:20,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:49:20,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:20,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:20,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:49:20,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:20,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:49:20,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558918621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:20,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:49:20,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-13 21:49:20,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557570326] [2025-03-13 21:49:20,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:20,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:49:20,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:20,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:49:20,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:49:20,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:49:20,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 24 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:20,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:20,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:49:20,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:20,845 INFO L124 PetriNetUnfolderBase]: 263/458 cut-off events. [2025-03-13 21:49:20,845 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2025-03-13 21:49:20,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 458 events. 263/458 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1622 event pairs, 81 based on Foata normal form. 6/430 useless extension candidates. Maximal degree in co-relation 437. Up to 380 conditions per place. [2025-03-13 21:49:20,848 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 36 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2025-03-13 21:49:20,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 260 flow [2025-03-13 21:49:20,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:49:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:49:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-03-13 21:49:20,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2025-03-13 21:49:20,851 INFO L175 Difference]: Start difference. First operand has 28 places, 24 transitions, 106 flow. Second operand 6 states and 58 transitions. [2025-03-13 21:49:20,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 260 flow [2025-03-13 21:49:20,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 44 transitions, 258 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 21:49:20,853 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 154 flow [2025-03-13 21:49:20,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-03-13 21:49:20,853 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 13 predicate places. [2025-03-13 21:49:20,853 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 154 flow [2025-03-13 21:49:20,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:20,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:20,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:20,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:49:21,055 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,SelfDestructingSolverStorable3 [2025-03-13 21:49:21,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:21,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1495270982, now seen corresponding path program 3 times [2025-03-13 21:49:21,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:21,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812860082] [2025-03-13 21:49:21,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:21,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:21,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:49:21,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:49:21,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:21,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:21,224 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-13 21:49:21,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:21,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812860082] [2025-03-13 21:49:21,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812860082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:21,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151364937] [2025-03-13 21:49:21,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:21,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:21,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:21,226 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-13 21:49:21,227 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-13 21:49:21,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:49:21,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:49:21,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:21,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:21,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:49:21,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:21,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:49:21,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151364937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:21,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:49:21,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-03-13 21:49:21,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934181151] [2025-03-13 21:49:21,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:21,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:49:21,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:21,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:49:21,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:49:21,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:49:21,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:21,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:21,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:49:21,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:21,502 INFO L124 PetriNetUnfolderBase]: 367/634 cut-off events. [2025-03-13 21:49:21,502 INFO L125 PetriNetUnfolderBase]: For 788/788 co-relation queries the response was YES. [2025-03-13 21:49:21,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1957 conditions, 634 events. 367/634 cut-off events. For 788/788 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2463 event pairs, 92 based on Foata normal form. 18/652 useless extension candidates. Maximal degree in co-relation 1619. Up to 408 conditions per place. [2025-03-13 21:49:21,517 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 44 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2025-03-13 21:49:21,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 372 flow [2025-03-13 21:49:21,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:49:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:49:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2025-03-13 21:49:21,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2025-03-13 21:49:21,520 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 154 flow. Second operand 7 states and 66 transitions. [2025-03-13 21:49:21,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 372 flow [2025-03-13 21:49:21,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 361 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:21,525 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 212 flow [2025-03-13 21:49:21,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=212, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2025-03-13 21:49:21,526 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 19 predicate places. [2025-03-13 21:49:21,526 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 212 flow [2025-03-13 21:49:21,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:21,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:21,527 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:21,533 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-13 21:49:21,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:21,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:21,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash -519403035, now seen corresponding path program 4 times [2025-03-13 21:49:21,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:21,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24360050] [2025-03-13 21:49:21,728 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:21,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:21,732 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:21,738 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:21,738 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:21,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:21,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:21,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24360050] [2025-03-13 21:49:21,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24360050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:21,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455397304] [2025-03-13 21:49:21,877 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:21,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:21,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:21,880 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-13 21:49:21,882 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-13 21:49:21,910 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:21,920 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:21,921 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:21,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:21,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:21,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:22,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:22,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455397304] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:22,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:22,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2025-03-13 21:49:22,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585056896] [2025-03-13 21:49:22,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:22,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:49:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:22,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:49:22,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:49:22,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:49:22,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 212 flow. Second operand has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:22,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:22,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:49:22,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:22,939 INFO L124 PetriNetUnfolderBase]: 662/1103 cut-off events. [2025-03-13 21:49:22,939 INFO L125 PetriNetUnfolderBase]: For 1767/1767 co-relation queries the response was YES. [2025-03-13 21:49:22,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3508 conditions, 1103 events. 662/1103 cut-off events. For 1767/1767 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4704 event pairs, 3 based on Foata normal form. 33/1136 useless extension candidates. Maximal degree in co-relation 2907. Up to 205 conditions per place. [2025-03-13 21:49:22,945 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 95 selfloop transitions, 84 changer transitions 18/198 dead transitions. [2025-03-13 21:49:22,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 198 transitions, 1397 flow [2025-03-13 21:49:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-13 21:49:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-13 21:49:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 247 transitions. [2025-03-13 21:49:22,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43562610229276894 [2025-03-13 21:49:22,947 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 212 flow. Second operand 27 states and 247 transitions. [2025-03-13 21:49:22,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 198 transitions, 1397 flow [2025-03-13 21:49:22,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 198 transitions, 1365 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:49:22,952 INFO L231 Difference]: Finished difference. Result has 82 places, 106 transitions, 1013 flow [2025-03-13 21:49:22,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1013, PETRI_PLACES=82, PETRI_TRANSITIONS=106} [2025-03-13 21:49:22,952 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 59 predicate places. [2025-03-13 21:49:22,952 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 106 transitions, 1013 flow [2025-03-13 21:49:22,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:22,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:22,952 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:22,958 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-13 21:49:23,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:23,157 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:23,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:23,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1315178329, now seen corresponding path program 5 times [2025-03-13 21:49:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:23,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434882559] [2025-03-13 21:49:23,158 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:23,163 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:23,169 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:23,170 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:23,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:23,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:23,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434882559] [2025-03-13 21:49:23,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434882559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:23,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482915171] [2025-03-13 21:49:23,324 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:23,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:23,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:23,326 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-13 21:49:23,328 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-13 21:49:23,350 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:23,360 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:23,360 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:23,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:23,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:23,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:23,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:23,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482915171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:23,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:23,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2025-03-13 21:49:23,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156358942] [2025-03-13 21:49:23,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:23,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:49:23,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:23,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:49:23,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:49:23,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:49:23,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 106 transitions, 1013 flow. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 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-13 21:49:23,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:23,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:49:23,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:25,965 INFO L124 PetriNetUnfolderBase]: 1554/2552 cut-off events. [2025-03-13 21:49:25,965 INFO L125 PetriNetUnfolderBase]: For 23577/23577 co-relation queries the response was YES. [2025-03-13 21:49:25,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13597 conditions, 2552 events. 1554/2552 cut-off events. For 23577/23577 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12987 event pairs, 25 based on Foata normal form. 56/2608 useless extension candidates. Maximal degree in co-relation 11275. Up to 538 conditions per place. [2025-03-13 21:49:25,986 INFO L140 encePairwiseOnDemand]: 10/21 looper letters, 205 selfloop transitions, 338 changer transitions 10/554 dead transitions. [2025-03-13 21:49:25,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 554 transitions, 6190 flow [2025-03-13 21:49:25,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-13 21:49:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-03-13 21:49:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 425 transitions. [2025-03-13 21:49:25,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.413022351797862 [2025-03-13 21:49:25,989 INFO L175 Difference]: Start difference. First operand has 82 places, 106 transitions, 1013 flow. Second operand 49 states and 425 transitions. [2025-03-13 21:49:25,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 554 transitions, 6190 flow [2025-03-13 21:49:26,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 554 transitions, 5762 flow, removed 208 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:26,048 INFO L231 Difference]: Finished difference. Result has 142 places, 429 transitions, 5241 flow [2025-03-13 21:49:26,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=5241, PETRI_PLACES=142, PETRI_TRANSITIONS=429} [2025-03-13 21:49:26,049 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 119 predicate places. [2025-03-13 21:49:26,049 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 429 transitions, 5241 flow [2025-03-13 21:49:26,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 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-13 21:49:26,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:26,050 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:26,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 21:49:26,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:26,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:26,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:26,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1843655867, now seen corresponding path program 6 times [2025-03-13 21:49:26,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:26,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572667752] [2025-03-13 21:49:26,251 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:26,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:26,255 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:26,262 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:26,262 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:49:26,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:26,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:26,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572667752] [2025-03-13 21:49:26,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572667752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:26,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376762769] [2025-03-13 21:49:26,411 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:26,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:26,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:26,413 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-13 21:49:26,415 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-13 21:49:26,440 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:26,472 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:26,472 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:49:26,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:26,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:26,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:26,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:26,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376762769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:26,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:26,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2025-03-13 21:49:26,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603240352] [2025-03-13 21:49:26,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:26,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-13 21:49:26,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:26,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-13 21:49:26,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-03-13 21:49:26,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:49:26,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 429 transitions, 5241 flow. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:26,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:26,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:49:26,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:27,554 INFO L124 PetriNetUnfolderBase]: 2061/3376 cut-off events. [2025-03-13 21:49:27,554 INFO L125 PetriNetUnfolderBase]: For 34767/34767 co-relation queries the response was YES. [2025-03-13 21:49:27,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21483 conditions, 3376 events. 2061/3376 cut-off events. For 34767/34767 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18506 event pairs, 72 based on Foata normal form. 10/3386 useless extension candidates. Maximal degree in co-relation 21414. Up to 875 conditions per place. [2025-03-13 21:49:27,581 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 262 selfloop transitions, 458 changer transitions 5/726 dead transitions. [2025-03-13 21:49:27,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 726 transitions, 10326 flow [2025-03-13 21:49:27,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 21:49:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 21:49:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 157 transitions. [2025-03-13 21:49:27,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39348370927318294 [2025-03-13 21:49:27,583 INFO L175 Difference]: Start difference. First operand has 142 places, 429 transitions, 5241 flow. Second operand 19 states and 157 transitions. [2025-03-13 21:49:27,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 726 transitions, 10326 flow [2025-03-13 21:49:27,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 726 transitions, 9090 flow, removed 604 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:27,766 INFO L231 Difference]: Finished difference. Result has 164 places, 648 transitions, 8997 flow [2025-03-13 21:49:27,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4523, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=250, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=8997, PETRI_PLACES=164, PETRI_TRANSITIONS=648} [2025-03-13 21:49:27,767 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 141 predicate places. [2025-03-13 21:49:27,767 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 648 transitions, 8997 flow [2025-03-13 21:49:27,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:27,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:27,767 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:27,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 21:49:27,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:27,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:27,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:27,968 INFO L85 PathProgramCache]: Analyzing trace with hash 269717729, now seen corresponding path program 7 times [2025-03-13 21:49:27,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:27,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165268924] [2025-03-13 21:49:27,968 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:27,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:27,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:49:27,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:27,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:27,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:28,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:28,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165268924] [2025-03-13 21:49:28,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165268924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:28,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017263485] [2025-03-13 21:49:28,082 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:28,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:28,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:28,083 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-13 21:49:28,084 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-13 21:49:28,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:49:28,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:28,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:28,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:28,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:28,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:28,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:28,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017263485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:28,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:28,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2025-03-13 21:49:28,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642785089] [2025-03-13 21:49:28,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:28,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:49:28,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:28,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:49:28,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:49:28,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:49:28,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 648 transitions, 8997 flow. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:28,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:28,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:49:28,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:29,905 INFO L124 PetriNetUnfolderBase]: 2592/4231 cut-off events. [2025-03-13 21:49:29,906 INFO L125 PetriNetUnfolderBase]: For 38625/38625 co-relation queries the response was YES. [2025-03-13 21:49:29,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28683 conditions, 4231 events. 2592/4231 cut-off events. For 38625/38625 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 23751 event pairs, 22 based on Foata normal form. 94/4325 useless extension candidates. Maximal degree in co-relation 27607. Up to 888 conditions per place. [2025-03-13 21:49:29,946 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 302 selfloop transitions, 775 changer transitions 9/1087 dead transitions. [2025-03-13 21:49:29,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 1087 transitions, 16639 flow [2025-03-13 21:49:29,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-13 21:49:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-13 21:49:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 378 transitions. [2025-03-13 21:49:29,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-13 21:49:29,948 INFO L175 Difference]: Start difference. First operand has 164 places, 648 transitions, 8997 flow. Second operand 44 states and 378 transitions. [2025-03-13 21:49:29,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 1087 transitions, 16639 flow [2025-03-13 21:49:30,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 1087 transitions, 16218 flow, removed 210 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:30,282 INFO L231 Difference]: Finished difference. Result has 231 places, 913 transitions, 15185 flow [2025-03-13 21:49:30,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=8784, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=512, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=15185, PETRI_PLACES=231, PETRI_TRANSITIONS=913} [2025-03-13 21:49:30,283 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 208 predicate places. [2025-03-13 21:49:30,283 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 913 transitions, 15185 flow [2025-03-13 21:49:30,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:30,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:30,283 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:30,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:30,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:30,483 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:30,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:30,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1893128623, now seen corresponding path program 8 times [2025-03-13 21:49:30,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:30,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034053718] [2025-03-13 21:49:30,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:30,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:30,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:30,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:30,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:30,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:30,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:30,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034053718] [2025-03-13 21:49:30,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034053718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:30,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084039427] [2025-03-13 21:49:30,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:30,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:30,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:30,624 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-13 21:49:30,625 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-13 21:49:30,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:30,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:30,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:30,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:30,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:30,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:30,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:30,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084039427] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:30,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:30,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-03-13 21:49:30,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618203417] [2025-03-13 21:49:30,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:30,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-13 21:49:30,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:30,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-13 21:49:30,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-13 21:49:30,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:49:30,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 913 transitions, 15185 flow. Second operand has 17 states, 17 states have (on average 5.352941176470588) internal successors, (91), 17 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:30,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:30,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:49:30,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:32,585 INFO L124 PetriNetUnfolderBase]: 3486/5770 cut-off events. [2025-03-13 21:49:32,585 INFO L125 PetriNetUnfolderBase]: For 64174/64174 co-relation queries the response was YES. [2025-03-13 21:49:32,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43732 conditions, 5770 events. 3486/5770 cut-off events. For 64174/64174 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 35339 event pairs, 61 based on Foata normal form. 64/5834 useless extension candidates. Maximal degree in co-relation 43418. Up to 1173 conditions per place. [2025-03-13 21:49:32,687 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 433 selfloop transitions, 1058 changer transitions 9/1501 dead transitions. [2025-03-13 21:49:32,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 1501 transitions, 26939 flow [2025-03-13 21:49:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-13 21:49:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-13 21:49:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 294 transitions. [2025-03-13 21:49:32,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-03-13 21:49:32,689 INFO L175 Difference]: Start difference. First operand has 231 places, 913 transitions, 15185 flow. Second operand 32 states and 294 transitions. [2025-03-13 21:49:32,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 1501 transitions, 26939 flow [2025-03-13 21:49:33,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 1501 transitions, 26280 flow, removed 287 selfloop flow, removed 6 redundant places. [2025-03-13 21:49:33,437 INFO L231 Difference]: Finished difference. Result has 275 places, 1310 transitions, 25643 flow [2025-03-13 21:49:33,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=14660, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=697, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=25643, PETRI_PLACES=275, PETRI_TRANSITIONS=1310} [2025-03-13 21:49:33,437 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 252 predicate places. [2025-03-13 21:49:33,438 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 1310 transitions, 25643 flow [2025-03-13 21:49:33,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.352941176470588) internal successors, (91), 17 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:33,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:33,438 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:33,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-13 21:49:33,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-13 21:49:33,665 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:33,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:33,665 INFO L85 PathProgramCache]: Analyzing trace with hash -16998021, now seen corresponding path program 9 times [2025-03-13 21:49:33,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:33,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936293482] [2025-03-13 21:49:33,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:33,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:33,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:33,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:33,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:33,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:33,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:33,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936293482] [2025-03-13 21:49:33,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936293482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:33,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90541645] [2025-03-13 21:49:33,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:33,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:33,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:33,746 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:33,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-13 21:49:33,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:33,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:33,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:33,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:33,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:33,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:33,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:33,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90541645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:33,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:33,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2025-03-13 21:49:33,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471429272] [2025-03-13 21:49:33,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:33,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:49:33,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:33,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:49:33,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:49:33,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:49:33,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 1310 transitions, 25643 flow. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:33,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:33,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:49:33,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:35,816 INFO L124 PetriNetUnfolderBase]: 3532/5810 cut-off events. [2025-03-13 21:49:35,816 INFO L125 PetriNetUnfolderBase]: For 88954/88954 co-relation queries the response was YES. [2025-03-13 21:49:35,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50199 conditions, 5810 events. 3532/5810 cut-off events. For 88954/88954 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 35468 event pairs, 124 based on Foata normal form. 8/5818 useless extension candidates. Maximal degree in co-relation 49975. Up to 1277 conditions per place. [2025-03-13 21:49:35,880 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 440 selfloop transitions, 1014 changer transitions 4/1459 dead transitions. [2025-03-13 21:49:35,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 1459 transitions, 30409 flow [2025-03-13 21:49:35,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:49:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:49:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 199 transitions. [2025-03-13 21:49:35,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4512471655328798 [2025-03-13 21:49:35,882 INFO L175 Difference]: Start difference. First operand has 275 places, 1310 transitions, 25643 flow. Second operand 21 states and 199 transitions. [2025-03-13 21:49:35,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 1459 transitions, 30409 flow [2025-03-13 21:49:37,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 1459 transitions, 30085 flow, removed 154 selfloop flow, removed 2 redundant places. [2025-03-13 21:49:37,234 INFO L231 Difference]: Finished difference. Result has 295 places, 1336 transitions, 28635 flow [2025-03-13 21:49:37,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=25186, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=979, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=28635, PETRI_PLACES=295, PETRI_TRANSITIONS=1336} [2025-03-13 21:49:37,235 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 272 predicate places. [2025-03-13 21:49:37,236 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 1336 transitions, 28635 flow [2025-03-13 21:49:37,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:37,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:37,236 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:37,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:37,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:37,436 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:37,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:37,437 INFO L85 PathProgramCache]: Analyzing trace with hash 7289019, now seen corresponding path program 10 times [2025-03-13 21:49:37,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:37,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035733065] [2025-03-13 21:49:37,437 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:37,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:37,441 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:37,446 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:37,446 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:37,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:37,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:37,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035733065] [2025-03-13 21:49:37,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035733065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:37,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069315239] [2025-03-13 21:49:37,601 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:37,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:37,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:37,603 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:37,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-13 21:49:37,625 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:37,634 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:37,634 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:37,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:37,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:37,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:37,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:37,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:37,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069315239] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:37,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:37,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-03-13 21:49:37,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688216620] [2025-03-13 21:49:37,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:37,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 21:49:37,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:37,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 21:49:37,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:49:37,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:49:37,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 1336 transitions, 28635 flow. Second operand has 18 states, 18 states have (on average 5.277777777777778) internal successors, (95), 18 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:37,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:37,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:49:37,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:39,864 INFO L124 PetriNetUnfolderBase]: 4028/6661 cut-off events. [2025-03-13 21:49:39,864 INFO L125 PetriNetUnfolderBase]: For 132530/132530 co-relation queries the response was YES. [2025-03-13 21:49:39,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62173 conditions, 6661 events. 4028/6661 cut-off events. For 132530/132530 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 41933 event pairs, 180 based on Foata normal form. 53/6714 useless extension candidates. Maximal degree in co-relation 61959. Up to 1671 conditions per place. [2025-03-13 21:49:39,922 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 482 selfloop transitions, 1166 changer transitions 8/1657 dead transitions. [2025-03-13 21:49:39,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 1657 transitions, 37880 flow [2025-03-13 21:49:39,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-13 21:49:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-13 21:49:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 221 transitions. [2025-03-13 21:49:39,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4575569358178054 [2025-03-13 21:49:39,924 INFO L175 Difference]: Start difference. First operand has 295 places, 1336 transitions, 28635 flow. Second operand 23 states and 221 transitions. [2025-03-13 21:49:39,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 1657 transitions, 37880 flow [2025-03-13 21:49:41,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 1657 transitions, 36949 flow, removed 34 selfloop flow, removed 9 redundant places. [2025-03-13 21:49:41,730 INFO L231 Difference]: Finished difference. Result has 316 places, 1526 transitions, 36885 flow [2025-03-13 21:49:41,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=27836, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=991, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=36885, PETRI_PLACES=316, PETRI_TRANSITIONS=1526} [2025-03-13 21:49:41,731 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 293 predicate places. [2025-03-13 21:49:41,731 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 1526 transitions, 36885 flow [2025-03-13 21:49:41,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.277777777777778) internal successors, (95), 18 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:41,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:41,731 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:41,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-13 21:49:41,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-13 21:49:41,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:41,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:41,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1305800289, now seen corresponding path program 11 times [2025-03-13 21:49:41,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:41,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735051398] [2025-03-13 21:49:41,932 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:41,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:41,935 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:41,940 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:41,940 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:41,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:42,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735051398] [2025-03-13 21:49:42,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735051398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:42,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586297911] [2025-03-13 21:49:42,033 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:42,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:42,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:42,036 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:42,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-13 21:49:42,059 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:42,068 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:42,068 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:42,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:42,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:42,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:42,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:42,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586297911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:42,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:42,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2025-03-13 21:49:42,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773609678] [2025-03-13 21:49:42,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:42,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:49:42,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:42,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:49:42,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:49:42,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:49:42,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 1526 transitions, 36885 flow. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:42,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:42,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:49:42,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:44,733 INFO L124 PetriNetUnfolderBase]: 4234/6956 cut-off events. [2025-03-13 21:49:44,733 INFO L125 PetriNetUnfolderBase]: For 168056/168056 co-relation queries the response was YES. [2025-03-13 21:49:44,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71880 conditions, 6956 events. 4234/6956 cut-off events. For 168056/168056 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 43536 event pairs, 254 based on Foata normal form. 14/6970 useless extension candidates. Maximal degree in co-relation 71489. Up to 1736 conditions per place. [2025-03-13 21:49:44,803 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 350 selfloop transitions, 1380 changer transitions 2/1733 dead transitions. [2025-03-13 21:49:44,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 1733 transitions, 44236 flow [2025-03-13 21:49:44,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:49:44,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:49:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 190 transitions. [2025-03-13 21:49:44,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4308390022675737 [2025-03-13 21:49:44,804 INFO L175 Difference]: Start difference. First operand has 316 places, 1526 transitions, 36885 flow. Second operand 21 states and 190 transitions. [2025-03-13 21:49:44,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 1733 transitions, 44236 flow [2025-03-13 21:49:47,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 1733 transitions, 43857 flow, removed 98 selfloop flow, removed 14 redundant places. [2025-03-13 21:49:47,423 INFO L231 Difference]: Finished difference. Result has 330 places, 1643 transitions, 44814 flow [2025-03-13 21:49:47,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=36464, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1267, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=44814, PETRI_PLACES=330, PETRI_TRANSITIONS=1643} [2025-03-13 21:49:47,424 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 307 predicate places. [2025-03-13 21:49:47,425 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 1643 transitions, 44814 flow [2025-03-13 21:49:47,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:47,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:47,425 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:47,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:47,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-13 21:49:47,626 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:49:47,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1147121101, now seen corresponding path program 12 times [2025-03-13 21:49:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:47,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909538035] [2025-03-13 21:49:47,626 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:47,630 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:47,635 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:47,635 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:49:47,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:47,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:47,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909538035] [2025-03-13 21:49:47,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909538035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:47,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247067942] [2025-03-13 21:49:47,722 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:47,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:47,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:47,724 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:47,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-13 21:49:47,746 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:49:47,754 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:47,754 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:49:47,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:47,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:47,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:47,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247067942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:47,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:47,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 15 [2025-03-13 21:49:47,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121045596] [2025-03-13 21:49:47,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:47,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:49:47,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:47,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:49:47,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:49:47,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:49:47,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 1643 transitions, 44814 flow. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:47,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:47,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:49:47,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:53,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:49:56,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:49:58,834 INFO L124 PetriNetUnfolderBase]: 6446/10609 cut-off events. [2025-03-13 21:49:58,835 INFO L125 PetriNetUnfolderBase]: For 311596/311596 co-relation queries the response was YES. [2025-03-13 21:49:58,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120710 conditions, 10609 events. 6446/10609 cut-off events. For 311596/311596 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 70005 event pairs, 82 based on Foata normal form. 56/10665 useless extension candidates. Maximal degree in co-relation 119335. Up to 3807 conditions per place. [2025-03-13 21:49:58,981 INFO L140 encePairwiseOnDemand]: 10/21 looper letters, 1156 selfloop transitions, 1742 changer transitions 15/2914 dead transitions. [2025-03-13 21:49:58,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 2914 transitions, 83329 flow [2025-03-13 21:49:58,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-13 21:49:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-03-13 21:49:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 438 transitions. [2025-03-13 21:49:58,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41714285714285715 [2025-03-13 21:49:58,983 INFO L175 Difference]: Start difference. First operand has 330 places, 1643 transitions, 44814 flow. Second operand 50 states and 438 transitions. [2025-03-13 21:49:58,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 2914 transitions, 83329 flow [2025-03-13 21:50:06,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 2914 transitions, 82780 flow, removed 197 selfloop flow, removed 8 redundant places. [2025-03-13 21:50:06,885 INFO L231 Difference]: Finished difference. Result has 400 places, 2635 transitions, 78439 flow [2025-03-13 21:50:06,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=44477, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=905, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=78439, PETRI_PLACES=400, PETRI_TRANSITIONS=2635} [2025-03-13 21:50:06,888 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 377 predicate places. [2025-03-13 21:50:06,888 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 2635 transitions, 78439 flow [2025-03-13 21:50:06,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:06,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:06,889 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:06,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:07,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-13 21:50:07,090 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:07,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:07,091 INFO L85 PathProgramCache]: Analyzing trace with hash -618643563, now seen corresponding path program 13 times [2025-03-13 21:50:07,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:07,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931016271] [2025-03-13 21:50:07,091 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:50:07,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:07,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:50:07,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:50:07,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:07,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:07,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931016271] [2025-03-13 21:50:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931016271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101545569] [2025-03-13 21:50:07,185 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:50:07,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:07,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:07,187 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:07,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-13 21:50:07,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:50:07,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:50:07,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:07,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:07,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:50:07,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:07,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101545569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:07,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:07,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2025-03-13 21:50:07,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249350548] [2025-03-13 21:50:07,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:07,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 21:50:07,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:07,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 21:50:07,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:50:07,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:07,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 2635 transitions, 78439 flow. Second operand has 18 states, 18 states have (on average 5.222222222222222) internal successors, (94), 18 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:07,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:07,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:07,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:13,328 INFO L124 PetriNetUnfolderBase]: 6660/10983 cut-off events. [2025-03-13 21:50:13,329 INFO L125 PetriNetUnfolderBase]: For 376089/376089 co-relation queries the response was YES. [2025-03-13 21:50:13,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136203 conditions, 10983 events. 6660/10983 cut-off events. For 376089/376089 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 73061 event pairs, 1279 based on Foata normal form. 10/10993 useless extension candidates. Maximal degree in co-relation 135970. Up to 6919 conditions per place. [2025-03-13 21:50:13,459 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 1606 selfloop transitions, 1262 changer transitions 4/2873 dead transitions. [2025-03-13 21:50:13,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 2873 transitions, 89650 flow [2025-03-13 21:50:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:50:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:50:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 125 transitions. [2025-03-13 21:50:13,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2025-03-13 21:50:13,461 INFO L175 Difference]: Start difference. First operand has 400 places, 2635 transitions, 78439 flow. Second operand 15 states and 125 transitions. [2025-03-13 21:50:13,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 2873 transitions, 89650 flow [2025-03-13 21:50:23,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 2873 transitions, 87864 flow, removed 865 selfloop flow, removed 5 redundant places. [2025-03-13 21:50:23,184 INFO L231 Difference]: Finished difference. Result has 419 places, 2757 transitions, 85846 flow [2025-03-13 21:50:23,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=76814, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=85846, PETRI_PLACES=419, PETRI_TRANSITIONS=2757} [2025-03-13 21:50:23,186 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 396 predicate places. [2025-03-13 21:50:23,186 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 2757 transitions, 85846 flow [2025-03-13 21:50:23,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.222222222222222) internal successors, (94), 18 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:23,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:23,186 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:23,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-13 21:50:23,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-13 21:50:23,387 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:23,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:23,387 INFO L85 PathProgramCache]: Analyzing trace with hash 530444179, now seen corresponding path program 14 times [2025-03-13 21:50:23,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:23,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642433854] [2025-03-13 21:50:23,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:50:23,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:23,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:50:23,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:50:23,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:23,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:23,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:23,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642433854] [2025-03-13 21:50:23,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642433854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:23,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464680206] [2025-03-13 21:50:23,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:50:23,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:23,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:23,535 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:23,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-13 21:50:23,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:50:23,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:50:23,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:23,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:23,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:50:23,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:23,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:23,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464680206] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:23,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:23,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-13 21:50:23,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897041912] [2025-03-13 21:50:23,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:23,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-13 21:50:23,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:23,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-13 21:50:23,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-03-13 21:50:23,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:23,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 2757 transitions, 85846 flow. Second operand has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:23,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:23,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:23,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:31,122 INFO L124 PetriNetUnfolderBase]: 7673/12668 cut-off events. [2025-03-13 21:50:31,122 INFO L125 PetriNetUnfolderBase]: For 502594/502594 co-relation queries the response was YES. [2025-03-13 21:50:31,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164912 conditions, 12668 events. 7673/12668 cut-off events. For 502594/502594 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 86797 event pairs, 790 based on Foata normal form. 81/12749 useless extension candidates. Maximal degree in co-relation 164070. Up to 5072 conditions per place. [2025-03-13 21:50:31,284 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 1706 selfloop transitions, 1606 changer transitions 4/3317 dead transitions. [2025-03-13 21:50:31,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 3317 transitions, 108173 flow [2025-03-13 21:50:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:50:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:50:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 192 transitions. [2025-03-13 21:50:31,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2025-03-13 21:50:31,285 INFO L175 Difference]: Start difference. First operand has 419 places, 2757 transitions, 85846 flow. Second operand 21 states and 192 transitions. [2025-03-13 21:50:31,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 3317 transitions, 108173 flow [2025-03-13 21:50:43,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 3317 transitions, 107578 flow, removed 131 selfloop flow, removed 5 redundant places. [2025-03-13 21:50:43,997 INFO L231 Difference]: Finished difference. Result has 444 places, 3017 transitions, 100583 flow [2025-03-13 21:50:43,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=85253, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=100583, PETRI_PLACES=444, PETRI_TRANSITIONS=3017} [2025-03-13 21:50:44,000 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 421 predicate places. [2025-03-13 21:50:44,000 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 3017 transitions, 100583 flow [2025-03-13 21:50:44,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:44,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:44,000 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:44,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-13 21:50:44,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:44,201 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:44,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:44,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1377950289, now seen corresponding path program 15 times [2025-03-13 21:50:44,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:44,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447502774] [2025-03-13 21:50:44,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:44,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:44,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-13 21:50:44,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:50:44,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-13 21:50:44,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:44,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447502774] [2025-03-13 21:50:44,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447502774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:44,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779671869] [2025-03-13 21:50:44,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:44,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:44,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:44,324 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:44,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-13 21:50:44,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-13 21:50:44,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:50:44,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-13 21:50:44,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:44,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:50:44,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:44,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:44,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779671869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:44,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:44,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-03-13 21:50:44,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492684742] [2025-03-13 21:50:44,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:44,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-13 21:50:44,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:44,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-13 21:50:44,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-13 21:50:44,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:44,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 3017 transitions, 100583 flow. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 19 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:44,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:44,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:44,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand