./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 04:43:27,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:43:27,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:43:27,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:43:27,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:43:27,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:43:27,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:43:27,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:43:27,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:43:27,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:43:27,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:43:27,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:43:27,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:43:27,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:43:27,147 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:43:27,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:43:27,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:43:27,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:43:27,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:43:27,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:43:27,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:43:27,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:43:27,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:43:27,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:43:27,147 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:43:27,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:43:27,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:43:27,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:43:27,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:43:27,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:43:27,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:43:27,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:43:27,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:43:27,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:43:27,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:43:27,148 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:43:27,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:43:27,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:43:27,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:43:27,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:43:27,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:43:27,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:43:27,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:43:27,149 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-jdk21/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-02-06 04:43:27,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:43:27,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:43:27,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:43:27,362 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:43:27,362 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:43:27,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-02-06 04:43:28,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61ec8db0e/b23e6f37d4f941b4a0d41d60cb60a868/FLAG0fb7cf731 [2025-02-06 04:43:28,836 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:43:28,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-02-06 04:43:28,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61ec8db0e/b23e6f37d4f941b4a0d41d60cb60a868/FLAG0fb7cf731 [2025-02-06 04:43:29,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61ec8db0e/b23e6f37d4f941b4a0d41d60cb60a868 [2025-02-06 04:43:29,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:43:29,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:43:29,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:43:29,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:43:29,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:43:29,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4caea517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29, skipping insertion in model container [2025-02-06 04:43:29,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:43:29,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-02-06 04:43:29,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:43:29,301 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:43:29,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-02-06 04:43:29,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:43:29,325 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:43:29,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29 WrapperNode [2025-02-06 04:43:29,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:43:29,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:43:29,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:43:29,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:43:29,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,345 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-02-06 04:43:29,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:43:29,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:43:29,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:43:29,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:43:29,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,362 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-02-06 04:43:29,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:43:29,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:43:29,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:43:29,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:43:29,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29" (1/1) ... [2025-02-06 04:43:29,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:43:29,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:29,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:43:29,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:43:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:43:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:43:29,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:43:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:43:29,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:43:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:43:29,435 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:43:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:43:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:43:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:43:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:43:29,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:43:29,439 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:43:29,529 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:43:29,530 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:43:29,686 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:43:29,686 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:43:29,773 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:43:29,774 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:43:29,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:43:29 BoogieIcfgContainer [2025-02-06 04:43:29,774 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:43:29,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:43:29,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:43:29,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:43:29,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:43:29" (1/3) ... [2025-02-06 04:43:29,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5b1f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:43:29, skipping insertion in model container [2025-02-06 04:43:29,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:29" (2/3) ... [2025-02-06 04:43:29,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5b1f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:43:29, skipping insertion in model container [2025-02-06 04:43:29,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:43:29" (3/3) ... [2025-02-06 04:43:29,781 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2025-02-06 04:43:29,793 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:43:29,794 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-02-06 04:43:29,794 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:43:29,829 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:43:29,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 91 flow [2025-02-06 04:43:29,881 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-02-06 04:43:29,885 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:43:29,887 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-02-06 04:43:29,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 91 flow [2025-02-06 04:43:29,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 31 transitions, 80 flow [2025-02-06 04:43:29,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:43:29,908 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;@22d7ba5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:43:29,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:43:29,917 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:43:29,918 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-02-06 04:43:29,918 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:43:29,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:29,918 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-02-06 04:43:29,919 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-02-06 04:43:29,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:29,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1169081364, now seen corresponding path program 1 times [2025-02-06 04:43:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:29,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677314417] [2025-02-06 04:43:29,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:29,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:29,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:43:30,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:43:30,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:30,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:30,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:30,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677314417] [2025-02-06 04:43:30,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677314417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:30,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:30,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:43:30,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910015036] [2025-02-06 04:43:30,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:30,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:43:30,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:30,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:43:30,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:43:30,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-02-06 04:43:30,617 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-02-06 04:43:30,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:30,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-02-06 04:43:30,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:30,869 INFO L124 PetriNetUnfolderBase]: 644/1018 cut-off events. [2025-02-06 04:43:30,869 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-02-06 04:43:30,873 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-02-06 04:43:30,880 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 43 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-02-06 04:43:30,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 236 flow [2025-02-06 04:43:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:43:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:43:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-02-06 04:43:30,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2025-02-06 04:43:30,893 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 80 flow. Second operand 4 states and 89 transitions. [2025-02-06 04:43:30,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 236 flow [2025-02-06 04:43:30,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:43:30,899 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2025-02-06 04:43:30,901 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-02-06 04:43:30,904 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-02-06 04:43:30,904 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2025-02-06 04:43:30,904 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-02-06 04:43:30,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:30,904 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-02-06 04:43:30,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:43:30,906 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-02-06 04:43:30,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:30,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1231191540, now seen corresponding path program 1 times [2025-02-06 04:43:30,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:30,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511621791] [2025-02-06 04:43:30,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:30,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:30,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:43:30,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:43:30,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:30,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:31,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:31,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511621791] [2025-02-06 04:43:31,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511621791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:31,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:31,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:43:31,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138852975] [2025-02-06 04:43:31,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:31,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:43:31,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:31,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:43:31,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:43:31,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-02-06 04:43:31,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-02-06 04:43:31,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:31,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-02-06 04:43:31,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:31,596 INFO L124 PetriNetUnfolderBase]: 1225/1894 cut-off events. [2025-02-06 04:43:31,596 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2025-02-06 04:43:31,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4249 conditions, 1894 events. 1225/1894 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9390 event pairs, 384 based on Foata normal form. 28/1910 useless extension candidates. Maximal degree in co-relation 2782. Up to 1047 conditions per place. [2025-02-06 04:43:31,606 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 67 selfloop transitions, 20 changer transitions 0/93 dead transitions. [2025-02-06 04:43:31,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 93 transitions, 450 flow [2025-02-06 04:43:31,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:43:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:43:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-02-06 04:43:31,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-02-06 04:43:31,607 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 5 states and 120 transitions. [2025-02-06 04:43:31,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 93 transitions, 450 flow [2025-02-06 04:43:31,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 93 transitions, 450 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:43:31,609 INFO L231 Difference]: Finished difference. Result has 44 places, 53 transitions, 256 flow [2025-02-06 04:43:31,610 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=44, PETRI_TRANSITIONS=53} [2025-02-06 04:43:31,610 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-02-06 04:43:31,610 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 53 transitions, 256 flow [2025-02-06 04:43:31,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-02-06 04:43:31,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:31,611 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-02-06 04:43:31,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:43:31,611 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-02-06 04:43:31,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:31,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1960074056, now seen corresponding path program 2 times [2025-02-06 04:43:31,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:31,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134308608] [2025-02-06 04:43:31,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:43:31,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:31,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:43:31,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:43:31,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:43:31,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:31,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134308608] [2025-02-06 04:43:31,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134308608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:31,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:31,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:43:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454397440] [2025-02-06 04:43:31,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:31,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:43:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:31,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:43:31,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:43:31,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-02-06 04:43:31,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 53 transitions, 256 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-02-06 04:43:31,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:31,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-02-06 04:43:31,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:32,018 INFO L124 PetriNetUnfolderBase]: 1173/1823 cut-off events. [2025-02-06 04:43:32,018 INFO L125 PetriNetUnfolderBase]: For 1638/1638 co-relation queries the response was YES. [2025-02-06 04:43:32,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5363 conditions, 1823 events. 1173/1823 cut-off events. For 1638/1638 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8695 event pairs, 188 based on Foata normal form. 114/1929 useless extension candidates. Maximal degree in co-relation 3932. Up to 891 conditions per place. [2025-02-06 04:43:32,030 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 77 selfloop transitions, 6 changer transitions 2/92 dead transitions. [2025-02-06 04:43:32,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 92 transitions, 584 flow [2025-02-06 04:43:32,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:43:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:43:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-02-06 04:43:32,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6342857142857142 [2025-02-06 04:43:32,031 INFO L175 Difference]: Start difference. First operand has 44 places, 53 transitions, 256 flow. Second operand 5 states and 111 transitions. [2025-02-06 04:43:32,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 92 transitions, 584 flow [2025-02-06 04:43:32,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 92 transitions, 574 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-02-06 04:43:32,036 INFO L231 Difference]: Finished difference. Result has 51 places, 54 transitions, 274 flow [2025-02-06 04:43:32,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=51, PETRI_TRANSITIONS=54} [2025-02-06 04:43:32,037 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-02-06 04:43:32,037 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 274 flow [2025-02-06 04:43:32,037 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-02-06 04:43:32,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:32,037 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-02-06 04:43:32,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:43:32,037 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-02-06 04:43:32,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1718649179, now seen corresponding path program 1 times [2025-02-06 04:43:32,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:32,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065692030] [2025-02-06 04:43:32,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:32,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:32,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:43:32,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:43:32,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:32,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:32,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:32,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065692030] [2025-02-06 04:43:32,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065692030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:32,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:32,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:43:32,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466276616] [2025-02-06 04:43:32,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:32,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:43:32,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:32,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:43:32,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:43:32,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-02-06 04:43:32,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 274 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-02-06 04:43:32,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:32,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-02-06 04:43:32,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:32,467 INFO L124 PetriNetUnfolderBase]: 1641/2542 cut-off events. [2025-02-06 04:43:32,467 INFO L125 PetriNetUnfolderBase]: For 3547/3547 co-relation queries the response was YES. [2025-02-06 04:43:32,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8202 conditions, 2542 events. 1641/2542 cut-off events. For 3547/3547 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13074 event pairs, 345 based on Foata normal form. 80/2612 useless extension candidates. Maximal degree in co-relation 5826. Up to 1629 conditions per place. [2025-02-06 04:43:32,481 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 79 selfloop transitions, 10 changer transitions 2/98 dead transitions. [2025-02-06 04:43:32,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 677 flow [2025-02-06 04:43:32,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:43:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:43:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-02-06 04:43:32,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-02-06 04:43:32,482 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 274 flow. Second operand 5 states and 110 transitions. [2025-02-06 04:43:32,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 677 flow [2025-02-06 04:43:32,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 98 transitions, 672 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:43:32,493 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 313 flow [2025-02-06 04:43:32,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2025-02-06 04:43:32,493 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2025-02-06 04:43:32,493 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 313 flow [2025-02-06 04:43:32,493 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-02-06 04:43:32,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:32,493 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-02-06 04:43:32,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:43:32,494 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-02-06 04:43:32,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1939738791, now seen corresponding path program 2 times [2025-02-06 04:43:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:32,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502523786] [2025-02-06 04:43:32,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:43:32,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:32,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:43:32,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:43:32,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:43:32,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:32,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:32,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502523786] [2025-02-06 04:43:32,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502523786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:32,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:32,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:43:32,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387839496] [2025-02-06 04:43:32,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:32,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:43:32,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:32,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:43:32,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:43:32,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-02-06 04:43:32,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 313 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-06 04:43:32,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:32,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-02-06 04:43:32,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:32,981 INFO L124 PetriNetUnfolderBase]: 2653/4064 cut-off events. [2025-02-06 04:43:32,981 INFO L125 PetriNetUnfolderBase]: For 6437/6437 co-relation queries the response was YES. [2025-02-06 04:43:32,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13747 conditions, 4064 events. 2653/4064 cut-off events. For 6437/6437 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 22092 event pairs, 238 based on Foata normal form. 96/4154 useless extension candidates. Maximal degree in co-relation 7092. Up to 2403 conditions per place. [2025-02-06 04:43:33,009 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 104 selfloop transitions, 12 changer transitions 0/123 dead transitions. [2025-02-06 04:43:33,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 123 transitions, 917 flow [2025-02-06 04:43:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:43:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:43:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-02-06 04:43:33,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-02-06 04:43:33,010 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 313 flow. Second operand 5 states and 120 transitions. [2025-02-06 04:43:33,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 123 transitions, 917 flow [2025-02-06 04:43:33,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 123 transitions, 884 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:43:33,023 INFO L231 Difference]: Finished difference. Result has 59 places, 67 transitions, 447 flow [2025-02-06 04:43:33,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=447, PETRI_PLACES=59, PETRI_TRANSITIONS=67} [2025-02-06 04:43:33,024 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2025-02-06 04:43:33,024 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 67 transitions, 447 flow [2025-02-06 04:43:33,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-06 04:43:33,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:33,025 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-02-06 04:43:33,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:43:33,025 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-02-06 04:43:33,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash 960186571, now seen corresponding path program 1 times [2025-02-06 04:43:33,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:33,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274210259] [2025-02-06 04:43:33,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:33,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:33,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:43:33,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:43:33,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:33,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:33,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:33,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274210259] [2025-02-06 04:43:33,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274210259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:33,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:33,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:43:33,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640654390] [2025-02-06 04:43:33,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:33,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:43:33,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:33,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:43:33,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:43:33,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-02-06 04:43:33,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 67 transitions, 447 flow. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:33,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:33,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-02-06 04:43:33,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:33,802 INFO L124 PetriNetUnfolderBase]: 3970/5824 cut-off events. [2025-02-06 04:43:33,803 INFO L125 PetriNetUnfolderBase]: For 19797/19797 co-relation queries the response was YES. [2025-02-06 04:43:33,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23074 conditions, 5824 events. 3970/5824 cut-off events. For 19797/19797 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 31957 event pairs, 70 based on Foata normal form. 310/5881 useless extension candidates. Maximal degree in co-relation 12517. Up to 1647 conditions per place. [2025-02-06 04:43:33,834 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 207 selfloop transitions, 41 changer transitions 0/254 dead transitions. [2025-02-06 04:43:33,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 254 transitions, 2424 flow [2025-02-06 04:43:33,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:43:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:43:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2025-02-06 04:43:33,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5685714285714286 [2025-02-06 04:43:33,836 INFO L175 Difference]: Start difference. First operand has 59 places, 67 transitions, 447 flow. Second operand 10 states and 199 transitions. [2025-02-06 04:43:33,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 254 transitions, 2424 flow [2025-02-06 04:43:33,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 254 transitions, 2380 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-02-06 04:43:33,850 INFO L231 Difference]: Finished difference. Result has 74 places, 99 transitions, 828 flow [2025-02-06 04:43:33,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=828, PETRI_PLACES=74, PETRI_TRANSITIONS=99} [2025-02-06 04:43:33,851 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2025-02-06 04:43:33,851 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 99 transitions, 828 flow [2025-02-06 04:43:33,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:33,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:33,851 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-02-06 04:43:33,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:43:33,851 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-02-06 04:43:33,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash -572474613, now seen corresponding path program 2 times [2025-02-06 04:43:33,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:33,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861232243] [2025-02-06 04:43:33,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:43:33,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:33,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:43:33,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:43:33,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:43:33,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:35,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:35,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861232243] [2025-02-06 04:43:35,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861232243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:35,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:35,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:43:35,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099937508] [2025-02-06 04:43:35,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:35,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:43:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:35,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:43:35,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:43:35,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-02-06 04:43:35,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 99 transitions, 828 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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-02-06 04:43:35,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:35,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-02-06 04:43:35,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:36,996 INFO L124 PetriNetUnfolderBase]: 5250/8024 cut-off events. [2025-02-06 04:43:36,996 INFO L125 PetriNetUnfolderBase]: For 39779/39858 co-relation queries the response was YES. [2025-02-06 04:43:37,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37382 conditions, 8024 events. 5250/8024 cut-off events. For 39779/39858 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 48583 event pairs, 429 based on Foata normal form. 84/8096 useless extension candidates. Maximal degree in co-relation 22641. Up to 4723 conditions per place. [2025-02-06 04:43:37,142 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 166 selfloop transitions, 54 changer transitions 56/285 dead transitions. [2025-02-06 04:43:37,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 285 transitions, 2837 flow [2025-02-06 04:43:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:43:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 04:43:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 262 transitions. [2025-02-06 04:43:37,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5758241758241758 [2025-02-06 04:43:37,143 INFO L175 Difference]: Start difference. First operand has 74 places, 99 transitions, 828 flow. Second operand 13 states and 262 transitions. [2025-02-06 04:43:37,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 285 transitions, 2837 flow [2025-02-06 04:43:37,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 285 transitions, 2837 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:43:37,192 INFO L231 Difference]: Finished difference. Result has 95 places, 149 transitions, 1535 flow [2025-02-06 04:43:37,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1535, PETRI_PLACES=95, PETRI_TRANSITIONS=149} [2025-02-06 04:43:37,192 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 57 predicate places. [2025-02-06 04:43:37,193 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 149 transitions, 1535 flow [2025-02-06 04:43:37,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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-02-06 04:43:37,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:37,193 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-02-06 04:43:37,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:43:37,193 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-02-06 04:43:37,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:37,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1938561411, now seen corresponding path program 3 times [2025-02-06 04:43:37,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:37,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876423579] [2025-02-06 04:43:37,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:43:37,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:37,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:43:37,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:43:37,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:43:37,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:38,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:38,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:38,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876423579] [2025-02-06 04:43:38,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876423579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:38,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:38,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:43:38,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290150528] [2025-02-06 04:43:38,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:38,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:43:38,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:38,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:43:38,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:43:38,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-02-06 04:43:38,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 149 transitions, 1535 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-02-06 04:43:38,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:38,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-02-06 04:43:38,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:40,526 INFO L124 PetriNetUnfolderBase]: 6889/10245 cut-off events. [2025-02-06 04:43:40,527 INFO L125 PetriNetUnfolderBase]: For 67407/67407 co-relation queries the response was YES. [2025-02-06 04:43:40,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53353 conditions, 10245 events. 6889/10245 cut-off events. For 67407/67407 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 62055 event pairs, 1074 based on Foata normal form. 4/10245 useless extension candidates. Maximal degree in co-relation 53304. Up to 7447 conditions per place. [2025-02-06 04:43:40,591 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 201 selfloop transitions, 50 changer transitions 54/311 dead transitions. [2025-02-06 04:43:40,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 311 transitions, 3509 flow [2025-02-06 04:43:40,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 04:43:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 04:43:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 270 transitions. [2025-02-06 04:43:40,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-02-06 04:43:40,593 INFO L175 Difference]: Start difference. First operand has 95 places, 149 transitions, 1535 flow. Second operand 15 states and 270 transitions. [2025-02-06 04:43:40,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 311 transitions, 3509 flow [2025-02-06 04:43:40,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 311 transitions, 3437 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-02-06 04:43:40,723 INFO L231 Difference]: Finished difference. Result has 115 places, 182 transitions, 2062 flow [2025-02-06 04:43:40,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2062, PETRI_PLACES=115, PETRI_TRANSITIONS=182} [2025-02-06 04:43:40,725 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 77 predicate places. [2025-02-06 04:43:40,725 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 182 transitions, 2062 flow [2025-02-06 04:43:40,726 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-02-06 04:43:40,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:40,726 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-02-06 04:43:40,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:43:40,726 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-02-06 04:43:40,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:40,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1033143293, now seen corresponding path program 4 times [2025-02-06 04:43:40,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:40,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011810046] [2025-02-06 04:43:40,727 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:43:40,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:40,732 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-06 04:43:40,748 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:43:40,748 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:43:40,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:41,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:41,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011810046] [2025-02-06 04:43:41,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011810046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:41,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:41,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:43:41,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127961939] [2025-02-06 04:43:41,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:41,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:43:41,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:41,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:43:41,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:43:41,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-02-06 04:43:41,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 182 transitions, 2062 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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-02-06 04:43:41,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:41,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-02-06 04:43:41,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:43,184 INFO L124 PetriNetUnfolderBase]: 6235/9518 cut-off events. [2025-02-06 04:43:43,184 INFO L125 PetriNetUnfolderBase]: For 77840/77934 co-relation queries the response was YES. [2025-02-06 04:43:43,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53365 conditions, 9518 events. 6235/9518 cut-off events. For 77840/77934 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 59668 event pairs, 615 based on Foata normal form. 98/9608 useless extension candidates. Maximal degree in co-relation 53307. Up to 6217 conditions per place. [2025-02-06 04:43:43,266 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 205 selfloop transitions, 56 changer transitions 54/324 dead transitions. [2025-02-06 04:43:43,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 324 transitions, 3916 flow [2025-02-06 04:43:43,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:43:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 04:43:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 258 transitions. [2025-02-06 04:43:43,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.567032967032967 [2025-02-06 04:43:43,268 INFO L175 Difference]: Start difference. First operand has 115 places, 182 transitions, 2062 flow. Second operand 13 states and 258 transitions. [2025-02-06 04:43:43,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 324 transitions, 3916 flow [2025-02-06 04:43:43,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 324 transitions, 3797 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-02-06 04:43:43,469 INFO L231 Difference]: Finished difference. Result has 128 places, 195 transitions, 2308 flow [2025-02-06 04:43:43,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1953, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2308, PETRI_PLACES=128, PETRI_TRANSITIONS=195} [2025-02-06 04:43:43,470 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2025-02-06 04:43:43,471 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 195 transitions, 2308 flow [2025-02-06 04:43:43,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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-02-06 04:43:43,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:43,471 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-02-06 04:43:43,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:43:43,471 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-02-06 04:43:43,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash 618988665, now seen corresponding path program 1 times [2025-02-06 04:43:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:43,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650407605] [2025-02-06 04:43:43,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:43,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:43:43,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:43:43,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:43,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:43,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:43,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650407605] [2025-02-06 04:43:43,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650407605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:43,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:43,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:43:43,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049157005] [2025-02-06 04:43:43,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:43,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:43:43,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:43,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:43:43,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:43:43,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-02-06 04:43:43,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 195 transitions, 2308 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-02-06 04:43:43,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:43,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-02-06 04:43:43,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:45,544 INFO L124 PetriNetUnfolderBase]: 11483/17466 cut-off events. [2025-02-06 04:43:45,545 INFO L125 PetriNetUnfolderBase]: For 184994/185182 co-relation queries the response was YES. [2025-02-06 04:43:45,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105010 conditions, 17466 events. 11483/17466 cut-off events. For 184994/185182 co-relation queries the response was YES. Maximal size of possible extension queue 913. Compared 115999 event pairs, 1394 based on Foata normal form. 362/17817 useless extension candidates. Maximal degree in co-relation 104921. Up to 6373 conditions per place. [2025-02-06 04:43:45,795 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 435 selfloop transitions, 88 changer transitions 0/532 dead transitions. [2025-02-06 04:43:45,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 532 transitions, 7186 flow [2025-02-06 04:43:45,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:43:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:43:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2025-02-06 04:43:45,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2025-02-06 04:43:45,796 INFO L175 Difference]: Start difference. First operand has 128 places, 195 transitions, 2308 flow. Second operand 9 states and 204 transitions. [2025-02-06 04:43:45,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 532 transitions, 7186 flow [2025-02-06 04:43:46,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 532 transitions, 7002 flow, removed 46 selfloop flow, removed 6 redundant places. [2025-02-06 04:43:46,305 INFO L231 Difference]: Finished difference. Result has 132 places, 262 transitions, 3339 flow [2025-02-06 04:43:46,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2210, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3339, PETRI_PLACES=132, PETRI_TRANSITIONS=262} [2025-02-06 04:43:46,306 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 94 predicate places. [2025-02-06 04:43:46,306 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 262 transitions, 3339 flow [2025-02-06 04:43:46,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-02-06 04:43:46,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:46,307 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-02-06 04:43:46,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:43:46,307 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-02-06 04:43:46,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash 40313595, now seen corresponding path program 2 times [2025-02-06 04:43:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749753417] [2025-02-06 04:43:46,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:43:46,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:46,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:43:46,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:43:46,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:43:46,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:46,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:46,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749753417] [2025-02-06 04:43:46,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749753417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:46,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:46,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:43:46,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817225690] [2025-02-06 04:43:46,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:46,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:43:46,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:46,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:43:46,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:43:46,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-02-06 04:43:46,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 262 transitions, 3339 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-02-06 04:43:46,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:46,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-02-06 04:43:46,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:49,001 INFO L124 PetriNetUnfolderBase]: 14504/22064 cut-off events. [2025-02-06 04:43:49,002 INFO L125 PetriNetUnfolderBase]: For 302552/302709 co-relation queries the response was YES. [2025-02-06 04:43:49,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143922 conditions, 22064 events. 14504/22064 cut-off events. For 302552/302709 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 153164 event pairs, 1625 based on Foata normal form. 253/22309 useless extension candidates. Maximal degree in co-relation 132192. Up to 12577 conditions per place. [2025-02-06 04:43:49,229 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 361 selfloop transitions, 69 changer transitions 0/439 dead transitions. [2025-02-06 04:43:49,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 439 transitions, 6259 flow [2025-02-06 04:43:49,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:43:49,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:43:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2025-02-06 04:43:49,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2025-02-06 04:43:49,230 INFO L175 Difference]: Start difference. First operand has 132 places, 262 transitions, 3339 flow. Second operand 9 states and 196 transitions. [2025-02-06 04:43:49,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 439 transitions, 6259 flow [2025-02-06 04:43:50,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 439 transitions, 6135 flow, removed 28 selfloop flow, removed 3 redundant places. [2025-02-06 04:43:50,331 INFO L231 Difference]: Finished difference. Result has 140 places, 289 transitions, 3916 flow [2025-02-06 04:43:50,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3263, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3916, PETRI_PLACES=140, PETRI_TRANSITIONS=289} [2025-02-06 04:43:50,332 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 102 predicate places. [2025-02-06 04:43:50,332 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 289 transitions, 3916 flow [2025-02-06 04:43:50,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-02-06 04:43:50,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:50,333 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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-02-06 04:43:50,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:43:50,333 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-02-06 04:43:50,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:50,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1494859979, now seen corresponding path program 5 times [2025-02-06 04:43:50,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:50,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443881517] [2025-02-06 04:43:50,333 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:43:50,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:50,337 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 04:43:50,352 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:43:50,353 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:43:50,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:51,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:51,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443881517] [2025-02-06 04:43:51,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443881517] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:43:51,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321506375] [2025-02-06 04:43:51,558 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:43:51,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:51,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:51,560 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:43:51,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:43:51,596 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 04:43:51,645 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:43:51,645 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:43:51,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:51,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 04:43:51,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:08,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:11,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321506375] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:44:11,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:44:11,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-02-06 04:44:11,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407477569] [2025-02-06 04:44:11,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:44:11,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 04:44:11,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:11,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 04:44:11,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=500, Unknown=4, NotChecked=0, Total=650 [2025-02-06 04:44:11,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-02-06 04:44:11,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 289 transitions, 3916 flow. Second operand has 26 states, 26 states have (on average 12.0) internal successors, (312), 26 states have internal predecessors, (312), 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-02-06 04:44:11,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:11,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-02-06 04:44:11,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand