./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.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 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:10:25,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:10:25,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:10:25,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:10:25,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:10:25,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:10:25,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:10:25,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:10:25,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:10:25,526 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:10:25,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:10:25,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:10:25,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:10:25,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:10:25,527 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:10:25,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:10:25,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:10:25,527 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:10:25,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:10:25,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:10:25,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:10:25,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:10:25,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:10:25,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:10:25,528 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:10:25,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:10:25,528 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:10:25,528 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:10:25,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:10:25,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:10:25,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:10:25,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:10:25,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:10:25,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:10:25,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:10:25,529 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:10:25,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:10:25,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:10:25,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:10:25,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:10:25,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:10:25,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:10:25,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:10:25,530 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 -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2025-03-14 01:10:25,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:10:25,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:10:25,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:10:25,782 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:10:25,782 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:10:25,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-03-14 01:10:26,926 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91578e0d3/c6c4a7efb87c4bbc98e7d6ef7e4c40ee/FLAG23743ced0 [2025-03-14 01:10:27,145 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:10:27,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-03-14 01:10:27,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91578e0d3/c6c4a7efb87c4bbc98e7d6ef7e4c40ee/FLAG23743ced0 [2025-03-14 01:10:27,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91578e0d3/c6c4a7efb87c4bbc98e7d6ef7e4c40ee [2025-03-14 01:10:27,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:10:27,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:10:27,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:10:27,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:10:27,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:10:27,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e934f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27, skipping insertion in model container [2025-03-14 01:10:27,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:10:27,315 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-threaded-sum-3.wvr.c[2996,3009] [2025-03-14 01:10:27,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:10:27,330 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:10:27,351 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-threaded-sum-3.wvr.c[2996,3009] [2025-03-14 01:10:27,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:10:27,366 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:10:27,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27 WrapperNode [2025-03-14 01:10:27,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:10:27,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:10:27,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:10:27,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:10:27,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,397 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-03-14 01:10:27,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:10:27,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:10:27,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:10:27,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:10:27,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,423 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-14 01:10:27,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:10:27,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:10:27,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:10:27,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:10:27,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27" (1/1) ... [2025-03-14 01:10:27,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:10:27,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:27,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:10:27,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:10:27,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:10:27,482 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:10:27,482 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:10:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:10:27,483 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:10:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:10:27,483 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:10:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:10:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:10:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:10:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:10:27,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:10:27,484 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:10:27,549 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:10:27,551 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:10:27,695 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:10:27,696 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:10:27,696 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:10:27,817 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:10:27,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:10:27 BoogieIcfgContainer [2025-03-14 01:10:27,818 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:10:27,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:10:27,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:10:27,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:10:27,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:10:27" (1/3) ... [2025-03-14 01:10:27,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e43a434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:10:27, skipping insertion in model container [2025-03-14 01:10:27,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:10:27" (2/3) ... [2025-03-14 01:10:27,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e43a434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:10:27, skipping insertion in model container [2025-03-14 01:10:27,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:10:27" (3/3) ... [2025-03-14 01:10:27,824 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2025-03-14 01:10:27,834 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:10:27,835 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-threaded-sum-3.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-14 01:10:27,835 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:10:27,873 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:10:27,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 91 flow [2025-03-14 01:10:27,923 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-03-14 01:10:27,925 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:10:27,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-03-14 01:10:27,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 91 flow [2025-03-14 01:10:27,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 31 transitions, 80 flow [2025-03-14 01:10:27,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:10:27,942 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;@48020189, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:10:27,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:10:27,950 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:10:27,950 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-03-14 01:10:27,950 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:10:27,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:27,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:27,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:27,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1169081364, now seen corresponding path program 1 times [2025-03-14 01:10:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:27,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211101283] [2025-03-14 01:10:27,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:27,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:28,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:10:28,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:10:28,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:28,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:28,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:28,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211101283] [2025-03-14 01:10:28,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211101283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:28,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:28,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:10:28,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081368227] [2025-03-14 01:10:28,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:28,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:10:28,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:28,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:10:28,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:10:28,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-14 01:10:28,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:28,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:28,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-14 01:10:28,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:28,798 INFO L124 PetriNetUnfolderBase]: 644/1018 cut-off events. [2025-03-14 01:10:28,799 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-03-14 01:10:28,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 1018 events. 644/1018 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4505 event pairs, 47 based on Foata normal form. 35/1040 useless extension candidates. Maximal degree in co-relation 1805. Up to 727 conditions per place. [2025-03-14 01:10:28,811 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 43 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-03-14 01:10:28,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 236 flow [2025-03-14 01:10:28,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:10:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:10:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-14 01:10:28,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2025-03-14 01:10:28,824 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 80 flow. Second operand 4 states and 89 transitions. [2025-03-14 01:10:28,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 236 flow [2025-03-14 01:10:28,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:10:28,830 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2025-03-14 01:10:28,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-03-14 01:10:28,834 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-03-14 01:10:28,834 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2025-03-14 01:10:28,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:28,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:28,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:28,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:10:28,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:28,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:28,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1231191540, now seen corresponding path program 1 times [2025-03-14 01:10:28,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:28,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383441113] [2025-03-14 01:10:28,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:28,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:28,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:10:28,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:10:28,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:28,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:29,157 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-14 01:10:29,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:29,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383441113] [2025-03-14 01:10:29,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383441113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:29,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:29,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:10:29,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937429563] [2025-03-14 01:10:29,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:29,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:10:29,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:29,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:10:29,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:10:29,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-14 01:10:29,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:29,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:29,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-14 01:10:29,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:29,343 INFO L124 PetriNetUnfolderBase]: 592/907 cut-off events. [2025-03-14 01:10:29,343 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-03-14 01:10:29,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2083 conditions, 907 events. 592/907 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3736 event pairs, 67 based on Foata normal form. 18/919 useless extension candidates. Maximal degree in co-relation 1506. Up to 710 conditions per place. [2025-03-14 01:10:29,349 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 39 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2025-03-14 01:10:29,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 248 flow [2025-03-14 01:10:29,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:10:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:10:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-03-14 01:10:29,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2025-03-14 01:10:29,352 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 4 states and 86 transitions. [2025-03-14 01:10:29,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 248 flow [2025-03-14 01:10:29,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:10:29,354 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 146 flow [2025-03-14 01:10:29,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-03-14 01:10:29,354 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2025-03-14 01:10:29,354 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 146 flow [2025-03-14 01:10:29,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:29,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:29,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:29,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:10:29,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:29,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1491374122, now seen corresponding path program 2 times [2025-03-14 01:10:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:29,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579882956] [2025-03-14 01:10:29,359 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:10:29,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:29,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:10:29,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:10:29,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:10:29,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:29,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:29,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579882956] [2025-03-14 01:10:29,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579882956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:29,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:29,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:10:29,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283610999] [2025-03-14 01:10:29,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:29,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:29,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:29,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:29,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:10:29,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-14 01:10:29,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:29,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:29,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-14 01:10:29,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:29,877 INFO L124 PetriNetUnfolderBase]: 886/1367 cut-off events. [2025-03-14 01:10:29,877 INFO L125 PetriNetUnfolderBase]: For 636/636 co-relation queries the response was YES. [2025-03-14 01:10:29,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3381 conditions, 1367 events. 886/1367 cut-off events. For 636/636 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6399 event pairs, 135 based on Foata normal form. 44/1405 useless extension candidates. Maximal degree in co-relation 2428. Up to 864 conditions per place. [2025-03-14 01:10:29,887 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 62 selfloop transitions, 10 changer transitions 0/79 dead transitions. [2025-03-14 01:10:29,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 432 flow [2025-03-14 01:10:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:10:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:10:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-14 01:10:29,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2025-03-14 01:10:29,890 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 146 flow. Second operand 5 states and 113 transitions. [2025-03-14 01:10:29,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 432 flow [2025-03-14 01:10:29,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 79 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:10:29,894 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 206 flow [2025-03-14 01:10:29,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-03-14 01:10:29,896 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2025-03-14 01:10:29,896 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 206 flow [2025-03-14 01:10:29,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:29,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:29,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:29,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:10:29,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:29,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:29,897 INFO L85 PathProgramCache]: Analyzing trace with hash -616964054, now seen corresponding path program 3 times [2025-03-14 01:10:29,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:29,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083391857] [2025-03-14 01:10:29,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:10:29,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:29,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-03-14 01:10:29,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 24 statements. [2025-03-14 01:10:29,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:10:29,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:30,081 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-14 01:10:30,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:30,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083391857] [2025-03-14 01:10:30,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083391857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:30,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:30,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:10:30,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93760569] [2025-03-14 01:10:30,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:30,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:10:30,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:30,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:10:30,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:10:30,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-14 01:10:30,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:30,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:30,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-14 01:10:30,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:30,285 INFO L124 PetriNetUnfolderBase]: 1062/1679 cut-off events. [2025-03-14 01:10:30,285 INFO L125 PetriNetUnfolderBase]: For 1414/1414 co-relation queries the response was YES. [2025-03-14 01:10:30,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4466 conditions, 1679 events. 1062/1679 cut-off events. For 1414/1414 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8534 event pairs, 138 based on Foata normal form. 60/1720 useless extension candidates. Maximal degree in co-relation 2096. Up to 784 conditions per place. [2025-03-14 01:10:30,299 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 65 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-03-14 01:10:30,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 484 flow [2025-03-14 01:10:30,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:10:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:10:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-14 01:10:30,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2025-03-14 01:10:30,301 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 206 flow. Second operand 4 states and 89 transitions. [2025-03-14 01:10:30,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 484 flow [2025-03-14 01:10:30,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 469 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:10:30,304 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 210 flow [2025-03-14 01:10:30,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2025-03-14 01:10:30,306 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-03-14 01:10:30,306 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 210 flow [2025-03-14 01:10:30,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:30,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:30,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:30,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:10:30,307 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:30,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:30,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1179351611, now seen corresponding path program 1 times [2025-03-14 01:10:30,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:30,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617446389] [2025-03-14 01:10:30,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:30,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:10:30,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:10:30,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:30,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:30,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:30,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617446389] [2025-03-14 01:10:30,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617446389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:30,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:30,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:10:30,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893713938] [2025-03-14 01:10:30,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:30,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:30,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:30,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:30,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:10:30,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-14 01:10:30,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:30,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:30,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-14 01:10:30,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:30,754 INFO L124 PetriNetUnfolderBase]: 1470/2280 cut-off events. [2025-03-14 01:10:30,754 INFO L125 PetriNetUnfolderBase]: For 1916/1916 co-relation queries the response was YES. [2025-03-14 01:10:30,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6243 conditions, 2280 events. 1470/2280 cut-off events. For 1916/1916 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12025 event pairs, 389 based on Foata normal form. 65/2333 useless extension candidates. Maximal degree in co-relation 2751. Up to 1408 conditions per place. [2025-03-14 01:10:30,767 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 59 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2025-03-14 01:10:30,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 78 transitions, 476 flow [2025-03-14 01:10:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:10:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:10:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-14 01:10:30,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2025-03-14 01:10:30,770 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 210 flow. Second operand 5 states and 108 transitions. [2025-03-14 01:10:30,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 78 transitions, 476 flow [2025-03-14 01:10:30,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:10:30,775 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 243 flow [2025-03-14 01:10:30,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2025-03-14 01:10:30,776 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2025-03-14 01:10:30,776 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 243 flow [2025-03-14 01:10:30,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:30,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:30,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:30,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:10:30,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:30,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:30,777 INFO L85 PathProgramCache]: Analyzing trace with hash -995488711, now seen corresponding path program 2 times [2025-03-14 01:10:30,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:30,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761875961] [2025-03-14 01:10:30,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:10:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:30,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:10:30,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:10:30,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:10:30,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:30,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:30,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761875961] [2025-03-14 01:10:30,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761875961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:30,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:30,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:10:30,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341612943] [2025-03-14 01:10:30,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:30,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:30,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:30,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:30,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:10:30,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-14 01:10:30,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:30,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:30,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-14 01:10:30,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:31,220 INFO L124 PetriNetUnfolderBase]: 1920/2931 cut-off events. [2025-03-14 01:10:31,222 INFO L125 PetriNetUnfolderBase]: For 2872/2872 co-relation queries the response was YES. [2025-03-14 01:10:31,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8512 conditions, 2931 events. 1920/2931 cut-off events. For 2872/2872 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15487 event pairs, 275 based on Foata normal form. 80/3005 useless extension candidates. Maximal degree in co-relation 4481. Up to 1493 conditions per place. [2025-03-14 01:10:31,237 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 82 selfloop transitions, 11 changer transitions 0/100 dead transitions. [2025-03-14 01:10:31,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 100 transitions, 657 flow [2025-03-14 01:10:31,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:10:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:10:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-03-14 01:10:31,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-03-14 01:10:31,239 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 243 flow. Second operand 5 states and 120 transitions. [2025-03-14 01:10:31,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 100 transitions, 657 flow [2025-03-14 01:10:31,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 100 transitions, 629 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:10:31,249 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 299 flow [2025-03-14 01:10:31,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2025-03-14 01:10:31,251 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2025-03-14 01:10:31,251 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 299 flow [2025-03-14 01:10:31,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:31,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:31,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:31,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:10:31,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:31,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:31,252 INFO L85 PathProgramCache]: Analyzing trace with hash -751700695, now seen corresponding path program 1 times [2025-03-14 01:10:31,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:31,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858341636] [2025-03-14 01:10:31,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:10:31,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:31,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:10:31,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:10:31,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:31,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:33,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:33,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858341636] [2025-03-14 01:10:33,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858341636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:33,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:33,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:10:33,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058627678] [2025-03-14 01:10:33,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:33,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:10:33,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:33,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:10:33,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:10:33,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-14 01:10:33,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 299 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:33,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:33,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-14 01:10:33,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:34,805 INFO L124 PetriNetUnfolderBase]: 3863/5662 cut-off events. [2025-03-14 01:10:34,806 INFO L125 PetriNetUnfolderBase]: For 11591/11591 co-relation queries the response was YES. [2025-03-14 01:10:34,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19505 conditions, 5662 events. 3863/5662 cut-off events. For 11591/11591 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 30585 event pairs, 462 based on Foata normal form. 2/5660 useless extension candidates. Maximal degree in co-relation 10255. Up to 3187 conditions per place. [2025-03-14 01:10:34,834 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 106 selfloop transitions, 51 changer transitions 44/207 dead transitions. [2025-03-14 01:10:34,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 207 transitions, 1456 flow [2025-03-14 01:10:34,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:10:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:10:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 334 transitions. [2025-03-14 01:10:34,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5301587301587302 [2025-03-14 01:10:34,837 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 299 flow. Second operand 18 states and 334 transitions. [2025-03-14 01:10:34,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 207 transitions, 1456 flow [2025-03-14 01:10:34,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 207 transitions, 1442 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:10:34,853 INFO L231 Difference]: Finished difference. Result has 80 places, 95 transitions, 827 flow [2025-03-14 01:10:34,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=827, PETRI_PLACES=80, PETRI_TRANSITIONS=95} [2025-03-14 01:10:34,855 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2025-03-14 01:10:34,855 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 95 transitions, 827 flow [2025-03-14 01:10:34,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:34,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:34,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:34,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:10:34,856 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:34,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:34,857 INFO L85 PathProgramCache]: Analyzing trace with hash -275457129, now seen corresponding path program 2 times [2025-03-14 01:10:34,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:34,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574035130] [2025-03-14 01:10:34,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:10:34,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:34,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:10:34,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:10:34,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:10:34,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:34,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:34,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574035130] [2025-03-14 01:10:34,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574035130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:34,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:34,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:10:34,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326748819] [2025-03-14 01:10:34,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:34,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:34,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:34,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:34,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:10:34,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-14 01:10:34,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 95 transitions, 827 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:34,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:34,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-14 01:10:34,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:35,395 INFO L124 PetriNetUnfolderBase]: 3366/4952 cut-off events. [2025-03-14 01:10:35,396 INFO L125 PetriNetUnfolderBase]: For 20794/20797 co-relation queries the response was YES. [2025-03-14 01:10:35,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20840 conditions, 4952 events. 3366/4952 cut-off events. For 20794/20797 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 26578 event pairs, 92 based on Foata normal form. 156/5101 useless extension candidates. Maximal degree in co-relation 20812. Up to 1274 conditions per place. [2025-03-14 01:10:35,428 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 191 selfloop transitions, 27 changer transitions 0/224 dead transitions. [2025-03-14 01:10:35,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 224 transitions, 2315 flow [2025-03-14 01:10:35,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:10:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:10:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2025-03-14 01:10:35,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-14 01:10:35,430 INFO L175 Difference]: Start difference. First operand has 80 places, 95 transitions, 827 flow. Second operand 7 states and 140 transitions. [2025-03-14 01:10:35,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 224 transitions, 2315 flow [2025-03-14 01:10:35,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 224 transitions, 2081 flow, removed 96 selfloop flow, removed 7 redundant places. [2025-03-14 01:10:35,486 INFO L231 Difference]: Finished difference. Result has 80 places, 109 transitions, 890 flow [2025-03-14 01:10:35,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=890, PETRI_PLACES=80, PETRI_TRANSITIONS=109} [2025-03-14 01:10:35,486 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2025-03-14 01:10:35,487 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 109 transitions, 890 flow [2025-03-14 01:10:35,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:35,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:35,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:35,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:10:35,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:35,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1275710903, now seen corresponding path program 3 times [2025-03-14 01:10:35,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:35,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421058872] [2025-03-14 01:10:35,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:10:35,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:35,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:10:35,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-14 01:10:35,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:10:35,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:35,606 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-14 01:10:35,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:35,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421058872] [2025-03-14 01:10:35,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421058872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:35,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:35,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:10:35,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194797941] [2025-03-14 01:10:35,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:35,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:35,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:35,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:35,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:10:35,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-14 01:10:35,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 109 transitions, 890 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:35,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:35,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-14 01:10:35,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:36,092 INFO L124 PetriNetUnfolderBase]: 4086/5977 cut-off events. [2025-03-14 01:10:36,092 INFO L125 PetriNetUnfolderBase]: For 24706/24709 co-relation queries the response was YES. [2025-03-14 01:10:36,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25938 conditions, 5977 events. 4086/5977 cut-off events. For 24706/24709 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 33118 event pairs, 149 based on Foata normal form. 185/6155 useless extension candidates. Maximal degree in co-relation 15728. Up to 1873 conditions per place. [2025-03-14 01:10:36,128 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 240 selfloop transitions, 33 changer transitions 0/279 dead transitions. [2025-03-14 01:10:36,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 279 transitions, 2754 flow [2025-03-14 01:10:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:10:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:10:36,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2025-03-14 01:10:36,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5650793650793651 [2025-03-14 01:10:36,130 INFO L175 Difference]: Start difference. First operand has 80 places, 109 transitions, 890 flow. Second operand 9 states and 178 transitions. [2025-03-14 01:10:36,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 279 transitions, 2754 flow [2025-03-14 01:10:36,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 279 transitions, 2742 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:10:36,166 INFO L231 Difference]: Finished difference. Result has 91 places, 117 transitions, 1050 flow [2025-03-14 01:10:36,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1050, PETRI_PLACES=91, PETRI_TRANSITIONS=117} [2025-03-14 01:10:36,167 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 53 predicate places. [2025-03-14 01:10:36,167 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 117 transitions, 1050 flow [2025-03-14 01:10:36,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:36,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:36,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:36,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:10:36,167 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:36,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:36,168 INFO L85 PathProgramCache]: Analyzing trace with hash -93443947, now seen corresponding path program 4 times [2025-03-14 01:10:36,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:36,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441936413] [2025-03-14 01:10:36,168 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:10:36,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:36,179 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:10:36,184 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:10:36,189 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:10:36,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:36,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:36,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441936413] [2025-03-14 01:10:36,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441936413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:36,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518604165] [2025-03-14 01:10:36,327 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:10:36,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:36,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:36,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:10:36,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:10:36,369 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:10:36,386 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:10:36,386 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:10:36,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:36,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-14 01:10:36,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:10:36,502 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-14 01:10:36,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:10:36,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518604165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:36,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:10:36,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-14 01:10:36,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924362202] [2025-03-14 01:10:36,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:36,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:10:36,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:36,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:10:36,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:10:36,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-14 01:10:36,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 117 transitions, 1050 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:36,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:36,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-14 01:10:36,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:36,923 INFO L124 PetriNetUnfolderBase]: 3318/5075 cut-off events. [2025-03-14 01:10:36,923 INFO L125 PetriNetUnfolderBase]: For 27097/27133 co-relation queries the response was YES. [2025-03-14 01:10:36,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23969 conditions, 5075 events. 3318/5075 cut-off events. For 27097/27133 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 29274 event pairs, 411 based on Foata normal form. 64/5133 useless extension candidates. Maximal degree in co-relation 14709. Up to 3779 conditions per place. [2025-03-14 01:10:36,950 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 124 selfloop transitions, 25 changer transitions 0/158 dead transitions. [2025-03-14 01:10:36,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 158 transitions, 1659 flow [2025-03-14 01:10:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:10:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:10:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2025-03-14 01:10:36,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-03-14 01:10:36,952 INFO L175 Difference]: Start difference. First operand has 91 places, 117 transitions, 1050 flow. Second operand 6 states and 124 transitions. [2025-03-14 01:10:36,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 158 transitions, 1659 flow [2025-03-14 01:10:36,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 158 transitions, 1626 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-14 01:10:36,996 INFO L231 Difference]: Finished difference. Result has 95 places, 123 transitions, 1166 flow [2025-03-14 01:10:36,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1166, PETRI_PLACES=95, PETRI_TRANSITIONS=123} [2025-03-14 01:10:36,997 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 57 predicate places. [2025-03-14 01:10:36,998 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 123 transitions, 1166 flow [2025-03-14 01:10:36,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:36,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:36,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:37,005 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-14 01:10:37,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-14 01:10:37,203 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:37,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash -600661077, now seen corresponding path program 5 times [2025-03-14 01:10:37,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:37,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368435276] [2025-03-14 01:10:37,204 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:10:37,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:37,208 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-14 01:10:37,215 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:10:37,216 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 01:10:37,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:37,310 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-14 01:10:37,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:37,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368435276] [2025-03-14 01:10:37,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368435276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:37,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85166264] [2025-03-14 01:10:37,310 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:10:37,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:37,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:37,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:10:37,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:10:37,347 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-14 01:10:37,363 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:10:37,364 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 01:10:37,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:37,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-14 01:10:37,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:10:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:10:37,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:10:37,512 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-14 01:10:37,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85166264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:10:37,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:10:37,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-14 01:10:37,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260864417] [2025-03-14 01:10:37,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:10:37,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:10:37,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:37,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:10:37,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:10:37,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-03-14 01:10:37,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 123 transitions, 1166 flow. Second operand has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:37,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:37,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-03-14 01:10:37,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:38,531 INFO L124 PetriNetUnfolderBase]: 9135/13069 cut-off events. [2025-03-14 01:10:38,531 INFO L125 PetriNetUnfolderBase]: For 62061/62061 co-relation queries the response was YES. [2025-03-14 01:10:38,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58310 conditions, 13069 events. 9135/13069 cut-off events. For 62061/62061 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 76324 event pairs, 769 based on Foata normal form. 88/13152 useless extension candidates. Maximal degree in co-relation 51898. Up to 4090 conditions per place. [2025-03-14 01:10:38,615 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 262 selfloop transitions, 63 changer transitions 0/330 dead transitions. [2025-03-14 01:10:38,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 330 transitions, 3472 flow [2025-03-14 01:10:38,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:10:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:10:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2025-03-14 01:10:38,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-14 01:10:38,616 INFO L175 Difference]: Start difference. First operand has 95 places, 123 transitions, 1166 flow. Second operand 12 states and 224 transitions. [2025-03-14 01:10:38,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 330 transitions, 3472 flow [2025-03-14 01:10:38,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 330 transitions, 3426 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-14 01:10:38,769 INFO L231 Difference]: Finished difference. Result has 107 places, 163 transitions, 1633 flow [2025-03-14 01:10:38,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1633, PETRI_PLACES=107, PETRI_TRANSITIONS=163} [2025-03-14 01:10:38,770 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 69 predicate places. [2025-03-14 01:10:38,770 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 163 transitions, 1633 flow [2025-03-14 01:10:38,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:38,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:38,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:38,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 01:10:38,974 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,SelfDestructingSolverStorable10 [2025-03-14 01:10:38,974 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:38,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:38,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1091348197, now seen corresponding path program 6 times [2025-03-14 01:10:38,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:38,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006477816] [2025-03-14 01:10:38,976 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:10:38,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:38,981 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:10:38,999 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:10:38,999 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:10:39,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:40,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:40,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006477816] [2025-03-14 01:10:40,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006477816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:40,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:40,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 01:10:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677646829] [2025-03-14 01:10:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:40,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:10:40,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:40,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:10:40,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:10:40,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-14 01:10:40,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 163 transitions, 1633 flow. Second operand has 12 states, 12 states have (on average 10.916666666666666) internal successors, (131), 12 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:40,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:40,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-14 01:10:40,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:43,111 INFO L124 PetriNetUnfolderBase]: 9790/14434 cut-off events. [2025-03-14 01:10:43,112 INFO L125 PetriNetUnfolderBase]: For 82694/82712 co-relation queries the response was YES. [2025-03-14 01:10:43,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72085 conditions, 14434 events. 9790/14434 cut-off events. For 82694/82712 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 89331 event pairs, 924 based on Foata normal form. 21/14451 useless extension candidates. Maximal degree in co-relation 65382. Up to 8179 conditions per place. [2025-03-14 01:10:43,222 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 296 selfloop transitions, 148 changer transitions 53/506 dead transitions. [2025-03-14 01:10:43,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 506 transitions, 5763 flow [2025-03-14 01:10:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:10:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:10:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 393 transitions. [2025-03-14 01:10:43,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-03-14 01:10:43,225 INFO L175 Difference]: Start difference. First operand has 107 places, 163 transitions, 1633 flow. Second operand 21 states and 393 transitions. [2025-03-14 01:10:43,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 506 transitions, 5763 flow [2025-03-14 01:10:43,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 506 transitions, 5585 flow, removed 68 selfloop flow, removed 2 redundant places. [2025-03-14 01:10:43,455 INFO L231 Difference]: Finished difference. Result has 137 places, 290 transitions, 3470 flow [2025-03-14 01:10:43,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3470, PETRI_PLACES=137, PETRI_TRANSITIONS=290} [2025-03-14 01:10:43,456 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 99 predicate places. [2025-03-14 01:10:43,456 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 290 transitions, 3470 flow [2025-03-14 01:10:43,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.916666666666666) internal successors, (131), 12 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:43,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:43,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:43,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:10:43,456 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:43,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:43,457 INFO L85 PathProgramCache]: Analyzing trace with hash -615607067, now seen corresponding path program 7 times [2025-03-14 01:10:43,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:43,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413641987] [2025-03-14 01:10:43,457 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:10:43,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:43,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:10:43,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:10:43,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:10:43,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:44,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:44,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413641987] [2025-03-14 01:10:44,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413641987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:10:44,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:10:44,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:10:44,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804256347] [2025-03-14 01:10:44,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:10:44,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:10:44,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:44,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:10:44,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:10:45,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-03-14 01:10:45,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 290 transitions, 3470 flow. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:45,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:45,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-03-14 01:10:45,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:50,543 INFO L124 PetriNetUnfolderBase]: 18699/26957 cut-off events. [2025-03-14 01:10:50,544 INFO L125 PetriNetUnfolderBase]: For 202280/202294 co-relation queries the response was YES. [2025-03-14 01:10:50,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147445 conditions, 26957 events. 18699/26957 cut-off events. For 202280/202294 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 170829 event pairs, 2204 based on Foata normal form. 14/26965 useless extension candidates. Maximal degree in co-relation 147358. Up to 18769 conditions per place. [2025-03-14 01:10:50,822 INFO L140 encePairwiseOnDemand]: 20/35 looper letters, 560 selfloop transitions, 193 changer transitions 37/798 dead transitions. [2025-03-14 01:10:50,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 798 transitions, 10142 flow [2025-03-14 01:10:50,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 01:10:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 01:10:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 570 transitions. [2025-03-14 01:10:50,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4789915966386555 [2025-03-14 01:10:50,824 INFO L175 Difference]: Start difference. First operand has 137 places, 290 transitions, 3470 flow. Second operand 34 states and 570 transitions. [2025-03-14 01:10:50,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 798 transitions, 10142 flow [2025-03-14 01:10:51,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 798 transitions, 9834 flow, removed 114 selfloop flow, removed 8 redundant places. [2025-03-14 01:10:51,588 INFO L231 Difference]: Finished difference. Result has 179 places, 449 transitions, 5924 flow [2025-03-14 01:10:51,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3307, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=5924, PETRI_PLACES=179, PETRI_TRANSITIONS=449} [2025-03-14 01:10:51,590 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 141 predicate places. [2025-03-14 01:10:51,590 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 449 transitions, 5924 flow [2025-03-14 01:10:51,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:10:51,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:51,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:51,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:10:51,590 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:51,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:51,591 INFO L85 PathProgramCache]: Analyzing trace with hash 719881105, now seen corresponding path program 8 times [2025-03-14 01:10:51,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:51,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315405477] [2025-03-14 01:10:51,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:10:51,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:51,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:10:51,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:10:51,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:10:51,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:52,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:52,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315405477] [2025-03-14 01:10:52,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315405477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:52,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401549687] [2025-03-14 01:10:52,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:10:52,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:52,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:52,746 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:10:52,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:10:52,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:10:52,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:10:52,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:10:52,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:52,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-14 01:10:52,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:10:53,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:53,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:11:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:11:13,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401549687] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:11:13,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:11:13,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2025-03-14 01:11:13,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141533905] [2025-03-14 01:11:13,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:11:13,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-14 01:11:13,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:13,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-14 01:11:13,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=687, Unknown=4, NotChecked=0, Total=870 [2025-03-14 01:11:13,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-03-14 01:11:13,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 449 transitions, 5924 flow. Second operand has 30 states, 30 states have (on average 10.3) internal successors, (309), 30 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:13,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:13,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-03-14 01:11:13,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:45,105 INFO L124 PetriNetUnfolderBase]: 85476/123226 cut-off events. [2025-03-14 01:11:45,106 INFO L125 PetriNetUnfolderBase]: For 1329640/1331337 co-relation queries the response was YES. [2025-03-14 01:11:46,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774799 conditions, 123226 events. 85476/123226 cut-off events. For 1329640/1331337 co-relation queries the response was YES. Maximal size of possible extension queue 5401. Compared 936379 event pairs, 940 based on Foata normal form. 1647/124817 useless extension candidates. Maximal degree in co-relation 774625. Up to 29380 conditions per place. [2025-03-14 01:11:46,915 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 1444 selfloop transitions, 1969 changer transitions 284/3711 dead transitions. [2025-03-14 01:11:46,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 3711 transitions, 51218 flow [2025-03-14 01:11:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2025-03-14 01:11:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2025-03-14 01:11:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 2389 transitions. [2025-03-14 01:11:46,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4946169772256729 [2025-03-14 01:11:46,922 INFO L175 Difference]: Start difference. First operand has 179 places, 449 transitions, 5924 flow. Second operand 138 states and 2389 transitions. [2025-03-14 01:11:46,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 3711 transitions, 51218 flow [2025-03-14 01:11:55,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 3711 transitions, 50207 flow, removed 472 selfloop flow, removed 10 redundant places. [2025-03-14 01:11:55,295 INFO L231 Difference]: Finished difference. Result has 383 places, 2427 transitions, 39808 flow [2025-03-14 01:11:55,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5698, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=138, PETRI_FLOW=39808, PETRI_PLACES=383, PETRI_TRANSITIONS=2427} [2025-03-14 01:11:55,296 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 345 predicate places. [2025-03-14 01:11:55,296 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 2427 transitions, 39808 flow [2025-03-14 01:11:55,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 10.3) internal successors, (309), 30 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:55,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:55,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:55,302 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-14 01:11:55,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:55,497 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:11:55,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash 401683483, now seen corresponding path program 1 times [2025-03-14 01:11:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850432133] [2025-03-14 01:11:55,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:55,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:11:55,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:11:55,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:55,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:11:55,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:55,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850432133] [2025-03-14 01:11:55,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850432133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:55,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534062532] [2025-03-14 01:11:55,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:55,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:55,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:55,617 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:11:55,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:11:55,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:11:55,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:11:55,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:55,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:55,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 01:11:55,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:11:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:11:55,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:11:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:11:55,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534062532] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:11:55,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:11:55,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 16 [2025-03-14 01:11:55,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266588018] [2025-03-14 01:11:55,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:11:55,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-14 01:11:55,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:55,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-14 01:11:55,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-14 01:11:55,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-03-14 01:11:55,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 2427 transitions, 39808 flow. Second operand has 16 states, 16 states have (on average 11.875) internal successors, (190), 16 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:55,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:55,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-03-14 01:11:55,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand