./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c3fe688d0e9a9929009fc24c8ef56c8fc1bfa15613131b287e178eb7d2f1f1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:27:04,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:27:04,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:27:04,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:27:04,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:27:04,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:27:04,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:27:04,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:27:04,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:27:04,446 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:27:04,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:27:04,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:27:04,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:27:04,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:27:04,447 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:27:04,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:27:04,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:27:04,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:27:04,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:27:04,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:27:04,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:27:04,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:27:04,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:27:04,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:27:04,448 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:27:04,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:27:04,448 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:27:04,448 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:27:04,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:27:04,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:27:04,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:27:04,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:27:04,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:27:04,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:27:04,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:27:04,449 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:27:04,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:27:04,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:27:04,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:27:04,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:27:04,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:27:04,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:27:04,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:27:04,450 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c3fe688d0e9a9929009fc24c8ef56c8fc1bfa15613131b287e178eb7d2f1f1e [2025-03-04 02:27:04,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:27:04,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:27:04,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:27:04,710 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:27:04,710 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:27:04,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c [2025-03-04 02:27:06,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb577b968/d8656debc5b74ebf8fbd7ea5f9385375/FLAG509232e66 [2025-03-04 02:27:06,224 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:27:06,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c [2025-03-04 02:27:06,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb577b968/d8656debc5b74ebf8fbd7ea5f9385375/FLAG509232e66 [2025-03-04 02:27:06,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb577b968/d8656debc5b74ebf8fbd7ea5f9385375 [2025-03-04 02:27:06,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:27:06,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:27:06,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:27:06,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:27:06,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:27:06,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b75528f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06, skipping insertion in model container [2025-03-04 02:27:06,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:27:06,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c[2722,2735] [2025-03-04 02:27:06,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:27:06,430 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:27:06,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c[2722,2735] [2025-03-04 02:27:06,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:27:06,461 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:27:06,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06 WrapperNode [2025-03-04 02:27:06,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:27:06,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:27:06,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:27:06,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:27:06,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,488 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 140 [2025-03-04 02:27:06,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:27:06,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:27:06,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:27:06,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:27:06,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,516 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 02:27:06,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:27:06,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:27:06,533 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:27:06,533 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:27:06,534 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06" (1/1) ... [2025-03-04 02:27:06,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:27:06,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:06,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:27:06,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:27:06,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:27:06,589 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:27:06,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:27:06,589 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:27:06,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:27:06,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:27:06,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:27:06,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:27:06,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:27:06,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:27:06,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:27:06,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:27:06,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:27:06,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:27:06,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:27:06,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:27:06,591 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:27:06,695 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:27:06,697 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:27:06,959 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:27:06,960 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:27:07,155 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:27:07,155 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:27:07,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:27:07 BoogieIcfgContainer [2025-03-04 02:27:07,157 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:27:07,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:27:07,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:27:07,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:27:07,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:27:06" (1/3) ... [2025-03-04 02:27:07,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0e73ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:27:07, skipping insertion in model container [2025-03-04 02:27:07,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:06" (2/3) ... [2025-03-04 02:27:07,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0e73ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:27:07, skipping insertion in model container [2025-03-04 02:27:07,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:27:07" (3/3) ... [2025-03-04 02:27:07,165 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2025-03-04 02:27:07,179 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:27:07,180 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-2.wvr.c that has 3 procedures, 25 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:27:07,180 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:27:07,219 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:27:07,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 70 flow [2025-03-04 02:27:07,278 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-03-04 02:27:07,279 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:27:07,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-03-04 02:27:07,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 70 flow [2025-03-04 02:27:07,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 62 flow [2025-03-04 02:27:07,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:27:07,310 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;@55a55213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:27:07,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:27:07,320 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:27:07,321 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-03-04 02:27:07,321 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:27:07,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:07,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:07,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:07,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:07,329 INFO L85 PathProgramCache]: Analyzing trace with hash -189895593, now seen corresponding path program 1 times [2025-03-04 02:27:07,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:07,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304151553] [2025-03-04 02:27:07,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:07,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:07,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:27:07,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:27:07,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:07,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:07,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:07,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304151553] [2025-03-04 02:27:07,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304151553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:07,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:07,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:27:07,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690221560] [2025-03-04 02:27:07,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:07,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:27:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:07,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:27:07,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:27:07,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:27:07,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:07,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:07,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:27:07,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:07,611 INFO L124 PetriNetUnfolderBase]: 87/178 cut-off events. [2025-03-04 02:27:07,613 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 02:27:07,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 178 events. 87/178 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 577 event pairs, 66 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 308. Up to 146 conditions per place. [2025-03-04 02:27:07,617 INFO L140 encePairwiseOnDemand]: 27/28 looper letters, 19 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2025-03-04 02:27:07,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 24 transitions, 98 flow [2025-03-04 02:27:07,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:27:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:27:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2025-03-04 02:27:07,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-03-04 02:27:07,629 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 62 flow. Second operand 2 states and 34 transitions. [2025-03-04 02:27:07,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 24 transitions, 98 flow [2025-03-04 02:27:07,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:27:07,635 INFO L231 Difference]: Finished difference. Result has 25 places, 24 transitions, 52 flow [2025-03-04 02:27:07,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=25, PETRI_TRANSITIONS=24} [2025-03-04 02:27:07,641 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2025-03-04 02:27:07,641 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 24 transitions, 52 flow [2025-03-04 02:27:07,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:07,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:07,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:07,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:27:07,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:07,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1823488905, now seen corresponding path program 1 times [2025-03-04 02:27:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:07,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295130689] [2025-03-04 02:27:07,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:07,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:07,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:27:07,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:27:07,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:07,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:07,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:07,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295130689] [2025-03-04 02:27:07,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295130689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:07,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:07,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:27:07,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735190931] [2025-03-04 02:27:07,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:07,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:27:07,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:07,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:27:07,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:27:07,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:27:07,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 24 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:07,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:07,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:27:07,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:07,969 INFO L124 PetriNetUnfolderBase]: 100/213 cut-off events. [2025-03-04 02:27:07,969 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:27:07,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 213 events. 100/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 740 event pairs, 79 based on Foata normal form. 17/215 useless extension candidates. Maximal degree in co-relation 402. Up to 146 conditions per place. [2025-03-04 02:27:07,971 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 18 selfloop transitions, 2 changer transitions 8/33 dead transitions. [2025-03-04 02:27:07,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 128 flow [2025-03-04 02:27:07,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:27:07,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:27:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-03-04 02:27:07,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2025-03-04 02:27:07,974 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 52 flow. Second operand 4 states and 59 transitions. [2025-03-04 02:27:07,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 128 flow [2025-03-04 02:27:07,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:27:07,976 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 70 flow [2025-03-04 02:27:07,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2025-03-04 02:27:07,977 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2025-03-04 02:27:07,977 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 70 flow [2025-03-04 02:27:07,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:07,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:07,978 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] [2025-03-04 02:27:07,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:27:07,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:07,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:07,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1995969320, now seen corresponding path program 1 times [2025-03-04 02:27:07,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:07,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916638584] [2025-03-04 02:27:07,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:07,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:07,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:27:08,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:27:08,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:08,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:08,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:08,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916638584] [2025-03-04 02:27:08,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916638584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:08,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:08,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:27:08,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804952726] [2025-03-04 02:27:08,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:08,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:27:08,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:08,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:27:08,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:27:08,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:27:08,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 70 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:08,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:08,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:27:08,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:08,473 INFO L124 PetriNetUnfolderBase]: 229/426 cut-off events. [2025-03-04 02:27:08,473 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 02:27:08,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 426 events. 229/426 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1777 event pairs, 63 based on Foata normal form. 1/425 useless extension candidates. Maximal degree in co-relation 943. Up to 155 conditions per place. [2025-03-04 02:27:08,478 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 46 selfloop transitions, 9 changer transitions 7/65 dead transitions. [2025-03-04 02:27:08,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 65 transitions, 301 flow [2025-03-04 02:27:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:27:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:27:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-03-04 02:27:08,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2025-03-04 02:27:08,479 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 70 flow. Second operand 8 states and 102 transitions. [2025-03-04 02:27:08,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 65 transitions, 301 flow [2025-03-04 02:27:08,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 65 transitions, 297 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:27:08,481 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 124 flow [2025-03-04 02:27:08,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2025-03-04 02:27:08,482 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 11 predicate places. [2025-03-04 02:27:08,482 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 124 flow [2025-03-04 02:27:08,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:08,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:08,482 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] [2025-03-04 02:27:08,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:27:08,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:08,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:08,484 INFO L85 PathProgramCache]: Analyzing trace with hash -270420168, now seen corresponding path program 2 times [2025-03-04 02:27:08,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:08,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297930801] [2025-03-04 02:27:08,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:08,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:08,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:27:08,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-03-04 02:27:08,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:27:08,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:08,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:08,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297930801] [2025-03-04 02:27:08,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297930801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:08,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:08,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:27:08,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304656463] [2025-03-04 02:27:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:08,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:27:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:08,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:27:08,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:27:08,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:27:08,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:08,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:08,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:27:08,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:08,606 INFO L124 PetriNetUnfolderBase]: 145/307 cut-off events. [2025-03-04 02:27:08,606 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2025-03-04 02:27:08,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 307 events. 145/307 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1172 event pairs, 39 based on Foata normal form. 6/309 useless extension candidates. Maximal degree in co-relation 796. Up to 214 conditions per place. [2025-03-04 02:27:08,612 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 26 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2025-03-04 02:27:08,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 195 flow [2025-03-04 02:27:08,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:27:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:27:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-04 02:27:08,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 02:27:08,613 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 124 flow. Second operand 3 states and 48 transitions. [2025-03-04 02:27:08,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 195 flow [2025-03-04 02:27:08,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 185 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 02:27:08,615 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 133 flow [2025-03-04 02:27:08,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-03-04 02:27:08,616 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 10 predicate places. [2025-03-04 02:27:08,616 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 133 flow [2025-03-04 02:27:08,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:08,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:08,618 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] [2025-03-04 02:27:08,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:27:08,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:08,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:08,619 INFO L85 PathProgramCache]: Analyzing trace with hash -390191661, now seen corresponding path program 1 times [2025-03-04 02:27:08,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:08,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332981308] [2025-03-04 02:27:08,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:08,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:08,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:27:08,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:27:08,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:08,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:08,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:08,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332981308] [2025-03-04 02:27:08,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332981308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:08,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248548229] [2025-03-04 02:27:08,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:08,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:08,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:08,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:08,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:27:08,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:27:08,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:27:08,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:08,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:08,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:27:08,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:08,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:09,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248548229] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:09,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:09,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 02:27:09,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707940978] [2025-03-04 02:27:09,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:09,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:27:09,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:09,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:27:09,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:27:09,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:27:09,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 133 flow. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:09,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:09,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:27:09,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:09,175 INFO L124 PetriNetUnfolderBase]: 238/534 cut-off events. [2025-03-04 02:27:09,175 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2025-03-04 02:27:09,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 534 events. 238/534 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2548 event pairs, 137 based on Foata normal form. 24/549 useless extension candidates. Maximal degree in co-relation 1460. Up to 248 conditions per place. [2025-03-04 02:27:09,179 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 41 selfloop transitions, 5 changer transitions 4/58 dead transitions. [2025-03-04 02:27:09,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 325 flow [2025-03-04 02:27:09,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:27:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:27:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-03-04 02:27:09,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-03-04 02:27:09,182 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 133 flow. Second operand 6 states and 87 transitions. [2025-03-04 02:27:09,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 325 flow [2025-03-04 02:27:09,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 304 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 02:27:09,185 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 161 flow [2025-03-04 02:27:09,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2025-03-04 02:27:09,186 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 16 predicate places. [2025-03-04 02:27:09,186 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 161 flow [2025-03-04 02:27:09,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:09,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:09,186 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:09,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:09,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:09,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:09,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:09,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2144946727, now seen corresponding path program 1 times [2025-03-04 02:27:09,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:09,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071046473] [2025-03-04 02:27:09,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:09,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:27:09,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:27:09,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:09,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:09,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:09,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071046473] [2025-03-04 02:27:09,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071046473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:09,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188849635] [2025-03-04 02:27:09,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:09,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:09,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:09,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:09,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:27:09,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:27:09,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:27:09,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:09,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:09,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:27:09,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:09,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:27:09,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188849635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:09,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:27:09,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-04 02:27:09,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569761416] [2025-03-04 02:27:09,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:09,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:27:09,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:09,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:27:09,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:27:09,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:27:09,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:09,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:09,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:27:09,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:09,770 INFO L124 PetriNetUnfolderBase]: 257/596 cut-off events. [2025-03-04 02:27:09,770 INFO L125 PetriNetUnfolderBase]: For 415/430 co-relation queries the response was YES. [2025-03-04 02:27:09,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 596 events. 257/596 cut-off events. For 415/430 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2953 event pairs, 64 based on Foata normal form. 21/609 useless extension candidates. Maximal degree in co-relation 1538. Up to 171 conditions per place. [2025-03-04 02:27:09,775 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 44 selfloop transitions, 7 changer transitions 5/63 dead transitions. [2025-03-04 02:27:09,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 359 flow [2025-03-04 02:27:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:27:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:27:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-03-04 02:27:09,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2025-03-04 02:27:09,777 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 161 flow. Second operand 4 states and 75 transitions. [2025-03-04 02:27:09,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 359 flow [2025-03-04 02:27:09,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 336 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-03-04 02:27:09,783 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 166 flow [2025-03-04 02:27:09,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2025-03-04 02:27:09,784 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 18 predicate places. [2025-03-04 02:27:09,784 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 166 flow [2025-03-04 02:27:09,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:09,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:09,784 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:09,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:09,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 02:27:09,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:09,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1157010328, now seen corresponding path program 2 times [2025-03-04 02:27:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:09,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505173165] [2025-03-04 02:27:09,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:09,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:27:10,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:27:10,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:10,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:10,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:10,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505173165] [2025-03-04 02:27:10,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505173165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:10,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980943574] [2025-03-04 02:27:10,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:10,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:10,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:10,578 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:10,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:27:10,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:27:10,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:27:10,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:10,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:10,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:27:10,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:10,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:10,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2025-03-04 02:27:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:10,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:11,153 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:27:11,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-04 02:27:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:11,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980943574] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:11,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:11,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-04 02:27:11,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250536908] [2025-03-04 02:27:11,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:11,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 02:27:11,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:11,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 02:27:11,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-03-04 02:27:11,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:27:11,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 166 flow. Second operand has 25 states, 25 states have (on average 6.48) internal successors, (162), 25 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:11,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:11,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:27:11,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:12,201 INFO L124 PetriNetUnfolderBase]: 855/1599 cut-off events. [2025-03-04 02:27:12,201 INFO L125 PetriNetUnfolderBase]: For 1877/1877 co-relation queries the response was YES. [2025-03-04 02:27:12,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4556 conditions, 1599 events. 855/1599 cut-off events. For 1877/1877 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8418 event pairs, 143 based on Foata normal form. 104/1699 useless extension candidates. Maximal degree in co-relation 4543. Up to 368 conditions per place. [2025-03-04 02:27:12,213 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 99 selfloop transitions, 23 changer transitions 15/139 dead transitions. [2025-03-04 02:27:12,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 139 transitions, 913 flow [2025-03-04 02:27:12,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:27:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:27:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 176 transitions. [2025-03-04 02:27:12,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2025-03-04 02:27:12,216 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 166 flow. Second operand 15 states and 176 transitions. [2025-03-04 02:27:12,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 139 transitions, 913 flow [2025-03-04 02:27:12,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 139 transitions, 849 flow, removed 32 selfloop flow, removed 2 redundant places. [2025-03-04 02:27:12,223 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 405 flow [2025-03-04 02:27:12,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=405, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2025-03-04 02:27:12,225 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 33 predicate places. [2025-03-04 02:27:12,227 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 405 flow [2025-03-04 02:27:12,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.48) internal successors, (162), 25 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:12,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:12,228 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:12,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:27:12,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:12,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:12,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash 517717748, now seen corresponding path program 3 times [2025-03-04 02:27:12,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:12,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782226344] [2025-03-04 02:27:12,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:27:12,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:12,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:27:12,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 24 statements. [2025-03-04 02:27:12,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:27:12,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:27:12,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:12,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782226344] [2025-03-04 02:27:12,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782226344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:12,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:12,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:27:12,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348234806] [2025-03-04 02:27:12,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:12,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:27:12,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:12,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:27:12,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:27:12,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:27:12,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:12,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:12,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:27:12,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:12,742 INFO L124 PetriNetUnfolderBase]: 523/1055 cut-off events. [2025-03-04 02:27:12,742 INFO L125 PetriNetUnfolderBase]: For 2881/2881 co-relation queries the response was YES. [2025-03-04 02:27:12,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3572 conditions, 1055 events. 523/1055 cut-off events. For 2881/2881 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5307 event pairs, 63 based on Foata normal form. 60/1110 useless extension candidates. Maximal degree in co-relation 3554. Up to 353 conditions per place. [2025-03-04 02:27:12,750 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 57 selfloop transitions, 18 changer transitions 0/80 dead transitions. [2025-03-04 02:27:12,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 80 transitions, 725 flow [2025-03-04 02:27:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:27:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:27:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2025-03-04 02:27:12,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2025-03-04 02:27:12,752 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 405 flow. Second operand 6 states and 73 transitions. [2025-03-04 02:27:12,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 80 transitions, 725 flow [2025-03-04 02:27:12,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 80 transitions, 616 flow, removed 49 selfloop flow, removed 7 redundant places. [2025-03-04 02:27:12,758 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 392 flow [2025-03-04 02:27:12,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=392, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2025-03-04 02:27:12,760 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 31 predicate places. [2025-03-04 02:27:12,760 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 392 flow [2025-03-04 02:27:12,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:12,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:12,760 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] [2025-03-04 02:27:12,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:27:12,760 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:12,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash 775773197, now seen corresponding path program 1 times [2025-03-04 02:27:12,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:12,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857431098] [2025-03-04 02:27:12,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:12,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:12,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:27:12,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:27:12,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:12,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:13,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:13,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857431098] [2025-03-04 02:27:13,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857431098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:13,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275826808] [2025-03-04 02:27:13,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:13,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:13,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:13,518 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:13,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:27:13,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:27:13,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:27:13,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:13,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:13,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 02:27:13,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:14,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:14,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:14,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-03-04 02:27:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:14,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275826808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:14,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:14,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2025-03-04 02:27:14,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299257787] [2025-03-04 02:27:14,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:14,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 02:27:14,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:14,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 02:27:14,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 02:27:14,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:27:14,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 392 flow. Second operand has 42 states, 42 states have (on average 4.785714285714286) internal successors, (201), 42 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:14,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:14,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:27:14,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:17,580 INFO L124 PetriNetUnfolderBase]: 1285/2362 cut-off events. [2025-03-04 02:27:17,581 INFO L125 PetriNetUnfolderBase]: For 4865/4865 co-relation queries the response was YES. [2025-03-04 02:27:17,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8073 conditions, 2362 events. 1285/2362 cut-off events. For 4865/4865 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13216 event pairs, 130 based on Foata normal form. 4/2366 useless extension candidates. Maximal degree in co-relation 8057. Up to 821 conditions per place. [2025-03-04 02:27:17,598 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 190 selfloop transitions, 71 changer transitions 53/315 dead transitions. [2025-03-04 02:27:17,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 315 transitions, 2218 flow [2025-03-04 02:27:17,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 02:27:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-04 02:27:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 410 transitions. [2025-03-04 02:27:17,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31832298136645965 [2025-03-04 02:27:17,602 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 392 flow. Second operand 46 states and 410 transitions. [2025-03-04 02:27:17,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 315 transitions, 2218 flow [2025-03-04 02:27:17,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 315 transitions, 2200 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-03-04 02:27:17,616 INFO L231 Difference]: Finished difference. Result has 127 places, 113 transitions, 1173 flow [2025-03-04 02:27:17,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1173, PETRI_PLACES=127, PETRI_TRANSITIONS=113} [2025-03-04 02:27:17,617 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 99 predicate places. [2025-03-04 02:27:17,617 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 113 transitions, 1173 flow [2025-03-04 02:27:17,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.785714285714286) internal successors, (201), 42 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:17,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:17,617 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] [2025-03-04 02:27:17,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:27:17,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:17,818 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:17,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:17,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1400263569, now seen corresponding path program 2 times [2025-03-04 02:27:17,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:17,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137097019] [2025-03-04 02:27:17,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:17,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:17,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:27:17,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:27:17,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:17,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:18,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:18,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137097019] [2025-03-04 02:27:18,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137097019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:18,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786601330] [2025-03-04 02:27:18,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:18,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:18,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:18,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:18,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:27:18,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:27:18,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:27:18,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:18,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:18,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 02:27:18,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:18,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-04 02:27:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:18,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:19,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:19,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-03-04 02:27:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:19,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786601330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:19,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:19,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2025-03-04 02:27:19,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832597719] [2025-03-04 02:27:19,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:19,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 02:27:19,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:19,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 02:27:19,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1464, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 02:27:19,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:27:19,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 113 transitions, 1173 flow. Second operand has 42 states, 42 states have (on average 4.738095238095238) internal successors, (199), 42 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:19,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:19,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:27:19,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:21,848 INFO L124 PetriNetUnfolderBase]: 1425/2653 cut-off events. [2025-03-04 02:27:21,849 INFO L125 PetriNetUnfolderBase]: For 12985/12985 co-relation queries the response was YES. [2025-03-04 02:27:21,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12064 conditions, 2653 events. 1425/2653 cut-off events. For 12985/12985 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 15354 event pairs, 200 based on Foata normal form. 3/2655 useless extension candidates. Maximal degree in co-relation 12024. Up to 1212 conditions per place. [2025-03-04 02:27:21,867 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 183 selfloop transitions, 143 changer transitions 56/383 dead transitions. [2025-03-04 02:27:21,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 383 transitions, 3573 flow [2025-03-04 02:27:21,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-04 02:27:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-03-04 02:27:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 474 transitions. [2025-03-04 02:27:21,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3022959183673469 [2025-03-04 02:27:21,869 INFO L175 Difference]: Start difference. First operand has 127 places, 113 transitions, 1173 flow. Second operand 56 states and 474 transitions. [2025-03-04 02:27:21,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 383 transitions, 3573 flow [2025-03-04 02:27:21,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 383 transitions, 3387 flow, removed 72 selfloop flow, removed 10 redundant places. [2025-03-04 02:27:21,901 INFO L231 Difference]: Finished difference. Result has 187 places, 187 transitions, 2322 flow [2025-03-04 02:27:21,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=2322, PETRI_PLACES=187, PETRI_TRANSITIONS=187} [2025-03-04 02:27:21,902 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 159 predicate places. [2025-03-04 02:27:21,902 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 187 transitions, 2322 flow [2025-03-04 02:27:21,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.738095238095238) internal successors, (199), 42 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:21,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:21,902 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] [2025-03-04 02:27:21,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:27:22,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 02:27:22,103 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:22,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:22,103 INFO L85 PathProgramCache]: Analyzing trace with hash 827862321, now seen corresponding path program 3 times [2025-03-04 02:27:22,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:22,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495010153] [2025-03-04 02:27:22,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:27:22,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:22,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:27:22,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:27:22,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:27:22,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:22,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495010153] [2025-03-04 02:27:22,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495010153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350945566] [2025-03-04 02:27:22,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:27:22,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:22,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:22,635 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:22,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:27:22,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:27:22,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:27:22,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:27:22,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:22,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 02:27:22,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:22,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2025-03-04 02:27:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:23,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:23,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:23,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-03-04 02:27:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:23,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350945566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:23,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:23,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2025-03-04 02:27:23,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837809161] [2025-03-04 02:27:23,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:23,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 02:27:23,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:23,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 02:27:23,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1510, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 02:27:23,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:27:23,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 187 transitions, 2322 flow. Second operand has 42 states, 42 states have (on average 4.785714285714286) internal successors, (201), 42 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:23,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:23,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:27:23,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:28,417 INFO L124 PetriNetUnfolderBase]: 1769/3306 cut-off events. [2025-03-04 02:27:28,417 INFO L125 PetriNetUnfolderBase]: For 27399/27399 co-relation queries the response was YES. [2025-03-04 02:27:28,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18820 conditions, 3306 events. 1769/3306 cut-off events. For 27399/27399 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 19972 event pairs, 136 based on Foata normal form. 3/3308 useless extension candidates. Maximal degree in co-relation 18760. Up to 648 conditions per place. [2025-03-04 02:27:28,445 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 272 selfloop transitions, 236 changer transitions 90/599 dead transitions. [2025-03-04 02:27:28,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 599 transitions, 7302 flow [2025-03-04 02:27:28,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-04 02:27:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2025-03-04 02:27:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 741 transitions. [2025-03-04 02:27:28,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29081632653061223 [2025-03-04 02:27:28,448 INFO L175 Difference]: Start difference. First operand has 187 places, 187 transitions, 2322 flow. Second operand 91 states and 741 transitions. [2025-03-04 02:27:28,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 599 transitions, 7302 flow [2025-03-04 02:27:28,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 599 transitions, 6879 flow, removed 129 selfloop flow, removed 24 redundant places. [2025-03-04 02:27:28,526 INFO L231 Difference]: Finished difference. Result has 265 places, 304 transitions, 4329 flow [2025-03-04 02:27:28,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2029, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=91, PETRI_FLOW=4329, PETRI_PLACES=265, PETRI_TRANSITIONS=304} [2025-03-04 02:27:28,527 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 237 predicate places. [2025-03-04 02:27:28,527 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 304 transitions, 4329 flow [2025-03-04 02:27:28,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.785714285714286) internal successors, (201), 42 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:28,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:28,527 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] [2025-03-04 02:27:28,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:28,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:28,728 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:28,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2091474505, now seen corresponding path program 4 times [2025-03-04 02:27:28,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:28,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598386593] [2025-03-04 02:27:28,729 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:27:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:28,734 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:27:28,745 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:27:28,745 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:27:28,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:29,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:29,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598386593] [2025-03-04 02:27:29,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598386593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:29,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007549036] [2025-03-04 02:27:29,216 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:27:29,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:29,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:29,218 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:29,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:27:29,259 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:27:29,273 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:27:29,274 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:27:29,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:29,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 02:27:29,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:29,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-04 02:27:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:29,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:29,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:29,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2025-03-04 02:27:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:30,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007549036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:30,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:30,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2025-03-04 02:27:30,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330689154] [2025-03-04 02:27:30,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:30,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 02:27:30,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:30,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 02:27:30,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1564, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 02:27:30,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:27:30,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 304 transitions, 4329 flow. Second operand has 43 states, 43 states have (on average 4.674418604651163) internal successors, (201), 43 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:30,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:30,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:27:30,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:32,230 INFO L124 PetriNetUnfolderBase]: 1739/3273 cut-off events. [2025-03-04 02:27:32,230 INFO L125 PetriNetUnfolderBase]: For 33142/33142 co-relation queries the response was YES. [2025-03-04 02:27:32,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20326 conditions, 3273 events. 1739/3273 cut-off events. For 33142/33142 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 19789 event pairs, 180 based on Foata normal form. 2/3274 useless extension candidates. Maximal degree in co-relation 20252. Up to 1550 conditions per place. [2025-03-04 02:27:32,270 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 279 selfloop transitions, 144 changer transitions 47/471 dead transitions. [2025-03-04 02:27:32,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 471 transitions, 7035 flow [2025-03-04 02:27:32,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 02:27:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-04 02:27:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 307 transitions. [2025-03-04 02:27:32,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29633204633204635 [2025-03-04 02:27:32,272 INFO L175 Difference]: Start difference. First operand has 265 places, 304 transitions, 4329 flow. Second operand 37 states and 307 transitions. [2025-03-04 02:27:32,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 471 transitions, 7035 flow [2025-03-04 02:27:32,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 471 transitions, 5799 flow, removed 537 selfloop flow, removed 43 redundant places. [2025-03-04 02:27:32,575 INFO L231 Difference]: Finished difference. Result has 248 places, 318 transitions, 4089 flow [2025-03-04 02:27:32,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3397, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=4089, PETRI_PLACES=248, PETRI_TRANSITIONS=318} [2025-03-04 02:27:32,576 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 220 predicate places. [2025-03-04 02:27:32,577 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 318 transitions, 4089 flow [2025-03-04 02:27:32,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.674418604651163) internal successors, (201), 43 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:32,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:32,578 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:32,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:32,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:32,778 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:32,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:32,779 INFO L85 PathProgramCache]: Analyzing trace with hash -682989036, now seen corresponding path program 5 times [2025-03-04 02:27:32,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:32,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606938747] [2025-03-04 02:27:32,779 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:27:32,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:32,784 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-04 02:27:32,803 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:27:32,803 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:27:32,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:33,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606938747] [2025-03-04 02:27:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606938747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80853896] [2025-03-04 02:27:33,444 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:27:33,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:33,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:33,446 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:33,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:27:33,492 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-04 02:27:33,513 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:27:33,513 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:27:33,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:33,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:27:33,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:33,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:33,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:33,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:33,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-03-04 02:27:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:33,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80853896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:33,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:33,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 10] total 34 [2025-03-04 02:27:33,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029733940] [2025-03-04 02:27:33,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:33,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 02:27:33,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:33,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 02:27:33,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1065, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 02:27:33,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:27:33,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 318 transitions, 4089 flow. Second operand has 35 states, 35 states have (on average 4.914285714285715) internal successors, (172), 35 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:33,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:33,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:27:33,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:34,958 INFO L124 PetriNetUnfolderBase]: 1743/3255 cut-off events. [2025-03-04 02:27:34,958 INFO L125 PetriNetUnfolderBase]: For 31755/31755 co-relation queries the response was YES. [2025-03-04 02:27:34,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19858 conditions, 3255 events. 1743/3255 cut-off events. For 31755/31755 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19459 event pairs, 248 based on Foata normal form. 1/3255 useless extension candidates. Maximal degree in co-relation 19792. Up to 1595 conditions per place. [2025-03-04 02:27:34,999 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 269 selfloop transitions, 137 changer transitions 15/422 dead transitions. [2025-03-04 02:27:34,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 422 transitions, 6105 flow [2025-03-04 02:27:35,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:27:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:27:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 181 transitions. [2025-03-04 02:27:35,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32321428571428573 [2025-03-04 02:27:35,001 INFO L175 Difference]: Start difference. First operand has 248 places, 318 transitions, 4089 flow. Second operand 20 states and 181 transitions. [2025-03-04 02:27:35,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 422 transitions, 6105 flow [2025-03-04 02:27:35,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 422 transitions, 5885 flow, removed 72 selfloop flow, removed 20 redundant places. [2025-03-04 02:27:35,136 INFO L231 Difference]: Finished difference. Result has 238 places, 332 transitions, 4590 flow [2025-03-04 02:27:35,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3922, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4590, PETRI_PLACES=238, PETRI_TRANSITIONS=332} [2025-03-04 02:27:35,137 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 210 predicate places. [2025-03-04 02:27:35,137 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 332 transitions, 4590 flow [2025-03-04 02:27:35,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.914285714285715) internal successors, (172), 35 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:35,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:35,138 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:35,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:35,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 02:27:35,338 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:35,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:35,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2139622708, now seen corresponding path program 6 times [2025-03-04 02:27:35,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:35,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129623805] [2025-03-04 02:27:35,339 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:27:35,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:35,346 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-03-04 02:27:35,374 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:27:35,377 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:27:35,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:35,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:35,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129623805] [2025-03-04 02:27:35,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129623805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:35,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751825254] [2025-03-04 02:27:35,561 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:27:35,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:35,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:35,562 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:35,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:27:35,600 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-03-04 02:27:35,616 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:27:35,616 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:27:35,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:35,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:27:35,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:35,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:35,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:35,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-03-04 02:27:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:35,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751825254] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:35,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:35,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 22 [2025-03-04 02:27:35,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557536075] [2025-03-04 02:27:35,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:35,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:27:35,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:35,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:27:35,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:27:35,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:27:35,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 332 transitions, 4590 flow. Second operand has 23 states, 23 states have (on average 5.130434782608695) internal successors, (118), 23 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:35,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:35,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:27:35,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:36,776 INFO L124 PetriNetUnfolderBase]: 1719/3207 cut-off events. [2025-03-04 02:27:36,776 INFO L125 PetriNetUnfolderBase]: For 34329/34329 co-relation queries the response was YES. [2025-03-04 02:27:36,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20355 conditions, 3207 events. 1719/3207 cut-off events. For 34329/34329 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19095 event pairs, 229 based on Foata normal form. 1/3207 useless extension candidates. Maximal degree in co-relation 20290. Up to 1596 conditions per place. [2025-03-04 02:27:36,797 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 229 selfloop transitions, 174 changer transitions 25/429 dead transitions. [2025-03-04 02:27:36,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 429 transitions, 6331 flow [2025-03-04 02:27:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:27:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:27:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 212 transitions. [2025-03-04 02:27:36,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32919254658385094 [2025-03-04 02:27:36,798 INFO L175 Difference]: Start difference. First operand has 238 places, 332 transitions, 4590 flow. Second operand 23 states and 212 transitions. [2025-03-04 02:27:36,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 429 transitions, 6331 flow [2025-03-04 02:27:36,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 429 transitions, 6267 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-03-04 02:27:36,920 INFO L231 Difference]: Finished difference. Result has 249 places, 337 transitions, 4935 flow [2025-03-04 02:27:36,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4530, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4935, PETRI_PLACES=249, PETRI_TRANSITIONS=337} [2025-03-04 02:27:36,920 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 221 predicate places. [2025-03-04 02:27:36,921 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 337 transitions, 4935 flow [2025-03-04 02:27:36,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.130434782608695) internal successors, (118), 23 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:36,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:36,921 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:36,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:37,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 02:27:37,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:37,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1188745354, now seen corresponding path program 7 times [2025-03-04 02:27:37,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:37,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66746341] [2025-03-04 02:27:37,126 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:27:37,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:37,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:27:37,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:27:37,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:37,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:37,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:37,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66746341] [2025-03-04 02:27:37,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66746341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:37,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56150919] [2025-03-04 02:27:37,689 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:27:37,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:37,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:37,692 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:37,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:27:37,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:27:37,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:27:37,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:37,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:37,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:27:37,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:38,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:38,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:38,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-03-04 02:27:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:38,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56150919] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:38,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:27:38,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16, 12] total 34 [2025-03-04 02:27:38,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78034301] [2025-03-04 02:27:38,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:38,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:27:38,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:38,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:27:38,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 02:27:38,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:27:38,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 337 transitions, 4935 flow. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:38,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:38,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:27:38,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:38,993 INFO L124 PetriNetUnfolderBase]: 1765/3286 cut-off events. [2025-03-04 02:27:38,993 INFO L125 PetriNetUnfolderBase]: For 36324/36324 co-relation queries the response was YES. [2025-03-04 02:27:39,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21743 conditions, 3286 events. 1765/3286 cut-off events. For 36324/36324 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 19660 event pairs, 258 based on Foata normal form. 1/3286 useless extension candidates. Maximal degree in co-relation 21678. Up to 1840 conditions per place. [2025-03-04 02:27:39,019 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 235 selfloop transitions, 181 changer transitions 16/433 dead transitions. [2025-03-04 02:27:39,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 433 transitions, 6874 flow [2025-03-04 02:27:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:27:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:27:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 168 transitions. [2025-03-04 02:27:39,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2025-03-04 02:27:39,020 INFO L175 Difference]: Start difference. First operand has 249 places, 337 transitions, 4935 flow. Second operand 17 states and 168 transitions. [2025-03-04 02:27:39,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 433 transitions, 6874 flow [2025-03-04 02:27:39,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 433 transitions, 6722 flow, removed 18 selfloop flow, removed 14 redundant places. [2025-03-04 02:27:39,161 INFO L231 Difference]: Finished difference. Result has 252 places, 356 transitions, 5712 flow [2025-03-04 02:27:39,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4811, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5712, PETRI_PLACES=252, PETRI_TRANSITIONS=356} [2025-03-04 02:27:39,162 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 224 predicate places. [2025-03-04 02:27:39,162 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 356 transitions, 5712 flow [2025-03-04 02:27:39,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:39,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:39,162 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:39,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:39,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 02:27:39,363 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:39,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash -976611238, now seen corresponding path program 8 times [2025-03-04 02:27:39,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:39,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291153726] [2025-03-04 02:27:39,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:39,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:39,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:27:39,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:27:39,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:39,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:39,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291153726] [2025-03-04 02:27:39,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291153726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271946085] [2025-03-04 02:27:39,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:39,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:39,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:39,622 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:39,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:27:39,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:27:39,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:27:39,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:39,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:39,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 02:27:39,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:39,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:39,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:39,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-03-04 02:27:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:39,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271946085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:39,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:39,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 22 [2025-03-04 02:27:39,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510951187] [2025-03-04 02:27:39,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:39,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:27:39,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:39,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:27:39,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:27:39,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:27:39,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 356 transitions, 5712 flow. Second operand has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:39,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:39,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:27:39,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:40,631 INFO L124 PetriNetUnfolderBase]: 1823/3382 cut-off events. [2025-03-04 02:27:40,631 INFO L125 PetriNetUnfolderBase]: For 46499/46499 co-relation queries the response was YES. [2025-03-04 02:27:40,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23920 conditions, 3382 events. 1823/3382 cut-off events. For 46499/46499 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 20393 event pairs, 262 based on Foata normal form. 1/3382 useless extension candidates. Maximal degree in co-relation 23850. Up to 2085 conditions per place. [2025-03-04 02:27:40,657 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 249 selfloop transitions, 159 changer transitions 26/435 dead transitions. [2025-03-04 02:27:40,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 435 transitions, 7385 flow [2025-03-04 02:27:40,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:27:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:27:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 162 transitions. [2025-03-04 02:27:40,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2025-03-04 02:27:40,658 INFO L175 Difference]: Start difference. First operand has 252 places, 356 transitions, 5712 flow. Second operand 18 states and 162 transitions. [2025-03-04 02:27:40,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 435 transitions, 7385 flow [2025-03-04 02:27:40,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 435 transitions, 7179 flow, removed 53 selfloop flow, removed 8 redundant places. [2025-03-04 02:27:40,838 INFO L231 Difference]: Finished difference. Result has 263 places, 362 transitions, 6197 flow [2025-03-04 02:27:40,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5532, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6197, PETRI_PLACES=263, PETRI_TRANSITIONS=362} [2025-03-04 02:27:40,839 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 235 predicate places. [2025-03-04 02:27:40,839 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 362 transitions, 6197 flow [2025-03-04 02:27:40,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:40,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:40,839 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:40,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 02:27:41,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:27:41,040 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:41,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:41,040 INFO L85 PathProgramCache]: Analyzing trace with hash -84188354, now seen corresponding path program 9 times [2025-03-04 02:27:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:41,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103689846] [2025-03-04 02:27:41,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:27:41,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:41,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-04 02:27:41,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-04 02:27:41,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:27:41,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:41,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:41,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103689846] [2025-03-04 02:27:41,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103689846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:41,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:41,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:27:41,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569166305] [2025-03-04 02:27:41,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:41,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:27:41,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:41,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:27:41,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:27:41,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:27:41,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 362 transitions, 6197 flow. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:41,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:41,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:27:41,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:41,808 INFO L124 PetriNetUnfolderBase]: 1607/3140 cut-off events. [2025-03-04 02:27:41,808 INFO L125 PetriNetUnfolderBase]: For 46756/46823 co-relation queries the response was YES. [2025-03-04 02:27:41,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23157 conditions, 3140 events. 1607/3140 cut-off events. For 46756/46823 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 19724 event pairs, 287 based on Foata normal form. 9/3139 useless extension candidates. Maximal degree in co-relation 23086. Up to 2633 conditions per place. [2025-03-04 02:27:41,840 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 315 selfloop transitions, 23 changer transitions 17/404 dead transitions. [2025-03-04 02:27:41,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 404 transitions, 7369 flow [2025-03-04 02:27:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:27:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:27:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2025-03-04 02:27:41,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2025-03-04 02:27:41,841 INFO L175 Difference]: Start difference. First operand has 263 places, 362 transitions, 6197 flow. Second operand 12 states and 117 transitions. [2025-03-04 02:27:41,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 404 transitions, 7369 flow [2025-03-04 02:27:42,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 404 transitions, 7331 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-03-04 02:27:42,018 INFO L231 Difference]: Finished difference. Result has 263 places, 365 transitions, 6310 flow [2025-03-04 02:27:42,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6161, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6310, PETRI_PLACES=263, PETRI_TRANSITIONS=365} [2025-03-04 02:27:42,018 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 235 predicate places. [2025-03-04 02:27:42,018 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 365 transitions, 6310 flow [2025-03-04 02:27:42,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:42,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:42,019 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:42,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:27:42,019 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:42,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash 975995886, now seen corresponding path program 10 times [2025-03-04 02:27:42,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:42,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917822864] [2025-03-04 02:27:42,019 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:27:42,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:42,028 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:27:42,034 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:27:42,034 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:27:42,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:42,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:42,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917822864] [2025-03-04 02:27:42,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917822864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:42,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712452900] [2025-03-04 02:27:42,124 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:27:42,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:42,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:42,128 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:42,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:27:42,195 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:27:42,215 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:27:42,215 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:27:42,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:42,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:27:42,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:27:42,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:27:42,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712452900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:42,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:42,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 6] total 15 [2025-03-04 02:27:42,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879998943] [2025-03-04 02:27:42,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:42,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:27:42,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:42,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:27:42,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:27:42,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:27:42,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 365 transitions, 6310 flow. Second operand has 16 states, 16 states have (on average 10.625) internal successors, (170), 16 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:42,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:42,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:27:42,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:43,051 INFO L124 PetriNetUnfolderBase]: 1634/3473 cut-off events. [2025-03-04 02:27:43,051 INFO L125 PetriNetUnfolderBase]: For 57818/58010 co-relation queries the response was YES. [2025-03-04 02:27:43,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27041 conditions, 3473 events. 1634/3473 cut-off events. For 57818/58010 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 24678 event pairs, 157 based on Foata normal form. 130/3524 useless extension candidates. Maximal degree in co-relation 26967. Up to 569 conditions per place. [2025-03-04 02:27:43,083 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 189 selfloop transitions, 70 changer transitions 142/489 dead transitions. [2025-03-04 02:27:43,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 489 transitions, 8516 flow [2025-03-04 02:27:43,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:27:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:27:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 241 transitions. [2025-03-04 02:27:43,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5379464285714286 [2025-03-04 02:27:43,084 INFO L175 Difference]: Start difference. First operand has 263 places, 365 transitions, 6310 flow. Second operand 16 states and 241 transitions. [2025-03-04 02:27:43,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 489 transitions, 8516 flow [2025-03-04 02:27:43,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 489 transitions, 8440 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-03-04 02:27:43,283 INFO L231 Difference]: Finished difference. Result has 267 places, 260 transitions, 4952 flow [2025-03-04 02:27:43,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5989, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4952, PETRI_PLACES=267, PETRI_TRANSITIONS=260} [2025-03-04 02:27:43,284 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 239 predicate places. [2025-03-04 02:27:43,284 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 260 transitions, 4952 flow [2025-03-04 02:27:43,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.625) internal successors, (170), 16 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:43,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:43,284 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:43,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 02:27:43,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 02:27:43,485 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:43,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:43,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1465261886, now seen corresponding path program 11 times [2025-03-04 02:27:43,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:43,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729913422] [2025-03-04 02:27:43,485 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:27:43,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:43,492 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:27:43,502 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:27:43,502 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:43,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:43,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:43,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729913422] [2025-03-04 02:27:43,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729913422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:43,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865959318] [2025-03-04 02:27:43,582 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:27:43,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:43,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:43,585 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:43,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:27:43,637 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:27:43,653 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:27:43,654 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:43,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:43,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:27:43,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:43,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:43,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865959318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:43,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:43,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-03-04 02:27:43,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014518153] [2025-03-04 02:27:43,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:43,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:27:43,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:43,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:27:43,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:27:43,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:27:43,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 260 transitions, 4952 flow. Second operand has 22 states, 22 states have (on average 9.590909090909092) internal successors, (211), 22 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:43,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:43,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:27:43,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:44,376 INFO L124 PetriNetUnfolderBase]: 1238/2487 cut-off events. [2025-03-04 02:27:44,376 INFO L125 PetriNetUnfolderBase]: For 44660/44828 co-relation queries the response was YES. [2025-03-04 02:27:44,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20801 conditions, 2487 events. 1238/2487 cut-off events. For 44660/44828 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15396 event pairs, 170 based on Foata normal form. 32/2477 useless extension candidates. Maximal degree in co-relation 20729. Up to 1594 conditions per place. [2025-03-04 02:27:44,404 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 131 selfloop transitions, 6 changer transitions 57/259 dead transitions. [2025-03-04 02:27:44,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 259 transitions, 5171 flow [2025-03-04 02:27:44,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:27:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:27:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2025-03-04 02:27:44,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2025-03-04 02:27:44,405 INFO L175 Difference]: Start difference. First operand has 267 places, 260 transitions, 4952 flow. Second operand 10 states and 122 transitions. [2025-03-04 02:27:44,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 259 transitions, 5171 flow [2025-03-04 02:27:44,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 259 transitions, 4425 flow, removed 115 selfloop flow, removed 33 redundant places. [2025-03-04 02:27:44,521 INFO L231 Difference]: Finished difference. Result has 186 places, 198 transitions, 3429 flow [2025-03-04 02:27:44,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3915, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3429, PETRI_PLACES=186, PETRI_TRANSITIONS=198} [2025-03-04 02:27:44,521 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 158 predicate places. [2025-03-04 02:27:44,522 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 198 transitions, 3429 flow [2025-03-04 02:27:44,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.590909090909092) internal successors, (211), 22 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:44,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:44,522 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:44,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 02:27:44,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:44,722 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:44,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:44,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2021545939, now seen corresponding path program 12 times [2025-03-04 02:27:44,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:44,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550475108] [2025-03-04 02:27:44,723 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:27:44,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:44,732 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 3 equivalence classes. [2025-03-04 02:27:44,745 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:27:44,746 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:27:44,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:44,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:44,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550475108] [2025-03-04 02:27:44,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550475108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:44,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930161607] [2025-03-04 02:27:44,837 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:27:44,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:44,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:44,840 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:44,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:27:44,880 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 3 equivalence classes. [2025-03-04 02:27:44,895 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:27:44,895 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:27:44,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:44,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:27:44,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:45,098 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:27:45,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-03-04 02:27:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:45,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:45,196 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-04 02:27:45,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2025-03-04 02:27:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:45,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930161607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:45,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:45,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 27 [2025-03-04 02:27:45,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769205766] [2025-03-04 02:27:45,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:45,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 02:27:45,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:45,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 02:27:45,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2025-03-04 02:27:45,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:27:45,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 198 transitions, 3429 flow. Second operand has 28 states, 28 states have (on average 6.785714285714286) internal successors, (190), 28 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:45,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:45,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:27:45,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:48,887 INFO L124 PetriNetUnfolderBase]: 6657/11648 cut-off events. [2025-03-04 02:27:48,887 INFO L125 PetriNetUnfolderBase]: For 156679/156679 co-relation queries the response was YES. [2025-03-04 02:27:48,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88039 conditions, 11648 events. 6657/11648 cut-off events. For 156679/156679 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 76649 event pairs, 320 based on Foata normal form. 755/12402 useless extension candidates. Maximal degree in co-relation 87986. Up to 2535 conditions per place. [2025-03-04 02:27:48,991 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 1288 selfloop transitions, 451 changer transitions 15/1769 dead transitions. [2025-03-04 02:27:48,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 1769 transitions, 33086 flow [2025-03-04 02:27:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-04 02:27:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-03-04 02:27:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 908 transitions. [2025-03-04 02:27:48,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.463265306122449 [2025-03-04 02:27:48,992 INFO L175 Difference]: Start difference. First operand has 186 places, 198 transitions, 3429 flow. Second operand 70 states and 908 transitions. [2025-03-04 02:27:48,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 1769 transitions, 33086 flow [2025-03-04 02:27:49,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 1769 transitions, 31657 flow, removed 206 selfloop flow, removed 17 redundant places. [2025-03-04 02:27:49,561 INFO L231 Difference]: Finished difference. Result has 259 places, 626 transitions, 14444 flow [2025-03-04 02:27:49,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3200, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=14444, PETRI_PLACES=259, PETRI_TRANSITIONS=626} [2025-03-04 02:27:49,562 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 231 predicate places. [2025-03-04 02:27:49,562 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 626 transitions, 14444 flow [2025-03-04 02:27:49,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.785714285714286) internal successors, (190), 28 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:49,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:49,562 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:49,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:49,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:49,762 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:49,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:49,763 INFO L85 PathProgramCache]: Analyzing trace with hash -501021980, now seen corresponding path program 13 times [2025-03-04 02:27:49,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:49,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742888191] [2025-03-04 02:27:49,763 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:27:49,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:49,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:27:49,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:27:49,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:49,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:50,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:50,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742888191] [2025-03-04 02:27:50,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742888191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:50,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421789814] [2025-03-04 02:27:50,610 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:27:50,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:50,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:50,612 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:50,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:27:50,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:27:50,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:27:50,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:50,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:50,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 02:27:50,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:51,385 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:51,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:51,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:51,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 53 [2025-03-04 02:27:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:52,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421789814] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:52,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:52,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 57 [2025-03-04 02:27:52,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779459581] [2025-03-04 02:27:52,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:52,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-04 02:27:52,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:52,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-04 02:27:52,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=2954, Unknown=0, NotChecked=0, Total=3306 [2025-03-04 02:27:52,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:27:52,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 626 transitions, 14444 flow. Second operand has 58 states, 58 states have (on average 4.655172413793103) internal successors, (270), 58 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:52,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:52,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:27:52,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:19,626 INFO L124 PetriNetUnfolderBase]: 26340/44935 cut-off events. [2025-03-04 02:28:19,626 INFO L125 PetriNetUnfolderBase]: For 2776709/2776709 co-relation queries the response was YES. [2025-03-04 02:28:20,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454439 conditions, 44935 events. 26340/44935 cut-off events. For 2776709/2776709 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 353304 event pairs, 1007 based on Foata normal form. 211/45145 useless extension candidates. Maximal degree in co-relation 454337. Up to 9233 conditions per place. [2025-03-04 02:28:20,613 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 1164 selfloop transitions, 2722 changer transitions 530/4417 dead transitions. [2025-03-04 02:28:20,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 4417 transitions, 103264 flow [2025-03-04 02:28:20,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2025-03-04 02:28:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2025-03-04 02:28:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1893 transitions. [2025-03-04 02:28:20,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30047619047619045 [2025-03-04 02:28:20,616 INFO L175 Difference]: Start difference. First operand has 259 places, 626 transitions, 14444 flow. Second operand 225 states and 1893 transitions. [2025-03-04 02:28:20,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 4417 transitions, 103264 flow