./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/chl-array-int-trans.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 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:28:49,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:28:49,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:28:49,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:28:49,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:28:49,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:28:49,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:28:49,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:28:49,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:28:49,345 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:28:49,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:28:49,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:28:49,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:28:49,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:28:49,346 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:28:49,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:28:49,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:28:49,347 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:28:49,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:28:49,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:28:49,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:28:49,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:28:49,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:28:49,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:28:49,347 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:28:49,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:28:49,347 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:28:49,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:28:49,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:28:49,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:28:49,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:28:49,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:28:49,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:28:49,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:28:49,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:28:49,349 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:28:49,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:28:49,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:28:49,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:28:49,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:28:49,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:28:49,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:28:49,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:28:49,349 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 -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2025-03-08 17:28:49,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:28:49,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:28:49,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:28:49,554 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:28:49,554 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:28:49,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-03-08 17:28:50,614 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab2c89c0/acb10f81ad374ef2bce8d9297b5f8f49/FLAGb982c954c [2025-03-08 17:28:50,843 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:28:50,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-03-08 17:28:50,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab2c89c0/acb10f81ad374ef2bce8d9297b5f8f49/FLAGb982c954c [2025-03-08 17:28:51,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab2c89c0/acb10f81ad374ef2bce8d9297b5f8f49 [2025-03-08 17:28:51,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:28:51,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:28:51,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:28:51,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:28:51,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:28:51,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43dc9e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51, skipping insertion in model container [2025-03-08 17:28:51,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:28:51,296 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/chl-array-int-trans.wvr.c[2767,2780] [2025-03-08 17:28:51,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:28:51,313 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:28:51,326 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/chl-array-int-trans.wvr.c[2767,2780] [2025-03-08 17:28:51,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:28:51,337 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:28:51,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51 WrapperNode [2025-03-08 17:28:51,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:28:51,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:28:51,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:28:51,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:28:51,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,373 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 13, calls inlined = 21, statements flattened = 252 [2025-03-08 17:28:51,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:28:51,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:28:51,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:28:51,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:28:51,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,395 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-08 17:28:51,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,404 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:28:51,408 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:28:51,408 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:28:51,408 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:28:51,409 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51" (1/1) ... [2025-03-08 17:28:51,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:28:51,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:51,430 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-08 17:28:51,432 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-08 17:28:51,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:28:51,446 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:28:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:28:51,446 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:28:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:28:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:28:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:28:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:28:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:28:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:28:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:28:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:28:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:28:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:28:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:28:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:28:51,448 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:28:51,525 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:28:51,526 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:28:51,792 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:28:51,792 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:28:52,044 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:28:52,044 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:28:52,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:52 BoogieIcfgContainer [2025-03-08 17:28:52,044 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:28:52,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:28:52,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:28:52,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:28:52,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:28:51" (1/3) ... [2025-03-08 17:28:52,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e355fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:52, skipping insertion in model container [2025-03-08 17:28:52,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51" (2/3) ... [2025-03-08 17:28:52,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e355fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:52, skipping insertion in model container [2025-03-08 17:28:52,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:52" (3/3) ... [2025-03-08 17:28:52,052 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2025-03-08 17:28:52,062 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:28:52,063 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 17:28:52,063 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:28:52,107 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:28:52,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 101 flow [2025-03-08 17:28:52,156 INFO L124 PetriNetUnfolderBase]: 9/37 cut-off events. [2025-03-08 17:28:52,159 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:28:52,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 9/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-08 17:28:52,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 40 transitions, 101 flow [2025-03-08 17:28:52,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 36 transitions, 90 flow [2025-03-08 17:28:52,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:28:52,185 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;@7891b101, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:28:52,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:28:52,197 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:28:52,198 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2025-03-08 17:28:52,198 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:28:52,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:52,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:52,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:52,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:52,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2005823603, now seen corresponding path program 1 times [2025-03-08 17:28:52,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:52,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826985917] [2025-03-08 17:28:52,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:52,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:52,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:28:52,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:28:52,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:52,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:52,694 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-08 17:28:52,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:52,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826985917] [2025-03-08 17:28:52,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826985917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:52,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:52,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:28:52,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111348644] [2025-03-08 17:28:52,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:52,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:28:52,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:52,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:28:52,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:28:52,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:52,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 90 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:52,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:52,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:52,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:53,305 INFO L124 PetriNetUnfolderBase]: 2303/3290 cut-off events. [2025-03-08 17:28:53,305 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2025-03-08 17:28:53,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6662 conditions, 3290 events. 2303/3290 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 15563 event pairs, 337 based on Foata normal form. 1/2804 useless extension candidates. Maximal degree in co-relation 4076. Up to 1121 conditions per place. [2025-03-08 17:28:53,323 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 109 selfloop transitions, 17 changer transitions 2/132 dead transitions. [2025-03-08 17:28:53,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 132 transitions, 592 flow [2025-03-08 17:28:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:28:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:28:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2025-03-08 17:28:53,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4681818181818182 [2025-03-08 17:28:53,335 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 90 flow. Second operand 11 states and 206 transitions. [2025-03-08 17:28:53,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 132 transitions, 592 flow [2025-03-08 17:28:53,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 132 transitions, 544 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:28:53,350 INFO L231 Difference]: Finished difference. Result has 45 places, 53 transitions, 183 flow [2025-03-08 17:28:53,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=183, PETRI_PLACES=45, PETRI_TRANSITIONS=53} [2025-03-08 17:28:53,354 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2025-03-08 17:28:53,355 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 53 transitions, 183 flow [2025-03-08 17:28:53,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:53,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:53,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:53,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:28:53,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:53,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:53,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1951479733, now seen corresponding path program 2 times [2025-03-08 17:28:53,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:53,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985835124] [2025-03-08 17:28:53,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:28:53,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:53,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:28:53,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:28:53,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:28:53,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:53,558 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-08 17:28:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:53,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985835124] [2025-03-08 17:28:53,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985835124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:53,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:53,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:28:53,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110145762] [2025-03-08 17:28:53,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:53,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:28:53,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:53,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:28:53,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:28:53,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:53,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 53 transitions, 183 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:53,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:53,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:53,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:54,046 INFO L124 PetriNetUnfolderBase]: 2505/3632 cut-off events. [2025-03-08 17:28:54,047 INFO L125 PetriNetUnfolderBase]: For 502/502 co-relation queries the response was YES. [2025-03-08 17:28:54,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7886 conditions, 3632 events. 2505/3632 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 18072 event pairs, 372 based on Foata normal form. 1/3461 useless extension candidates. Maximal degree in co-relation 5327. Up to 1093 conditions per place. [2025-03-08 17:28:54,060 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 111 selfloop transitions, 19 changer transitions 2/136 dead transitions. [2025-03-08 17:28:54,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 136 transitions, 650 flow [2025-03-08 17:28:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:28:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:28:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2025-03-08 17:28:54,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2025-03-08 17:28:54,062 INFO L175 Difference]: Start difference. First operand has 45 places, 53 transitions, 183 flow. Second operand 11 states and 208 transitions. [2025-03-08 17:28:54,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 136 transitions, 650 flow [2025-03-08 17:28:54,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 136 transitions, 644 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-08 17:28:54,064 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 249 flow [2025-03-08 17:28:54,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=45, 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=11, PETRI_FLOW=249, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2025-03-08 17:28:54,065 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 20 predicate places. [2025-03-08 17:28:54,065 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 249 flow [2025-03-08 17:28:54,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:54,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:54,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:54,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:28:54,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:54,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash 919361666, now seen corresponding path program 1 times [2025-03-08 17:28:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:54,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97810409] [2025-03-08 17:28:54,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:54,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:54,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:28:54,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:28:54,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:54,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:54,254 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-08 17:28:54,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97810409] [2025-03-08 17:28:54,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97810409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:54,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509271294] [2025-03-08 17:28:54,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:54,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:54,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:54,257 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-08 17:28:54,258 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-08 17:28:54,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:28:54,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:28:54,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:54,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:54,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 17:28:54,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:54,433 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-08 17:28:54,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:28:54,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509271294] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:54,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:28:54,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-03-08 17:28:54,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076967212] [2025-03-08 17:28:54,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:54,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:28:54,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:54,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:28:54,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-08 17:28:54,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:54,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:54,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:54,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:54,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:54,980 INFO L124 PetriNetUnfolderBase]: 3397/4906 cut-off events. [2025-03-08 17:28:54,981 INFO L125 PetriNetUnfolderBase]: For 2214/2214 co-relation queries the response was YES. [2025-03-08 17:28:54,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11308 conditions, 4906 events. 3397/4906 cut-off events. For 2214/2214 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 24631 event pairs, 1718 based on Foata normal form. 1/4664 useless extension candidates. Maximal degree in co-relation 8646. Up to 2127 conditions per place. [2025-03-08 17:28:54,997 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 113 selfloop transitions, 8 changer transitions 2/127 dead transitions. [2025-03-08 17:28:54,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 127 transitions, 704 flow [2025-03-08 17:28:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:28:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:28:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2025-03-08 17:28:54,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2025-03-08 17:28:54,999 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 249 flow. Second operand 7 states and 155 transitions. [2025-03-08 17:28:54,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 127 transitions, 704 flow [2025-03-08 17:28:55,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 679 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-08 17:28:55,003 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 274 flow [2025-03-08 17:28:55,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2025-03-08 17:28:55,004 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2025-03-08 17:28:55,004 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 274 flow [2025-03-08 17:28:55,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:55,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:55,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:55,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:28:55,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:55,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:55,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1945271066, now seen corresponding path program 1 times [2025-03-08 17:28:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:55,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822471241] [2025-03-08 17:28:55,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:55,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:28:55,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:28:55,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:55,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:55,293 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-08 17:28:55,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:55,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822471241] [2025-03-08 17:28:55,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822471241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:55,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:55,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:28:55,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8841641] [2025-03-08 17:28:55,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:55,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:28:55,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:55,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:28:55,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:28:55,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:55,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:55,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:55,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:55,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:55,662 INFO L124 PetriNetUnfolderBase]: 3735/5543 cut-off events. [2025-03-08 17:28:55,663 INFO L125 PetriNetUnfolderBase]: For 3021/3021 co-relation queries the response was YES. [2025-03-08 17:28:55,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13508 conditions, 5543 events. 3735/5543 cut-off events. For 3021/3021 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 30381 event pairs, 1750 based on Foata normal form. 199/5731 useless extension candidates. Maximal degree in co-relation 9971. Up to 3408 conditions per place. [2025-03-08 17:28:55,712 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 92 selfloop transitions, 12 changer transitions 0/108 dead transitions. [2025-03-08 17:28:55,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 661 flow [2025-03-08 17:28:55,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:28:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:28:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-03-08 17:28:55,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53 [2025-03-08 17:28:55,715 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 274 flow. Second operand 5 states and 106 transitions. [2025-03-08 17:28:55,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 661 flow [2025-03-08 17:28:55,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 108 transitions, 650 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-08 17:28:55,726 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 339 flow [2025-03-08 17:28:55,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2025-03-08 17:28:55,727 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2025-03-08 17:28:55,727 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 339 flow [2025-03-08 17:28:55,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:55,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:55,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:55,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:28:55,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:55,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2006590404, now seen corresponding path program 1 times [2025-03-08 17:28:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:55,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893591104] [2025-03-08 17:28:55,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:55,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:55,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:28:55,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:28:55,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:55,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:55,815 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-08 17:28:55,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:55,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893591104] [2025-03-08 17:28:55,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893591104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:55,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:55,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:28:55,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008782725] [2025-03-08 17:28:55,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:55,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:28:55,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:55,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:28:55,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:28:55,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:55,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 339 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:55,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:55,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:55,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:56,169 INFO L124 PetriNetUnfolderBase]: 2448/3778 cut-off events. [2025-03-08 17:28:56,170 INFO L125 PetriNetUnfolderBase]: For 3012/3012 co-relation queries the response was YES. [2025-03-08 17:28:56,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9458 conditions, 3778 events. 2448/3778 cut-off events. For 3012/3012 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 21113 event pairs, 1050 based on Foata normal form. 172/3936 useless extension candidates. Maximal degree in co-relation 7273. Up to 1867 conditions per place. [2025-03-08 17:28:56,186 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 80 selfloop transitions, 9 changer transitions 3/96 dead transitions. [2025-03-08 17:28:56,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 96 transitions, 591 flow [2025-03-08 17:28:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:28:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:28:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-03-08 17:28:56,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2025-03-08 17:28:56,187 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 339 flow. Second operand 6 states and 122 transitions. [2025-03-08 17:28:56,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 96 transitions, 591 flow [2025-03-08 17:28:56,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 565 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-08 17:28:56,193 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 271 flow [2025-03-08 17:28:56,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2025-03-08 17:28:56,193 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2025-03-08 17:28:56,193 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 271 flow [2025-03-08 17:28:56,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:56,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:56,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:56,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:28:56,194 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:56,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1756744993, now seen corresponding path program 1 times [2025-03-08 17:28:56,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:56,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709579703] [2025-03-08 17:28:56,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:56,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:56,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 17:28:56,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:28:56,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:56,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:56,330 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-08 17:28:56,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:56,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709579703] [2025-03-08 17:28:56,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709579703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:56,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:56,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:28:56,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503077828] [2025-03-08 17:28:56,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:56,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:28:56,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:56,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:28:56,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:28:56,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:56,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 271 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:28:56,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:56,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:56,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:56,992 INFO L124 PetriNetUnfolderBase]: 6551/9777 cut-off events. [2025-03-08 17:28:56,992 INFO L125 PetriNetUnfolderBase]: For 6471/6471 co-relation queries the response was YES. [2025-03-08 17:28:57,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23608 conditions, 9777 events. 6551/9777 cut-off events. For 6471/6471 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 60683 event pairs, 2014 based on Foata normal form. 4/9450 useless extension candidates. Maximal degree in co-relation 20434. Up to 3015 conditions per place. [2025-03-08 17:28:57,028 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 143 selfloop transitions, 31 changer transitions 9/187 dead transitions. [2025-03-08 17:28:57,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 187 transitions, 1156 flow [2025-03-08 17:28:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:28:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:28:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2025-03-08 17:28:57,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58125 [2025-03-08 17:28:57,029 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 271 flow. Second operand 8 states and 186 transitions. [2025-03-08 17:28:57,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 187 transitions, 1156 flow [2025-03-08 17:28:57,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 187 transitions, 1125 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-08 17:28:57,040 INFO L231 Difference]: Finished difference. Result has 75 places, 85 transitions, 555 flow [2025-03-08 17:28:57,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=555, PETRI_PLACES=75, PETRI_TRANSITIONS=85} [2025-03-08 17:28:57,040 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2025-03-08 17:28:57,041 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 85 transitions, 555 flow [2025-03-08 17:28:57,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:28:57,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:57,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:57,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:28:57,041 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:57,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash -424824995, now seen corresponding path program 1 times [2025-03-08 17:28:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:57,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565550878] [2025-03-08 17:28:57,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:57,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:57,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 17:28:57,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:28:57,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:57,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:57,167 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-08 17:28:57,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:57,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565550878] [2025-03-08 17:28:57,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565550878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:57,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:57,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:28:57,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063127410] [2025-03-08 17:28:57,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:57,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:28:57,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:57,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:28:57,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:28:57,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:57,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 85 transitions, 555 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:28:57,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:57,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:57,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:57,951 INFO L124 PetriNetUnfolderBase]: 7200/10862 cut-off events. [2025-03-08 17:28:57,951 INFO L125 PetriNetUnfolderBase]: For 11059/11059 co-relation queries the response was YES. [2025-03-08 17:28:57,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29235 conditions, 10862 events. 7200/10862 cut-off events. For 11059/11059 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 70085 event pairs, 2623 based on Foata normal form. 4/10569 useless extension candidates. Maximal degree in co-relation 25558. Up to 5123 conditions per place. [2025-03-08 17:28:57,990 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 104 selfloop transitions, 8 changer transitions 67/183 dead transitions. [2025-03-08 17:28:57,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 183 transitions, 1322 flow [2025-03-08 17:28:57,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:28:57,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:28:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2025-03-08 17:28:57,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2025-03-08 17:28:57,992 INFO L175 Difference]: Start difference. First operand has 75 places, 85 transitions, 555 flow. Second operand 9 states and 188 transitions. [2025-03-08 17:28:57,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 183 transitions, 1322 flow [2025-03-08 17:28:58,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 183 transitions, 1316 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-08 17:28:58,018 INFO L231 Difference]: Finished difference. Result has 86 places, 77 transitions, 495 flow [2025-03-08 17:28:58,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=495, PETRI_PLACES=86, PETRI_TRANSITIONS=77} [2025-03-08 17:28:58,018 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 49 predicate places. [2025-03-08 17:28:58,018 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 495 flow [2025-03-08 17:28:58,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:28:58,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:58,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:58,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:28:58,019 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:58,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:58,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1750826491, now seen corresponding path program 2 times [2025-03-08 17:28:58,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:58,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105490682] [2025-03-08 17:28:58,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:28:58,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:58,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:28:58,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-08 17:28:58,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:28:58,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:58,117 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-08 17:28:58,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:58,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105490682] [2025-03-08 17:28:58,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105490682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:58,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:58,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:28:58,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214010685] [2025-03-08 17:28:58,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:58,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:28:58,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:58,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:28:58,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:28:58,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:58,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 77 transitions, 495 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:28:58,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:58,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:58,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:58,932 INFO L124 PetriNetUnfolderBase]: 8023/12034 cut-off events. [2025-03-08 17:28:58,932 INFO L125 PetriNetUnfolderBase]: For 15080/15080 co-relation queries the response was YES. [2025-03-08 17:28:58,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34213 conditions, 12034 events. 8023/12034 cut-off events. For 15080/15080 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 78064 event pairs, 2997 based on Foata normal form. 4/11742 useless extension candidates. Maximal degree in co-relation 34088. Up to 5123 conditions per place. [2025-03-08 17:28:58,972 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 126 selfloop transitions, 10 changer transitions 55/195 dead transitions. [2025-03-08 17:28:58,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 195 transitions, 1476 flow [2025-03-08 17:28:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:28:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:28:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2025-03-08 17:28:58,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5305555555555556 [2025-03-08 17:28:58,976 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 495 flow. Second operand 9 states and 191 transitions. [2025-03-08 17:28:58,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 195 transitions, 1476 flow [2025-03-08 17:28:59,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 195 transitions, 1403 flow, removed 28 selfloop flow, removed 8 redundant places. [2025-03-08 17:28:59,039 INFO L231 Difference]: Finished difference. Result has 86 places, 79 transitions, 506 flow [2025-03-08 17:28:59,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=506, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2025-03-08 17:28:59,039 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 49 predicate places. [2025-03-08 17:28:59,039 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 506 flow [2025-03-08 17:28:59,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:28:59,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:59,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:59,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:28:59,040 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:59,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1636684527, now seen corresponding path program 3 times [2025-03-08 17:28:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:59,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913731980] [2025-03-08 17:28:59,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:28:59,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:59,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:28:59,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-08 17:28:59,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:28:59,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:59,146 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-08 17:28:59,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:59,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913731980] [2025-03-08 17:28:59,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913731980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:59,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:59,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:28:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284623738] [2025-03-08 17:28:59,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:59,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:28:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:59,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:28:59,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:28:59,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:59,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 506 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:28:59,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:59,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:59,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:00,113 INFO L124 PetriNetUnfolderBase]: 7450/11212 cut-off events. [2025-03-08 17:29:00,113 INFO L125 PetriNetUnfolderBase]: For 14228/14228 co-relation queries the response was YES. [2025-03-08 17:29:00,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32461 conditions, 11212 events. 7450/11212 cut-off events. For 14228/14228 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 72085 event pairs, 3087 based on Foata normal form. 4/10917 useless extension candidates. Maximal degree in co-relation 32364. Up to 5123 conditions per place. [2025-03-08 17:29:00,154 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 102 selfloop transitions, 9 changer transitions 69/184 dead transitions. [2025-03-08 17:29:00,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 184 transitions, 1366 flow [2025-03-08 17:29:00,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:29:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:29:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2025-03-08 17:29:00,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-03-08 17:29:00,156 INFO L175 Difference]: Start difference. First operand has 86 places, 79 transitions, 506 flow. Second operand 9 states and 186 transitions. [2025-03-08 17:29:00,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 184 transitions, 1366 flow [2025-03-08 17:29:00,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 184 transitions, 1332 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-08 17:29:00,216 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 512 flow [2025-03-08 17:29:00,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=512, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2025-03-08 17:29:00,217 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 53 predicate places. [2025-03-08 17:29:00,217 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 512 flow [2025-03-08 17:29:00,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:29:00,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:00,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:00,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:29:00,218 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:00,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash -280356139, now seen corresponding path program 2 times [2025-03-08 17:29:00,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:00,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732528589] [2025-03-08 17:29:00,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:29:00,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:00,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:29:00,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-08 17:29:00,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:29:00,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:00,349 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-08 17:29:00,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:00,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732528589] [2025-03-08 17:29:00,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732528589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:00,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:00,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:29:00,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102208920] [2025-03-08 17:29:00,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:00,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:29:00,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:00,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:29:00,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:29:00,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:29:00,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 512 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:29:00,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:00,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:29:00,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:01,470 INFO L124 PetriNetUnfolderBase]: 8315/12464 cut-off events. [2025-03-08 17:29:01,471 INFO L125 PetriNetUnfolderBase]: For 16051/16051 co-relation queries the response was YES. [2025-03-08 17:29:01,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35050 conditions, 12464 events. 8315/12464 cut-off events. For 16051/16051 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 79924 event pairs, 2962 based on Foata normal form. 4/12040 useless extension candidates. Maximal degree in co-relation 34915. Up to 3958 conditions per place. [2025-03-08 17:29:01,511 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 171 selfloop transitions, 28 changer transitions 8/211 dead transitions. [2025-03-08 17:29:01,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 211 transitions, 1612 flow [2025-03-08 17:29:01,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:29:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:29:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2025-03-08 17:29:01,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.590625 [2025-03-08 17:29:01,512 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 512 flow. Second operand 8 states and 189 transitions. [2025-03-08 17:29:01,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 211 transitions, 1612 flow [2025-03-08 17:29:01,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 211 transitions, 1552 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-03-08 17:29:01,541 INFO L231 Difference]: Finished difference. Result has 91 places, 99 transitions, 783 flow [2025-03-08 17:29:01,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=783, PETRI_PLACES=91, PETRI_TRANSITIONS=99} [2025-03-08 17:29:01,542 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 54 predicate places. [2025-03-08 17:29:01,542 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 99 transitions, 783 flow [2025-03-08 17:29:01,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:29:01,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:01,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:01,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:29:01,543 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:01,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:01,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1422641487, now seen corresponding path program 3 times [2025-03-08 17:29:01,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:01,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607544840] [2025-03-08 17:29:01,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:29:01,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:01,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:29:01,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-08 17:29:01,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:29:01,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:01,639 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-08 17:29:01,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:01,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607544840] [2025-03-08 17:29:01,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607544840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:01,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:01,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:29:01,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813284639] [2025-03-08 17:29:01,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:01,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:29:01,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:01,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:29:01,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:29:01,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:29:01,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 99 transitions, 783 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:29:01,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:01,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:29:01,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:02,561 INFO L124 PetriNetUnfolderBase]: 8512/12912 cut-off events. [2025-03-08 17:29:02,561 INFO L125 PetriNetUnfolderBase]: For 24621/24621 co-relation queries the response was YES. [2025-03-08 17:29:02,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39846 conditions, 12912 events. 8512/12912 cut-off events. For 24621/24621 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 85182 event pairs, 1731 based on Foata normal form. 4/12478 useless extension candidates. Maximal degree in co-relation 36847. Up to 2811 conditions per place. [2025-03-08 17:29:02,603 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 192 selfloop transitions, 27 changer transitions 20/243 dead transitions. [2025-03-08 17:29:02,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 243 transitions, 2069 flow [2025-03-08 17:29:02,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:29:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:29:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2025-03-08 17:29:02,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-03-08 17:29:02,604 INFO L175 Difference]: Start difference. First operand has 91 places, 99 transitions, 783 flow. Second operand 9 states and 207 transitions. [2025-03-08 17:29:02,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 243 transitions, 2069 flow [2025-03-08 17:29:02,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 243 transitions, 2055 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-08 17:29:02,663 INFO L231 Difference]: Finished difference. Result has 102 places, 107 transitions, 977 flow [2025-03-08 17:29:02,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=977, PETRI_PLACES=102, PETRI_TRANSITIONS=107} [2025-03-08 17:29:02,664 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 65 predicate places. [2025-03-08 17:29:02,664 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 107 transitions, 977 flow [2025-03-08 17:29:02,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:29:02,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:02,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:02,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:29:02,664 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:02,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1779122033, now seen corresponding path program 1 times [2025-03-08 17:29:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:02,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558504798] [2025-03-08 17:29:02,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:02,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:02,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 17:29:02,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:29:02,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:02,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:02,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:02,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558504798] [2025-03-08 17:29:02,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558504798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:29:02,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379673920] [2025-03-08 17:29:02,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:02,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:29:02,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:29:02,752 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-08 17:29:02,753 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-08 17:29:02,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 17:29:02,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:29:02,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:02,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:02,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 17:29:02,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:29:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:02,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:29:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:02,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379673920] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:29:02,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:29:02,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-08 17:29:02,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098264259] [2025-03-08 17:29:02,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:02,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:29:02,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:02,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:29:02,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:29:02,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:29:02,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 107 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-08 17:29:02,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:02,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:29:02,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:03,665 INFO L124 PetriNetUnfolderBase]: 7351/11051 cut-off events. [2025-03-08 17:29:03,666 INFO L125 PetriNetUnfolderBase]: For 29185/29185 co-relation queries the response was YES. [2025-03-08 17:29:03,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36221 conditions, 11051 events. 7351/11051 cut-off events. For 29185/29185 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 69645 event pairs, 3044 based on Foata normal form. 2/10725 useless extension candidates. Maximal degree in co-relation 32990. Up to 5791 conditions per place. [2025-03-08 17:29:03,710 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 124 selfloop transitions, 41 changer transitions 16/185 dead transitions. [2025-03-08 17:29:03,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 185 transitions, 1688 flow [2025-03-08 17:29:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:29:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:29:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2025-03-08 17:29:03,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-03-08 17:29:03,711 INFO L175 Difference]: Start difference. First operand has 102 places, 107 transitions, 977 flow. Second operand 7 states and 156 transitions. [2025-03-08 17:29:03,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 185 transitions, 1688 flow [2025-03-08 17:29:03,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 185 transitions, 1644 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-03-08 17:29:03,771 INFO L231 Difference]: Finished difference. Result has 108 places, 109 transitions, 1070 flow [2025-03-08 17:29:03,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1070, PETRI_PLACES=108, PETRI_TRANSITIONS=109} [2025-03-08 17:29:03,772 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 71 predicate places. [2025-03-08 17:29:03,772 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 1070 flow [2025-03-08 17:29:03,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-08 17:29:03,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:03,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:03,779 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-08 17:29:03,972 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,SelfDestructingSolverStorable11 [2025-03-08 17:29:03,972 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:03,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:03,973 INFO L85 PathProgramCache]: Analyzing trace with hash 282063230, now seen corresponding path program 1 times [2025-03-08 17:29:03,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:03,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116156335] [2025-03-08 17:29:03,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:03,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:03,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 17:29:03,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 17:29:03,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:03,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:04,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:04,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:04,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116156335] [2025-03-08 17:29:04,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116156335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:29:04,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955064024] [2025-03-08 17:29:04,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:04,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:29:04,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:29:04,076 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-08 17:29:04,077 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-08 17:29:04,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 17:29:04,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 17:29:04,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:04,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:04,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 17:29:04,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:29:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:04,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:29:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:04,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955064024] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:29:04,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:29:04,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-03-08 17:29:04,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241428159] [2025-03-08 17:29:04,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:29:04,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 17:29:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:04,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 17:29:04,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-08 17:29:04,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:29:04,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 1070 flow. Second operand has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 15 states have internal predecessors, (143), 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-08 17:29:04,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:04,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:29:04,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:06,177 INFO L124 PetriNetUnfolderBase]: 14261/21283 cut-off events. [2025-03-08 17:29:06,177 INFO L125 PetriNetUnfolderBase]: For 57624/57624 co-relation queries the response was YES. [2025-03-08 17:29:06,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70812 conditions, 21283 events. 14261/21283 cut-off events. For 57624/57624 co-relation queries the response was YES. Maximal size of possible extension queue 1286. Compared 145903 event pairs, 6827 based on Foata normal form. 9/20655 useless extension candidates. Maximal degree in co-relation 64382. Up to 5602 conditions per place. [2025-03-08 17:29:06,305 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 228 selfloop transitions, 19 changer transitions 126/377 dead transitions. [2025-03-08 17:29:06,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 377 transitions, 3989 flow [2025-03-08 17:29:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 17:29:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-08 17:29:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 338 transitions. [2025-03-08 17:29:06,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4225 [2025-03-08 17:29:06,307 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 1070 flow. Second operand 20 states and 338 transitions. [2025-03-08 17:29:06,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 377 transitions, 3989 flow [2025-03-08 17:29:06,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 377 transitions, 3692 flow, removed 37 selfloop flow, removed 6 redundant places. [2025-03-08 17:29:06,573 INFO L231 Difference]: Finished difference. Result has 131 places, 91 transitions, 754 flow [2025-03-08 17:29:06,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=754, PETRI_PLACES=131, PETRI_TRANSITIONS=91} [2025-03-08 17:29:06,573 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 94 predicate places. [2025-03-08 17:29:06,573 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 91 transitions, 754 flow [2025-03-08 17:29:06,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 15 states have internal predecessors, (143), 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-08 17:29:06,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:06,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:06,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 17:29:06,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:29:06,774 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:06,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:06,774 INFO L85 PathProgramCache]: Analyzing trace with hash 397637586, now seen corresponding path program 1 times [2025-03-08 17:29:06,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:06,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292383759] [2025-03-08 17:29:06,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:06,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:06,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 17:29:06,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 17:29:06,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:06,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:29:06,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:06,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292383759] [2025-03-08 17:29:06,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292383759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:06,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:06,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:06,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595402690] [2025-03-08 17:29:06,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:06,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:06,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:06,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:06,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:06,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:29:06,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 91 transitions, 754 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-08 17:29:06,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:06,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:29:06,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:07,626 INFO L124 PetriNetUnfolderBase]: 6051/9303 cut-off events. [2025-03-08 17:29:07,626 INFO L125 PetriNetUnfolderBase]: For 16213/16213 co-relation queries the response was YES. [2025-03-08 17:29:07,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27506 conditions, 9303 events. 6051/9303 cut-off events. For 16213/16213 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 59908 event pairs, 2510 based on Foata normal form. 548/9849 useless extension candidates. Maximal degree in co-relation 27463. Up to 4161 conditions per place. [2025-03-08 17:29:07,670 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 49 selfloop transitions, 4 changer transitions 59/116 dead transitions. [2025-03-08 17:29:07,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 1003 flow [2025-03-08 17:29:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:29:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:29:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-08 17:29:07,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.535 [2025-03-08 17:29:07,671 INFO L175 Difference]: Start difference. First operand has 131 places, 91 transitions, 754 flow. Second operand 5 states and 107 transitions. [2025-03-08 17:29:07,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 1003 flow [2025-03-08 17:29:07,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 116 transitions, 902 flow, removed 34 selfloop flow, removed 16 redundant places. [2025-03-08 17:29:07,729 INFO L231 Difference]: Finished difference. Result has 101 places, 57 transitions, 311 flow [2025-03-08 17:29:07,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=101, PETRI_TRANSITIONS=57} [2025-03-08 17:29:07,730 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 64 predicate places. [2025-03-08 17:29:07,730 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 57 transitions, 311 flow [2025-03-08 17:29:07,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-08 17:29:07,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:07,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:07,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 17:29:07,730 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:07,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:07,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1358537337, now seen corresponding path program 1 times [2025-03-08 17:29:07,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:07,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089751336] [2025-03-08 17:29:07,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:07,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:29:07,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:29:07,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:07,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:07,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:07,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089751336] [2025-03-08 17:29:07,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089751336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:29:07,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669411297] [2025-03-08 17:29:07,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:07,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:29:07,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:29:07,830 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-08 17:29:07,831 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-08 17:29:07,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:29:07,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:29:07,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:07,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:07,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 17:29:07,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:29:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:07,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:29:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:08,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669411297] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:29:08,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:29:08,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-08 17:29:08,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424463397] [2025-03-08 17:29:08,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:29:08,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 17:29:08,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:08,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 17:29:08,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:29:08,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:29:08,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 57 transitions, 311 flow. Second operand has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 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-08 17:29:08,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:08,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:29:08,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:08,742 INFO L124 PetriNetUnfolderBase]: 6293/9541 cut-off events. [2025-03-08 17:29:08,742 INFO L125 PetriNetUnfolderBase]: For 13977/13977 co-relation queries the response was YES. [2025-03-08 17:29:08,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26737 conditions, 9541 events. 6293/9541 cut-off events. For 13977/13977 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 59253 event pairs, 1613 based on Foata normal form. 2/9495 useless extension candidates. Maximal degree in co-relation 26705. Up to 3291 conditions per place. [2025-03-08 17:29:08,785 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 143 selfloop transitions, 24 changer transitions 3/174 dead transitions. [2025-03-08 17:29:08,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 174 transitions, 1185 flow [2025-03-08 17:29:08,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:29:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 17:29:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 218 transitions. [2025-03-08 17:29:08,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45416666666666666 [2025-03-08 17:29:08,786 INFO L175 Difference]: Start difference. First operand has 101 places, 57 transitions, 311 flow. Second operand 12 states and 218 transitions. [2025-03-08 17:29:08,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 174 transitions, 1185 flow [2025-03-08 17:29:08,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 174 transitions, 1036 flow, removed 64 selfloop flow, removed 14 redundant places. [2025-03-08 17:29:08,857 INFO L231 Difference]: Finished difference. Result has 81 places, 72 transitions, 465 flow [2025-03-08 17:29:08,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=465, PETRI_PLACES=81, PETRI_TRANSITIONS=72} [2025-03-08 17:29:08,858 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 44 predicate places. [2025-03-08 17:29:08,858 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 465 flow [2025-03-08 17:29:08,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 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-08 17:29:08,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:08,858 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, 1, 1, 1, 1] [2025-03-08 17:29:08,864 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-08 17:29:09,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 17:29:09,059 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:09,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1218144265, now seen corresponding path program 1 times [2025-03-08 17:29:09,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:09,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703522069] [2025-03-08 17:29:09,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:09,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:29:09,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:29:09,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:09,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 17:29:09,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:09,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703522069] [2025-03-08 17:29:09,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703522069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:09,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:09,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:09,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723231637] [2025-03-08 17:29:09,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:09,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:09,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:09,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:09,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:09,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:29:09,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 465 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-08 17:29:09,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:09,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:29:09,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:09,511 INFO L124 PetriNetUnfolderBase]: 5227/7877 cut-off events. [2025-03-08 17:29:09,511 INFO L125 PetriNetUnfolderBase]: For 6483/6483 co-relation queries the response was YES. [2025-03-08 17:29:09,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20454 conditions, 7877 events. 5227/7877 cut-off events. For 6483/6483 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 46622 event pairs, 2871 based on Foata normal form. 156/8018 useless extension candidates. Maximal degree in co-relation 20428. Up to 5697 conditions per place. [2025-03-08 17:29:09,538 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 52 selfloop transitions, 6 changer transitions 46/108 dead transitions. [2025-03-08 17:29:09,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 108 transitions, 821 flow [2025-03-08 17:29:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:29:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:29:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-03-08 17:29:09,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-03-08 17:29:09,539 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 465 flow. Second operand 5 states and 98 transitions. [2025-03-08 17:29:09,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 108 transitions, 821 flow [2025-03-08 17:29:09,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 108 transitions, 792 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-08 17:29:09,564 INFO L231 Difference]: Finished difference. Result has 84 places, 62 transitions, 346 flow [2025-03-08 17:29:09,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=84, PETRI_TRANSITIONS=62} [2025-03-08 17:29:09,564 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 47 predicate places. [2025-03-08 17:29:09,564 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 62 transitions, 346 flow [2025-03-08 17:29:09,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-08 17:29:09,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:09,565 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, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:09,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 17:29:09,565 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:09,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:09,565 INFO L85 PathProgramCache]: Analyzing trace with hash 45218570, now seen corresponding path program 2 times [2025-03-08 17:29:09,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:09,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641607482] [2025-03-08 17:29:09,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:29:09,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:09,570 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:29:09,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 29 statements. [2025-03-08 17:29:09,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:29:09,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 17:29:09,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:09,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641607482] [2025-03-08 17:29:09,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641607482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:09,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:09,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:09,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057591386] [2025-03-08 17:29:09,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:09,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:09,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:09,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:09,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:09,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:29:09,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 62 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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-08 17:29:09,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:09,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:29:09,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:10,116 INFO L124 PetriNetUnfolderBase]: 6823/9960 cut-off events. [2025-03-08 17:29:10,116 INFO L125 PetriNetUnfolderBase]: For 5427/5427 co-relation queries the response was YES. [2025-03-08 17:29:10,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24351 conditions, 9960 events. 6823/9960 cut-off events. For 5427/5427 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 58798 event pairs, 994 based on Foata normal form. 1/9389 useless extension candidates. Maximal degree in co-relation 24324. Up to 3638 conditions per place. [2025-03-08 17:29:10,157 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 105 selfloop transitions, 23 changer transitions 1/133 dead transitions. [2025-03-08 17:29:10,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 133 transitions, 867 flow [2025-03-08 17:29:10,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:29:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:29:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-03-08 17:29:10,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5708333333333333 [2025-03-08 17:29:10,158 INFO L175 Difference]: Start difference. First operand has 84 places, 62 transitions, 346 flow. Second operand 6 states and 137 transitions. [2025-03-08 17:29:10,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 133 transitions, 867 flow [2025-03-08 17:29:10,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 133 transitions, 802 flow, removed 24 selfloop flow, removed 8 redundant places. [2025-03-08 17:29:10,198 INFO L231 Difference]: Finished difference. Result has 76 places, 78 transitions, 474 flow [2025-03-08 17:29:10,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=76, PETRI_TRANSITIONS=78} [2025-03-08 17:29:10,198 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 39 predicate places. [2025-03-08 17:29:10,198 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 78 transitions, 474 flow [2025-03-08 17:29:10,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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-08 17:29:10,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:10,198 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, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:10,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 17:29:10,199 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:10,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:10,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1407380740, now seen corresponding path program 3 times [2025-03-08 17:29:10,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:10,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195904201] [2025-03-08 17:29:10,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:29:10,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:10,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:29:10,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 29 statements. [2025-03-08 17:29:10,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:29:10,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 17:29:10,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:10,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195904201] [2025-03-08 17:29:10,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195904201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:10,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:10,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094400345] [2025-03-08 17:29:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:10,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:10,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:10,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:10,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:10,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:29:10,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 78 transitions, 474 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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-08 17:29:10,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:10,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:29:10,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:10,915 INFO L124 PetriNetUnfolderBase]: 9323/13522 cut-off events. [2025-03-08 17:29:10,915 INFO L125 PetriNetUnfolderBase]: For 10506/10506 co-relation queries the response was YES. [2025-03-08 17:29:10,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34874 conditions, 13522 events. 9323/13522 cut-off events. For 10506/10506 co-relation queries the response was YES. Maximal size of possible extension queue 905. Compared 83672 event pairs, 1228 based on Foata normal form. 1/13519 useless extension candidates. Maximal degree in co-relation 34850. Up to 5532 conditions per place. [2025-03-08 17:29:10,972 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 107 selfloop transitions, 32 changer transitions 1/144 dead transitions. [2025-03-08 17:29:10,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 144 transitions, 997 flow [2025-03-08 17:29:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:29:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:29:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2025-03-08 17:29:10,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5791666666666667 [2025-03-08 17:29:10,973 INFO L175 Difference]: Start difference. First operand has 76 places, 78 transitions, 474 flow. Second operand 6 states and 139 transitions. [2025-03-08 17:29:10,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 144 transitions, 997 flow [2025-03-08 17:29:10,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 144 transitions, 993 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-08 17:29:10,982 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 680 flow [2025-03-08 17:29:10,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=680, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2025-03-08 17:29:10,982 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 47 predicate places. [2025-03-08 17:29:10,982 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 680 flow [2025-03-08 17:29:10,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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-08 17:29:10,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:10,982 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, 1, 1, 1, 1, 1] [2025-03-08 17:29:10,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 17:29:10,983 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:10,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:10,983 INFO L85 PathProgramCache]: Analyzing trace with hash -303200582, now seen corresponding path program 1 times [2025-03-08 17:29:10,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:10,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56206693] [2025-03-08 17:29:10,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:10,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:10,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:29:10,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:29:10,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:10,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:11,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:11,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56206693] [2025-03-08 17:29:11,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56206693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:29:11,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826245971] [2025-03-08 17:29:11,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:11,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:29:11,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:29:11,076 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-08 17:29:11,077 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-08 17:29:11,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:29:11,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:29:11,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:11,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:11,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 17:29:11,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:29:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:11,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:29:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:11,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826245971] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:29:11,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:29:11,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-08 17:29:11,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511425943] [2025-03-08 17:29:11,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:29:11,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 17:29:11,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:11,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 17:29:11,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-08 17:29:11,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:29:11,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 90 transitions, 680 flow. Second operand has 18 states, 18 states have (on average 9.833333333333334) internal successors, (177), 18 states have internal predecessors, (177), 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-08 17:29:11,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:11,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:29:11,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:12,600 INFO L124 PetriNetUnfolderBase]: 14440/20851 cut-off events. [2025-03-08 17:29:12,600 INFO L125 PetriNetUnfolderBase]: For 36868/36868 co-relation queries the response was YES. [2025-03-08 17:29:12,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60472 conditions, 20851 events. 14440/20851 cut-off events. For 36868/36868 co-relation queries the response was YES. Maximal size of possible extension queue 1325. Compared 135069 event pairs, 6437 based on Foata normal form. 7/20820 useless extension candidates. Maximal degree in co-relation 60444. Up to 6336 conditions per place. [2025-03-08 17:29:12,684 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 193 selfloop transitions, 21 changer transitions 2/220 dead transitions. [2025-03-08 17:29:12,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 220 transitions, 2035 flow [2025-03-08 17:29:12,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:29:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 17:29:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2025-03-08 17:29:12,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.445 [2025-03-08 17:29:12,685 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 680 flow. Second operand 10 states and 178 transitions. [2025-03-08 17:29:12,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 220 transitions, 2035 flow [2025-03-08 17:29:12,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 220 transitions, 1947 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-03-08 17:29:12,753 INFO L231 Difference]: Finished difference. Result has 95 places, 103 transitions, 821 flow [2025-03-08 17:29:12,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=821, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2025-03-08 17:29:12,753 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 58 predicate places. [2025-03-08 17:29:12,753 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 821 flow [2025-03-08 17:29:12,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.833333333333334) internal successors, (177), 18 states have internal predecessors, (177), 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-08 17:29:12,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:12,753 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, 1, 1, 1, 1, 1] [2025-03-08 17:29:12,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 17:29:12,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:29:12,954 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:12,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:12,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1643573438, now seen corresponding path program 2 times [2025-03-08 17:29:12,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:12,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646255527] [2025-03-08 17:29:12,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:29:12,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:12,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:29:12,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 29 statements. [2025-03-08 17:29:12,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:29:12,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 17:29:13,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:13,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646255527] [2025-03-08 17:29:13,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646255527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:13,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:13,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:29:13,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512389677] [2025-03-08 17:29:13,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:13,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:29:13,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:13,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:29:13,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:29:13,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-08 17:29:13,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 821 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:29:13,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:13,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-08 17:29:13,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:16,419 INFO L124 PetriNetUnfolderBase]: 43914/61776 cut-off events. [2025-03-08 17:29:16,419 INFO L125 PetriNetUnfolderBase]: For 113281/113281 co-relation queries the response was YES. [2025-03-08 17:29:16,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180011 conditions, 61776 events. 43914/61776 cut-off events. For 113281/113281 co-relation queries the response was YES. Maximal size of possible extension queue 3456. Compared 437268 event pairs, 2688 based on Foata normal form. 10/58627 useless extension candidates. Maximal degree in co-relation 179979. Up to 23322 conditions per place. [2025-03-08 17:29:16,828 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 246 selfloop transitions, 39 changer transitions 55/343 dead transitions. [2025-03-08 17:29:16,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 343 transitions, 3277 flow [2025-03-08 17:29:16,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:29:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:29:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2025-03-08 17:29:16,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-03-08 17:29:16,829 INFO L175 Difference]: Start difference. First operand has 95 places, 103 transitions, 821 flow. Second operand 9 states and 208 transitions. [2025-03-08 17:29:16,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 343 transitions, 3277 flow [2025-03-08 17:29:17,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 343 transitions, 3260 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-08 17:29:17,127 INFO L231 Difference]: Finished difference. Result has 106 places, 136 transitions, 1284 flow [2025-03-08 17:29:17,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1284, PETRI_PLACES=106, PETRI_TRANSITIONS=136} [2025-03-08 17:29:17,127 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 69 predicate places. [2025-03-08 17:29:17,127 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 136 transitions, 1284 flow [2025-03-08 17:29:17,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:29:17,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:17,127 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, 1, 1, 1, 1, 1] [2025-03-08 17:29:17,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 17:29:17,128 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:17,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:17,128 INFO L85 PathProgramCache]: Analyzing trace with hash 578199300, now seen corresponding path program 3 times [2025-03-08 17:29:17,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:17,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495702061] [2025-03-08 17:29:17,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:29:17,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:17,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:29:17,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 29 statements. [2025-03-08 17:29:17,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:29:17,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 17:29:17,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:17,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495702061] [2025-03-08 17:29:17,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495702061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:17,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:17,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:29:17,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072559542] [2025-03-08 17:29:17,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:17,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:29:17,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:17,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:29:17,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:29:17,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-08 17:29:17,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 136 transitions, 1284 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-08 17:29:17,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:17,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-08 17:29:17,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:23,395 INFO L124 PetriNetUnfolderBase]: 55979/77382 cut-off events. [2025-03-08 17:29:23,395 INFO L125 PetriNetUnfolderBase]: For 217619/217831 co-relation queries the response was YES. [2025-03-08 17:29:24,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265348 conditions, 77382 events. 55979/77382 cut-off events. For 217619/217831 co-relation queries the response was YES. Maximal size of possible extension queue 4356. Compared 535150 event pairs, 16426 based on Foata normal form. 120/73440 useless extension candidates. Maximal degree in co-relation 265310. Up to 35461 conditions per place. [2025-03-08 17:29:24,302 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 268 selfloop transitions, 54 changer transitions 4/329 dead transitions. [2025-03-08 17:29:24,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 329 transitions, 3584 flow [2025-03-08 17:29:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:29:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:29:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2025-03-08 17:29:24,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-08 17:29:24,303 INFO L175 Difference]: Start difference. First operand has 106 places, 136 transitions, 1284 flow. Second operand 8 states and 180 transitions. [2025-03-08 17:29:24,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 329 transitions, 3584 flow [2025-03-08 17:29:25,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 329 transitions, 3564 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-08 17:29:25,902 INFO L231 Difference]: Finished difference. Result has 115 places, 182 transitions, 2080 flow [2025-03-08 17:29:25,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2080, PETRI_PLACES=115, PETRI_TRANSITIONS=182} [2025-03-08 17:29:25,902 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 78 predicate places. [2025-03-08 17:29:25,902 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 182 transitions, 2080 flow [2025-03-08 17:29:25,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-08 17:29:25,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:25,902 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, 1, 1, 1, 1, 1] [2025-03-08 17:29:25,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 17:29:25,903 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:25,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:25,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1000609148, now seen corresponding path program 4 times [2025-03-08 17:29:25,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:25,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129453473] [2025-03-08 17:29:25,903 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:29:25,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:25,909 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:29:25,911 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 29 statements. [2025-03-08 17:29:25,911 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 17:29:25,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 17:29:25,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:25,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129453473] [2025-03-08 17:29:25,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129453473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:25,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:25,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:29:25,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069280767] [2025-03-08 17:29:25,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:25,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:29:25,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:25,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:29:25,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:29:25,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-08 17:29:25,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 182 transitions, 2080 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-08 17:29:25,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:25,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-08 17:29:25,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:35,937 INFO L124 PetriNetUnfolderBase]: 81279/114605 cut-off events. [2025-03-08 17:29:35,937 INFO L125 PetriNetUnfolderBase]: For 463370/463370 co-relation queries the response was YES. [2025-03-08 17:29:36,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432336 conditions, 114605 events. 81279/114605 cut-off events. For 463370/463370 co-relation queries the response was YES. Maximal size of possible extension queue 6562. Compared 868833 event pairs, 13423 based on Foata normal form. 12/114614 useless extension candidates. Maximal degree in co-relation 432293. Up to 64357 conditions per place. [2025-03-08 17:29:37,208 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 227 selfloop transitions, 70 changer transitions 47/348 dead transitions. [2025-03-08 17:29:37,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 348 transitions, 4507 flow [2025-03-08 17:29:37,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:29:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:29:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2025-03-08 17:29:37,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2025-03-08 17:29:37,209 INFO L175 Difference]: Start difference. First operand has 115 places, 182 transitions, 2080 flow. Second operand 6 states and 131 transitions. [2025-03-08 17:29:37,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 348 transitions, 4507 flow [2025-03-08 17:29:39,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 348 transitions, 4444 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-03-08 17:29:39,918 INFO L231 Difference]: Finished difference. Result has 122 places, 202 transitions, 2621 flow [2025-03-08 17:29:39,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2050, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2621, PETRI_PLACES=122, PETRI_TRANSITIONS=202} [2025-03-08 17:29:39,918 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 85 predicate places. [2025-03-08 17:29:39,918 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 202 transitions, 2621 flow [2025-03-08 17:29:39,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-08 17:29:39,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:39,919 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, 1, 1, 1, 1, 1] [2025-03-08 17:29:39,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 17:29:39,919 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:39,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:39,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1766648892, now seen corresponding path program 5 times [2025-03-08 17:29:39,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:39,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976883383] [2025-03-08 17:29:39,919 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:29:39,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:39,925 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:29:39,933 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:29:39,934 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:29:39,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:40,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:40,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976883383] [2025-03-08 17:29:40,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976883383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:29:40,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178966307] [2025-03-08 17:29:40,125 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:29:40,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:29:40,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:29:40,127 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-08 17:29:40,128 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-08 17:29:40,190 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:29:40,212 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:29:40,212 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:29:40,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:40,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 17:29:40,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:29:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:29:40,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:29:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:29:40,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178966307] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:29:40,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:29:40,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 16 [2025-03-08 17:29:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051635184] [2025-03-08 17:29:40,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:40,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:29:40,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:40,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:29:40,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-08 17:29:40,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-08 17:29:40,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 202 transitions, 2621 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:29:40,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:40,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-08 17:29:40,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand